./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:54:35,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:54:35,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:54:35,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:54:35,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:54:35,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:54:35,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:54:35,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:54:35,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:54:35,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:54:35,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:54:35,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:54:35,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:54:35,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:54:35,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:54:35,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:54:35,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:54:35,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:54:35,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:54:35,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:54:35,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:54:35,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:54:35,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:54:35,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:54:35,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:54:35,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:54:35,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:54:35,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:54:35,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:54:35,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:54:35,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:54:35,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:54:35,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:54:35,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:54:35,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:54:35,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:54:35,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:54:35,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:54:35,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:54:35,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:54:35,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:54:35,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:54:35,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:54:35,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:54:35,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:54:35,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:54:35,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:54:35,174 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:54:35,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:54:35,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:54:35,174 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:54:35,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:54:35,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:54:35,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:54:35,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:54:35,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:54:35,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:54:35,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:54:35,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:54:35,176 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:54:35,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:54:35,176 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:54:35,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:54:35,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:54:35,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:54:35,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:54:35,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:54:35,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:54:35,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:54:35,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:54:35,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:54:35,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:54:35,178 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:54:35,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:54:35,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:54:35,178 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2022-02-20 19:54:35,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:54:35,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:54:35,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:54:35,373 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:54:35,374 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:54:35,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-02-20 19:54:35,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8f95fc9/1ee6334d770e454eadec7d5236b4dede/FLAGf04d503f2 [2022-02-20 19:54:35,815 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:54:35,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-02-20 19:54:35,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8f95fc9/1ee6334d770e454eadec7d5236b4dede/FLAGf04d503f2 [2022-02-20 19:54:35,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d8f95fc9/1ee6334d770e454eadec7d5236b4dede [2022-02-20 19:54:35,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:54:35,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:54:35,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:54:35,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:54:35,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:54:35,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:54:35" (1/1) ... [2022-02-20 19:54:35,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616953ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:35, skipping insertion in model container [2022-02-20 19:54:35,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:54:35" (1/1) ... [2022-02-20 19:54:35,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:54:35,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:54:35,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-02-20 19:54:35,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-02-20 19:54:36,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:54:36,016 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:54:36,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2022-02-20 19:54:36,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2022-02-20 19:54:36,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:54:36,093 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:54:36,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36 WrapperNode [2022-02-20 19:54:36,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:54:36,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:54:36,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:54:36,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:54:36,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,137 INFO L137 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 417 [2022-02-20 19:54:36,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:54:36,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:54:36,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:54:36,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:54:36,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:54:36,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:54:36,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:54:36,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:54:36,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (1/1) ... [2022-02-20 19:54:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:54:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:54:36,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:54:36,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:54:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:54:36,243 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:54:36,244 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:54:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-02-20 19:54:36,244 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-02-20 19:54:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:54:36,244 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:54:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:54:36,244 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:54:36,244 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:54:36,244 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:54:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:54:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:54:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:54:36,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:54:36,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:54:36,246 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:54:36,246 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:54:36,304 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:54:36,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:54:36,656 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:54:36,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:54:36,663 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 19:54:36,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:36 BoogieIcfgContainer [2022-02-20 19:54:36,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:54:36,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:54:36,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:54:36,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:54:36,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:54:35" (1/3) ... [2022-02-20 19:54:36,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5daf9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:36, skipping insertion in model container [2022-02-20 19:54:36,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:54:36" (2/3) ... [2022-02-20 19:54:36,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5daf9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:54:36, skipping insertion in model container [2022-02-20 19:54:36,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:54:36" (3/3) ... [2022-02-20 19:54:36,686 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2022-02-20 19:54:36,689 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:54:36,690 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:54:36,721 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:54:36,726 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:54:36,726 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:54:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 19:54:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:54:36,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:36,754 INFO L514 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] [2022-02-20 19:54:36,754 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:36,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1946471914, now seen corresponding path program 1 times [2022-02-20 19:54:36,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:36,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518239536] [2022-02-20 19:54:36,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:36,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:36,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#true} havoc ~__retres1~2; {182#true} is VALID [2022-02-20 19:54:36,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:36,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:36,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {184#(= ~p_dw_st~0 0)} assume true; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:36,992 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {184#(= ~p_dw_st~0 0)} {184#(= ~p_dw_st~0 0)} #590#return; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:36,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 19:54:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:37,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {182#true} is VALID [2022-02-20 19:54:37,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} assume 1 == ~p_dw_pc~0; {182#true} is VALID [2022-02-20 19:54:37,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {182#true} is VALID [2022-02-20 19:54:37,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {182#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {182#true} is VALID [2022-02-20 19:54:37,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {182#true} is VALID [2022-02-20 19:54:37,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {182#true} is VALID [2022-02-20 19:54:37,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {182#true} is VALID [2022-02-20 19:54:37,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#true} assume !(1 == ~c_dr_pc~0); {182#true} is VALID [2022-02-20 19:54:37,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {182#true} is VALID [2022-02-20 19:54:37,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {182#true} is VALID [2022-02-20 19:54:37,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {182#true} is VALID [2022-02-20 19:54:37,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {182#true} is VALID [2022-02-20 19:54:37,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {182#true} assume true; {182#true} is VALID [2022-02-20 19:54:37,031 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {182#true} {183#false} #594#return; {183#false} is VALID [2022-02-20 19:54:37,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {182#true} is VALID [2022-02-20 19:54:37,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {182#true} is VALID [2022-02-20 19:54:37,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {182#true} is VALID [2022-02-20 19:54:37,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {182#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {182#true} is VALID [2022-02-20 19:54:37,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {184#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#(= ~p_dw_st~0 0)} assume !false; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#(= ~p_dw_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(= ~p_dw_st~0 0)} assume !false; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,038 INFO L272 TraceCheckUtils]: 10: Hoare triple {184#(= ~p_dw_st~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {182#true} is VALID [2022-02-20 19:54:37,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#true} havoc ~__retres1~2; {182#true} is VALID [2022-02-20 19:54:37,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {182#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {184#(= ~p_dw_st~0 0)} assume true; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,041 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {184#(= ~p_dw_st~0 0)} {184#(= ~p_dw_st~0 0)} #590#return; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {184#(= ~p_dw_st~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {184#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {184#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:54:37,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {184#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {183#false} is VALID [2022-02-20 19:54:37,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {183#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {183#false} is VALID [2022-02-20 19:54:37,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {183#false} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {183#false} is VALID [2022-02-20 19:54:37,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {183#false} assume 0 == ~c_dr_pc~0; {183#false} is VALID [2022-02-20 19:54:37,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 19:54:37,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {183#false} assume !(1 == ~q_free~0); {183#false} is VALID [2022-02-20 19:54:37,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {183#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {183#false} is VALID [2022-02-20 19:54:37,044 INFO L272 TraceCheckUtils]: 25: Hoare triple {183#false} call immediate_notify_threads(); {204#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:54:37,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {204#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {182#true} is VALID [2022-02-20 19:54:37,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {182#true} assume 1 == ~p_dw_pc~0; {182#true} is VALID [2022-02-20 19:54:37,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {182#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {182#true} is VALID [2022-02-20 19:54:37,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {182#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {182#true} is VALID [2022-02-20 19:54:37,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {182#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {182#true} is VALID [2022-02-20 19:54:37,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {182#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {182#true} is VALID [2022-02-20 19:54:37,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {182#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {182#true} is VALID [2022-02-20 19:54:37,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {182#true} assume !(1 == ~c_dr_pc~0); {182#true} is VALID [2022-02-20 19:54:37,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {182#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {182#true} is VALID [2022-02-20 19:54:37,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {182#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {182#true} is VALID [2022-02-20 19:54:37,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {182#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {182#true} is VALID [2022-02-20 19:54:37,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {182#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {182#true} is VALID [2022-02-20 19:54:37,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {182#true} assume true; {182#true} is VALID [2022-02-20 19:54:37,051 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {182#true} {183#false} #594#return; {183#false} is VALID [2022-02-20 19:54:37,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {183#false} ~q_read_ev~0 := 2; {183#false} is VALID [2022-02-20 19:54:37,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {183#false} assume !(~p_last_write~0 == ~c_last_read~0); {183#false} is VALID [2022-02-20 19:54:37,052 INFO L272 TraceCheckUtils]: 42: Hoare triple {183#false} call error1(); {183#false} is VALID [2022-02-20 19:54:37,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 19:54:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:37,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:37,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518239536] [2022-02-20 19:54:37,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518239536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:37,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:37,058 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:37,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53490961] [2022-02-20 19:54:37,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 19:54:37,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:37,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:37,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:37,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:37,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:37,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:37,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:37,138 INFO L87 Difference]: Start difference. First operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:37,740 INFO L93 Difference]: Finished difference Result 414 states and 624 transitions. [2022-02-20 19:54:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:37,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-02-20 19:54:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2022-02-20 19:54:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2022-02-20 19:54:37,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 624 transitions. [2022-02-20 19:54:38,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:38,169 INFO L225 Difference]: With dead ends: 414 [2022-02-20 19:54:38,170 INFO L226 Difference]: Without dead ends: 239 [2022-02-20 19:54:38,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:38,175 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 284 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:38,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 471 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-20 19:54:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2022-02-20 19:54:38,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:38,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-02-20 19:54:38,215 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-02-20 19:54:38,216 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-02-20 19:54:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:38,227 INFO L93 Difference]: Finished difference Result 239 states and 334 transitions. [2022-02-20 19:54:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2022-02-20 19:54:38,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:38,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:38,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) Second operand 239 states. [2022-02-20 19:54:38,232 INFO L87 Difference]: Start difference. First operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) Second operand 239 states. [2022-02-20 19:54:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:38,240 INFO L93 Difference]: Finished difference Result 239 states and 334 transitions. [2022-02-20 19:54:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 334 transitions. [2022-02-20 19:54:38,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:38,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:38,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:38,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-02-20 19:54:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 328 transitions. [2022-02-20 19:54:38,252 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 328 transitions. Word has length 44 [2022-02-20 19:54:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:38,252 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 328 transitions. [2022-02-20 19:54:38,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 328 transitions. [2022-02-20 19:54:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:54:38,254 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:38,254 INFO L514 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] [2022-02-20 19:54:38,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:54:38,254 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:38,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:38,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1644174286, now seen corresponding path program 1 times [2022-02-20 19:54:38,255 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:38,255 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283109810] [2022-02-20 19:54:38,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:38,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:38,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {1590#true} havoc ~__retres1~2; {1590#true} is VALID [2022-02-20 19:54:38,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {1590#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1590#true} is VALID [2022-02-20 19:54:38,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {1590#true} #res := ~__retres1~2; {1590#true} is VALID [2022-02-20 19:54:38,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {1590#true} assume true; {1590#true} is VALID [2022-02-20 19:54:38,300 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1590#true} {1592#(= ~q_free~0 1)} #590#return; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 19:54:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:38,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {1590#true} is VALID [2022-02-20 19:54:38,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {1590#true} assume 1 == ~p_dw_pc~0; {1590#true} is VALID [2022-02-20 19:54:38,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {1590#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {1590#true} is VALID [2022-02-20 19:54:38,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {1590#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {1590#true} is VALID [2022-02-20 19:54:38,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {1590#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {1590#true} is VALID [2022-02-20 19:54:38,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {1590#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {1590#true} is VALID [2022-02-20 19:54:38,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1590#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {1590#true} is VALID [2022-02-20 19:54:38,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1590#true} assume !(1 == ~c_dr_pc~0); {1590#true} is VALID [2022-02-20 19:54:38,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1590#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {1590#true} is VALID [2022-02-20 19:54:38,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {1590#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {1590#true} is VALID [2022-02-20 19:54:38,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {1590#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {1590#true} is VALID [2022-02-20 19:54:38,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {1590#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {1590#true} is VALID [2022-02-20 19:54:38,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {1590#true} assume true; {1590#true} is VALID [2022-02-20 19:54:38,314 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1590#true} {1591#false} #594#return; {1591#false} is VALID [2022-02-20 19:54:38,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {1590#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {1590#true} is VALID [2022-02-20 19:54:38,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {1590#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {1590#true} is VALID [2022-02-20 19:54:38,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {1590#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {1592#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {1592#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {1592#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {1592#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {1592#(= ~q_free~0 1)} assume !false; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {1592#(= ~q_free~0 1)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {1592#(= ~q_free~0 1)} assume !false; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,327 INFO L272 TraceCheckUtils]: 10: Hoare triple {1592#(= ~q_free~0 1)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {1590#true} is VALID [2022-02-20 19:54:38,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {1590#true} havoc ~__retres1~2; {1590#true} is VALID [2022-02-20 19:54:38,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {1590#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1590#true} is VALID [2022-02-20 19:54:38,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {1590#true} #res := ~__retres1~2; {1590#true} is VALID [2022-02-20 19:54:38,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {1590#true} assume true; {1590#true} is VALID [2022-02-20 19:54:38,328 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1590#true} {1592#(= ~q_free~0 1)} #590#return; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {1592#(= ~q_free~0 1)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {1592#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {1592#(= ~q_free~0 1)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {1592#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~1#1); {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {1592#(= ~q_free~0 1)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {1592#(= ~q_free~0 1)} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {1592#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {1592#(= ~q_free~0 1)} assume !false; {1592#(= ~q_free~0 1)} is VALID [2022-02-20 19:54:38,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {1592#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {1591#false} is VALID [2022-02-20 19:54:38,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {1591#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {1591#false} is VALID [2022-02-20 19:54:38,336 INFO L272 TraceCheckUtils]: 26: Hoare triple {1591#false} call immediate_notify_threads(); {1612#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:54:38,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {1612#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {1590#true} is VALID [2022-02-20 19:54:38,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {1590#true} assume 1 == ~p_dw_pc~0; {1590#true} is VALID [2022-02-20 19:54:38,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {1590#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {1590#true} is VALID [2022-02-20 19:54:38,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {1590#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {1590#true} is VALID [2022-02-20 19:54:38,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {1590#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {1590#true} is VALID [2022-02-20 19:54:38,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {1590#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {1590#true} is VALID [2022-02-20 19:54:38,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {1590#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {1590#true} is VALID [2022-02-20 19:54:38,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {1590#true} assume !(1 == ~c_dr_pc~0); {1590#true} is VALID [2022-02-20 19:54:38,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {1590#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {1590#true} is VALID [2022-02-20 19:54:38,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {1590#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {1590#true} is VALID [2022-02-20 19:54:38,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {1590#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {1590#true} is VALID [2022-02-20 19:54:38,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {1590#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {1590#true} is VALID [2022-02-20 19:54:38,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {1590#true} assume true; {1590#true} is VALID [2022-02-20 19:54:38,354 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1590#true} {1591#false} #594#return; {1591#false} is VALID [2022-02-20 19:54:38,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {1591#false} ~q_read_ev~0 := 2; {1591#false} is VALID [2022-02-20 19:54:38,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {1591#false} assume !(~p_last_write~0 == ~c_last_read~0); {1591#false} is VALID [2022-02-20 19:54:38,355 INFO L272 TraceCheckUtils]: 43: Hoare triple {1591#false} call error1(); {1591#false} is VALID [2022-02-20 19:54:38,355 INFO L290 TraceCheckUtils]: 44: Hoare triple {1591#false} assume !false; {1591#false} is VALID [2022-02-20 19:54:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:38,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:38,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283109810] [2022-02-20 19:54:38,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283109810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:38,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:38,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:38,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830521945] [2022-02-20 19:54:38,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:38,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:38,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:38,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:38,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:38,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:38,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:38,383 INFO L87 Difference]: Start difference. First operand 233 states and 328 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:38,797 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2022-02-20 19:54:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 416 transitions. [2022-02-20 19:54:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 416 transitions. [2022-02-20 19:54:38,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 416 transitions. [2022-02-20 19:54:39,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:39,086 INFO L225 Difference]: With dead ends: 481 [2022-02-20 19:54:39,086 INFO L226 Difference]: Without dead ends: 357 [2022-02-20 19:54:39,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:39,088 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 148 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:39,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 568 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-02-20 19:54:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2022-02-20 19:54:39,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:39,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-02-20 19:54:39,114 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-02-20 19:54:39,115 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-02-20 19:54:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:39,124 INFO L93 Difference]: Finished difference Result 357 states and 492 transitions. [2022-02-20 19:54:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 492 transitions. [2022-02-20 19:54:39,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:39,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:39,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) Second operand 357 states. [2022-02-20 19:54:39,127 INFO L87 Difference]: Start difference. First operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) Second operand 357 states. [2022-02-20 19:54:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:39,137 INFO L93 Difference]: Finished difference Result 357 states and 492 transitions. [2022-02-20 19:54:39,137 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 492 transitions. [2022-02-20 19:54:39,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:39,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:39,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:39,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-02-20 19:54:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 418 transitions. [2022-02-20 19:54:39,148 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 418 transitions. Word has length 45 [2022-02-20 19:54:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:39,148 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 418 transitions. [2022-02-20 19:54:39,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 418 transitions. [2022-02-20 19:54:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 19:54:39,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:39,149 INFO L514 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] [2022-02-20 19:54:39,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:54:39,150 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 359816825, now seen corresponding path program 1 times [2022-02-20 19:54:39,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:39,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155706064] [2022-02-20 19:54:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:54:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:39,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {3406#true} havoc ~__retres1~2; {3406#true} is VALID [2022-02-20 19:54:39,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {3406#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3406#true} is VALID [2022-02-20 19:54:39,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {3406#true} #res := ~__retres1~2; {3406#true} is VALID [2022-02-20 19:54:39,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {3406#true} assume true; {3406#true} is VALID [2022-02-20 19:54:39,184 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3406#true} {3408#(= ~c_dr_pc~0 0)} #590#return; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 19:54:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:39,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {3428#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {3406#true} is VALID [2022-02-20 19:54:39,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {3406#true} assume 1 == ~p_dw_pc~0; {3406#true} is VALID [2022-02-20 19:54:39,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {3406#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {3406#true} is VALID [2022-02-20 19:54:39,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {3406#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {3406#true} is VALID [2022-02-20 19:54:39,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {3406#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {3406#true} is VALID [2022-02-20 19:54:39,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {3406#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {3406#true} is VALID [2022-02-20 19:54:39,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {3406#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {3406#true} is VALID [2022-02-20 19:54:39,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {3406#true} assume !(1 == ~c_dr_pc~0); {3406#true} is VALID [2022-02-20 19:54:39,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {3406#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {3406#true} is VALID [2022-02-20 19:54:39,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {3406#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {3406#true} is VALID [2022-02-20 19:54:39,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {3406#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {3406#true} is VALID [2022-02-20 19:54:39,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {3406#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {3406#true} is VALID [2022-02-20 19:54:39,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {3406#true} assume true; {3406#true} is VALID [2022-02-20 19:54:39,198 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3406#true} {3407#false} #594#return; {3407#false} is VALID [2022-02-20 19:54:39,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {3406#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {3406#true} is VALID [2022-02-20 19:54:39,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {3406#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {3406#true} is VALID [2022-02-20 19:54:39,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {3406#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume !false; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {3408#(= ~c_dr_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume !false; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,201 INFO L272 TraceCheckUtils]: 10: Hoare triple {3408#(= ~c_dr_pc~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {3406#true} is VALID [2022-02-20 19:54:39,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {3406#true} havoc ~__retres1~2; {3406#true} is VALID [2022-02-20 19:54:39,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {3406#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3406#true} is VALID [2022-02-20 19:54:39,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {3406#true} #res := ~__retres1~2; {3406#true} is VALID [2022-02-20 19:54:39,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {3406#true} assume true; {3406#true} is VALID [2022-02-20 19:54:39,202 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3406#true} {3408#(= ~c_dr_pc~0 0)} #590#return; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~1#1); {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {3408#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:54:39,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {3408#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {3407#false} is VALID [2022-02-20 19:54:39,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {3407#false} assume 1 == ~c_dr_pc~0; {3407#false} is VALID [2022-02-20 19:54:39,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {3407#false} do_read_c_~a~0#1 := ~a_t~0; {3407#false} is VALID [2022-02-20 19:54:39,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {3407#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {3407#false} is VALID [2022-02-20 19:54:39,204 INFO L272 TraceCheckUtils]: 26: Hoare triple {3407#false} call immediate_notify_threads(); {3428#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:54:39,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {3428#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {3406#true} is VALID [2022-02-20 19:54:39,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {3406#true} assume 1 == ~p_dw_pc~0; {3406#true} is VALID [2022-02-20 19:54:39,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {3406#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {3406#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {3406#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {3406#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {3406#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {3406#true} assume !(1 == ~c_dr_pc~0); {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {3406#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {3406#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {3406#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {3406#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {3406#true} assume true; {3406#true} is VALID [2022-02-20 19:54:39,205 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3406#true} {3407#false} #594#return; {3407#false} is VALID [2022-02-20 19:54:39,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {3407#false} ~q_read_ev~0 := 2; {3407#false} is VALID [2022-02-20 19:54:39,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {3407#false} assume !(~p_last_write~0 == ~c_last_read~0); {3407#false} is VALID [2022-02-20 19:54:39,206 INFO L272 TraceCheckUtils]: 43: Hoare triple {3407#false} call error1(); {3407#false} is VALID [2022-02-20 19:54:39,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {3407#false} assume !false; {3407#false} is VALID [2022-02-20 19:54:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:39,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:39,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155706064] [2022-02-20 19:54:39,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155706064] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:39,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:39,206 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:54:39,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299797610] [2022-02-20 19:54:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:39,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:39,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:39,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:39,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:39,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:54:39,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:39,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:54:39,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:54:39,232 INFO L87 Difference]: Start difference. First operand 300 states and 418 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:39,652 INFO L93 Difference]: Finished difference Result 708 states and 977 transitions. [2022-02-20 19:54:39,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:54:39,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-20 19:54:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-02-20 19:54:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-02-20 19:54:39,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-02-20 19:54:39,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:39,943 INFO L225 Difference]: With dead ends: 708 [2022-02-20 19:54:39,944 INFO L226 Difference]: Without dead ends: 517 [2022-02-20 19:54:39,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:39,945 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 293 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:39,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 462 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:54:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-02-20 19:54:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 465. [2022-02-20 19:54:39,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:39,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 517 states. Second operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-02-20 19:54:39,964 INFO L74 IsIncluded]: Start isIncluded. First operand 517 states. Second operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-02-20 19:54:39,965 INFO L87 Difference]: Start difference. First operand 517 states. Second operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-02-20 19:54:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:39,981 INFO L93 Difference]: Finished difference Result 517 states and 699 transitions. [2022-02-20 19:54:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 699 transitions. [2022-02-20 19:54:39,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:39,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:39,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) Second operand 517 states. [2022-02-20 19:54:39,990 INFO L87 Difference]: Start difference. First operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) Second operand 517 states. [2022-02-20 19:54:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:40,006 INFO L93 Difference]: Finished difference Result 517 states and 699 transitions. [2022-02-20 19:54:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 699 transitions. [2022-02-20 19:54:40,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:40,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:40,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:40,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-02-20 19:54:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 636 transitions. [2022-02-20 19:54:40,025 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 636 transitions. Word has length 45 [2022-02-20 19:54:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:40,025 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 636 transitions. [2022-02-20 19:54:40,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:54:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 636 transitions. [2022-02-20 19:54:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:54:40,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:40,027 INFO L514 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] [2022-02-20 19:54:40,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:54:40,028 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash -443803124, now seen corresponding path program 1 times [2022-02-20 19:54:40,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:40,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49675137] [2022-02-20 19:54:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:40,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:40,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,061 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {6077#true} {6079#(= ~m_i~0 1)} #602#return; {6079#(= ~m_i~0 1)} is VALID [2022-02-20 19:54:40,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:54:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:40,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {6077#true} is VALID [2022-02-20 19:54:40,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {6077#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {6077#true} is VALID [2022-02-20 19:54:40,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {6077#true} assume !(0 == ~E_M~0); {6077#true} is VALID [2022-02-20 19:54:40,070 INFO L290 TraceCheckUtils]: 3: Hoare triple {6077#true} assume 0 == ~E_1~0;~E_1~0 := 1; {6077#true} is VALID [2022-02-20 19:54:40,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,071 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6077#true} {6078#false} #604#return; {6078#false} is VALID [2022-02-20 19:54:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:54:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:40,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {6114#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {6077#true} is VALID [2022-02-20 19:54:40,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {6077#true} assume !(1 == ~m_pc~0); {6077#true} is VALID [2022-02-20 19:54:40,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {6077#true} is_master_triggered_~__retres1~4#1 := 0; {6077#true} is VALID [2022-02-20 19:54:40,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {6077#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {6077#true} is VALID [2022-02-20 19:54:40,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {6077#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {6077#true} is VALID [2022-02-20 19:54:40,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {6077#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {6077#true} is VALID [2022-02-20 19:54:40,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {6077#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {6077#true} is VALID [2022-02-20 19:54:40,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {6077#true} assume 1 == ~t1_pc~0; {6077#true} is VALID [2022-02-20 19:54:40,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {6077#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {6077#true} is VALID [2022-02-20 19:54:40,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {6077#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {6077#true} is VALID [2022-02-20 19:54:40,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {6077#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {6077#true} is VALID [2022-02-20 19:54:40,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {6077#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {6077#true} is VALID [2022-02-20 19:54:40,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,084 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6077#true} {6078#false} #606#return; {6078#false} is VALID [2022-02-20 19:54:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:54:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:40,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {6113#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {6077#true} is VALID [2022-02-20 19:54:40,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {6077#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {6077#true} is VALID [2022-02-20 19:54:40,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {6077#true} assume 1 == ~E_M~0;~E_M~0 := 2; {6077#true} is VALID [2022-02-20 19:54:40,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {6077#true} assume 1 == ~E_1~0;~E_1~0 := 2; {6077#true} is VALID [2022-02-20 19:54:40,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,090 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6077#true} {6078#false} #608#return; {6078#false} is VALID [2022-02-20 19:54:40,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:40,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {6077#true} havoc ~__retres1~6; {6077#true} is VALID [2022-02-20 19:54:40,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {6077#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {6077#true} is VALID [2022-02-20 19:54:40,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {6077#true} #res := ~__retres1~6; {6077#true} is VALID [2022-02-20 19:54:40,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,094 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6077#true} {6078#false} #610#return; {6078#false} is VALID [2022-02-20 19:54:40,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {6077#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {6077#true} is VALID [2022-02-20 19:54:40,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {6077#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {6077#true} is VALID [2022-02-20 19:54:40,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {6077#true} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {6079#(= ~m_i~0 1)} is VALID [2022-02-20 19:54:40,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {6079#(= ~m_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {6079#(= ~m_i~0 1)} is VALID [2022-02-20 19:54:40,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {6079#(= ~m_i~0 1)} call update_channels2(); {6077#true} is VALID [2022-02-20 19:54:40,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,096 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6077#true} {6079#(= ~m_i~0 1)} #602#return; {6079#(= ~m_i~0 1)} is VALID [2022-02-20 19:54:40,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {6079#(= ~m_i~0 1)} assume { :begin_inline_init_threads2 } true; {6079#(= ~m_i~0 1)} is VALID [2022-02-20 19:54:40,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {6079#(= ~m_i~0 1)} assume !(1 == ~m_i~0);~m_st~0 := 2; {6078#false} is VALID [2022-02-20 19:54:40,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {6078#false} assume 1 == ~t1_i~0;~t1_st~0 := 0; {6078#false} is VALID [2022-02-20 19:54:40,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {6078#false} assume { :end_inline_init_threads2 } true; {6078#false} is VALID [2022-02-20 19:54:40,098 INFO L272 TraceCheckUtils]: 11: Hoare triple {6078#false} call fire_delta_events2(); {6113#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:40,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {6113#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {6077#true} is VALID [2022-02-20 19:54:40,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {6077#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {6077#true} is VALID [2022-02-20 19:54:40,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {6077#true} assume !(0 == ~E_M~0); {6077#true} is VALID [2022-02-20 19:54:40,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {6077#true} assume 0 == ~E_1~0;~E_1~0 := 1; {6077#true} is VALID [2022-02-20 19:54:40,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,099 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6077#true} {6078#false} #604#return; {6078#false} is VALID [2022-02-20 19:54:40,099 INFO L272 TraceCheckUtils]: 18: Hoare triple {6078#false} call activate_threads2(); {6114#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:54:40,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {6114#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {6077#true} is VALID [2022-02-20 19:54:40,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {6077#true} assume !(1 == ~m_pc~0); {6077#true} is VALID [2022-02-20 19:54:40,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {6077#true} is_master_triggered_~__retres1~4#1 := 0; {6077#true} is VALID [2022-02-20 19:54:40,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {6077#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {6077#true} is VALID [2022-02-20 19:54:40,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {6077#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {6077#true} is VALID [2022-02-20 19:54:40,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {6077#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {6077#true} is VALID [2022-02-20 19:54:40,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {6077#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {6077#true} is VALID [2022-02-20 19:54:40,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {6077#true} assume 1 == ~t1_pc~0; {6077#true} is VALID [2022-02-20 19:54:40,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {6077#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {6077#true} is VALID [2022-02-20 19:54:40,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {6077#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {6077#true} is VALID [2022-02-20 19:54:40,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {6077#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {6077#true} is VALID [2022-02-20 19:54:40,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {6077#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {6077#true} is VALID [2022-02-20 19:54:40,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,101 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6077#true} {6078#false} #606#return; {6078#false} is VALID [2022-02-20 19:54:40,101 INFO L272 TraceCheckUtils]: 33: Hoare triple {6078#false} call reset_delta_events2(); {6113#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:40,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {6113#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {6077#true} is VALID [2022-02-20 19:54:40,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {6077#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {6077#true} is VALID [2022-02-20 19:54:40,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {6077#true} assume 1 == ~E_M~0;~E_M~0 := 2; {6077#true} is VALID [2022-02-20 19:54:40,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {6077#true} assume 1 == ~E_1~0;~E_1~0 := 2; {6077#true} is VALID [2022-02-20 19:54:40,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,102 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6077#true} {6078#false} #608#return; {6078#false} is VALID [2022-02-20 19:54:40,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {6078#false} assume !false; {6078#false} is VALID [2022-02-20 19:54:40,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {6078#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {6078#false} is VALID [2022-02-20 19:54:40,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {6078#false} assume !false; {6078#false} is VALID [2022-02-20 19:54:40,103 INFO L272 TraceCheckUtils]: 43: Hoare triple {6078#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {6077#true} is VALID [2022-02-20 19:54:40,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {6077#true} havoc ~__retres1~6; {6077#true} is VALID [2022-02-20 19:54:40,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {6077#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {6077#true} is VALID [2022-02-20 19:54:40,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {6077#true} #res := ~__retres1~6; {6077#true} is VALID [2022-02-20 19:54:40,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {6077#true} assume true; {6077#true} is VALID [2022-02-20 19:54:40,104 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6077#true} {6078#false} #610#return; {6078#false} is VALID [2022-02-20 19:54:40,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {6078#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {6078#false} is VALID [2022-02-20 19:54:40,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {6078#false} assume 0 != eval2_~tmp~4#1; {6078#false} is VALID [2022-02-20 19:54:40,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {6078#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {6078#false} is VALID [2022-02-20 19:54:40,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {6078#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {6078#false} is VALID [2022-02-20 19:54:40,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {6078#false} assume !(0 == ~m_pc~0); {6078#false} is VALID [2022-02-20 19:54:40,105 INFO L290 TraceCheckUtils]: 54: Hoare triple {6078#false} assume 1 == ~m_pc~0; {6078#false} is VALID [2022-02-20 19:54:40,105 INFO L290 TraceCheckUtils]: 55: Hoare triple {6078#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {6078#false} is VALID [2022-02-20 19:54:40,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {6078#false} assume !false; {6078#false} is VALID [2022-02-20 19:54:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:40,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:40,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49675137] [2022-02-20 19:54:40,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49675137] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:40,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:40,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:54:40,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632592078] [2022-02-20 19:54:40,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:40,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:40,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:40,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:40,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:40,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:54:40,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:40,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:54:40,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:54:40,134 INFO L87 Difference]: Start difference. First operand 465 states and 636 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:40,772 INFO L93 Difference]: Finished difference Result 582 states and 808 transitions. [2022-02-20 19:54:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:54:40,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 409 transitions. [2022-02-20 19:54:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 409 transitions. [2022-02-20 19:54:40,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 409 transitions. [2022-02-20 19:54:41,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:41,067 INFO L225 Difference]: With dead ends: 582 [2022-02-20 19:54:41,067 INFO L226 Difference]: Without dead ends: 486 [2022-02-20 19:54:41,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:54:41,068 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 263 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:41,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 514 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:54:41,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-02-20 19:54:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 465. [2022-02-20 19:54:41,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:41,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 486 states. Second operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-02-20 19:54:41,083 INFO L74 IsIncluded]: Start isIncluded. First operand 486 states. Second operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-02-20 19:54:41,084 INFO L87 Difference]: Start difference. First operand 486 states. Second operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-02-20 19:54:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:41,096 INFO L93 Difference]: Finished difference Result 486 states and 671 transitions. [2022-02-20 19:54:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 671 transitions. [2022-02-20 19:54:41,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:41,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:41,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) Second operand 486 states. [2022-02-20 19:54:41,099 INFO L87 Difference]: Start difference. First operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) Second operand 486 states. [2022-02-20 19:54:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:41,111 INFO L93 Difference]: Finished difference Result 486 states and 671 transitions. [2022-02-20 19:54:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 671 transitions. [2022-02-20 19:54:41,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:41,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:41,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:41,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-02-20 19:54:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 635 transitions. [2022-02-20 19:54:41,136 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 635 transitions. Word has length 57 [2022-02-20 19:54:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:41,137 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 635 transitions. [2022-02-20 19:54:41,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 635 transitions. [2022-02-20 19:54:41,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:54:41,138 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:41,138 INFO L514 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] [2022-02-20 19:54:41,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:54:41,138 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:41,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:41,139 INFO L85 PathProgramCache]: Analyzing trace with hash -428284406, now seen corresponding path program 1 times [2022-02-20 19:54:41,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:41,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081600699] [2022-02-20 19:54:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:41,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {8539#true} assume true; {8539#true} is VALID [2022-02-20 19:54:41,164 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {8539#true} {8541#(= ~M_E~0 2)} #602#return; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:54:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {8575#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {8576#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {8576#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {8576#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {8576#(= |old(~M_E~0)| 0)} assume true; {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,183 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8576#(= |old(~M_E~0)| 0)} {8541#(= ~M_E~0 2)} #604#return; {8540#false} is VALID [2022-02-20 19:54:41,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:54:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {8577#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {8539#true} is VALID [2022-02-20 19:54:41,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {8539#true} assume !(1 == ~m_pc~0); {8539#true} is VALID [2022-02-20 19:54:41,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {8539#true} is_master_triggered_~__retres1~4#1 := 0; {8539#true} is VALID [2022-02-20 19:54:41,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {8539#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {8539#true} is VALID [2022-02-20 19:54:41,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {8539#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {8539#true} is VALID [2022-02-20 19:54:41,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {8539#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {8539#true} is VALID [2022-02-20 19:54:41,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {8539#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {8539#true} is VALID [2022-02-20 19:54:41,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {8539#true} assume 1 == ~t1_pc~0; {8539#true} is VALID [2022-02-20 19:54:41,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {8539#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {8539#true} is VALID [2022-02-20 19:54:41,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {8539#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {8539#true} is VALID [2022-02-20 19:54:41,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {8539#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {8539#true} is VALID [2022-02-20 19:54:41,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {8539#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {8539#true} is VALID [2022-02-20 19:54:41,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {8539#true} assume true; {8539#true} is VALID [2022-02-20 19:54:41,196 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8539#true} {8540#false} #606#return; {8540#false} is VALID [2022-02-20 19:54:41,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:54:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {8575#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {8539#true} is VALID [2022-02-20 19:54:41,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {8539#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {8539#true} is VALID [2022-02-20 19:54:41,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {8539#true} assume 1 == ~E_M~0;~E_M~0 := 2; {8539#true} is VALID [2022-02-20 19:54:41,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {8539#true} assume 1 == ~E_1~0;~E_1~0 := 2; {8539#true} is VALID [2022-02-20 19:54:41,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {8539#true} assume true; {8539#true} is VALID [2022-02-20 19:54:41,200 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8539#true} {8540#false} #608#return; {8540#false} is VALID [2022-02-20 19:54:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:41,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {8539#true} havoc ~__retres1~6; {8539#true} is VALID [2022-02-20 19:54:41,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {8539#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {8539#true} is VALID [2022-02-20 19:54:41,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {8539#true} #res := ~__retres1~6; {8539#true} is VALID [2022-02-20 19:54:41,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {8539#true} assume true; {8539#true} is VALID [2022-02-20 19:54:41,204 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8539#true} {8540#false} #610#return; {8540#false} is VALID [2022-02-20 19:54:41,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {8539#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {8541#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {8541#(= ~M_E~0 2)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {8541#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {8541#(= ~M_E~0 2)} call update_channels2(); {8539#true} is VALID [2022-02-20 19:54:41,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {8539#true} assume true; {8539#true} is VALID [2022-02-20 19:54:41,206 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8539#true} {8541#(= ~M_E~0 2)} #602#return; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {8541#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {8541#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {8541#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {8541#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {8541#(= ~M_E~0 2)} is VALID [2022-02-20 19:54:41,208 INFO L272 TraceCheckUtils]: 11: Hoare triple {8541#(= ~M_E~0 2)} call fire_delta_events2(); {8575#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:41,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {8575#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {8576#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {8576#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {8576#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {8576#(= |old(~M_E~0)| 0)} assume true; {8576#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:54:41,210 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8576#(= |old(~M_E~0)| 0)} {8541#(= ~M_E~0 2)} #604#return; {8540#false} is VALID [2022-02-20 19:54:41,210 INFO L272 TraceCheckUtils]: 18: Hoare triple {8540#false} call activate_threads2(); {8577#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:54:41,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {8577#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {8539#true} is VALID [2022-02-20 19:54:41,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {8539#true} assume !(1 == ~m_pc~0); {8539#true} is VALID [2022-02-20 19:54:41,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {8539#true} is_master_triggered_~__retres1~4#1 := 0; {8539#true} is VALID [2022-02-20 19:54:41,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {8539#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {8539#true} is VALID [2022-02-20 19:54:41,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {8539#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {8539#true} is VALID [2022-02-20 19:54:41,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {8539#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {8539#true} is VALID [2022-02-20 19:54:41,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {8539#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {8539#true} is VALID [2022-02-20 19:54:41,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {8539#true} assume 1 == ~t1_pc~0; {8539#true} is VALID [2022-02-20 19:54:41,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {8539#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {8539#true} is VALID [2022-02-20 19:54:41,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {8539#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {8539#true} is VALID [2022-02-20 19:54:41,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {8539#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {8539#true} is VALID [2022-02-20 19:54:41,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {8539#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {8539#true} is VALID [2022-02-20 19:54:41,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {8539#true} assume true; {8539#true} is VALID [2022-02-20 19:54:41,212 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8539#true} {8540#false} #606#return; {8540#false} is VALID [2022-02-20 19:54:41,212 INFO L272 TraceCheckUtils]: 33: Hoare triple {8540#false} call reset_delta_events2(); {8575#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:41,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {8575#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {8539#true} is VALID [2022-02-20 19:54:41,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {8539#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {8539#true} is VALID [2022-02-20 19:54:41,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {8539#true} assume 1 == ~E_M~0;~E_M~0 := 2; {8539#true} is VALID [2022-02-20 19:54:41,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {8539#true} assume 1 == ~E_1~0;~E_1~0 := 2; {8539#true} is VALID [2022-02-20 19:54:41,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {8539#true} assume true; {8539#true} is VALID [2022-02-20 19:54:41,213 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8539#true} {8540#false} #608#return; {8540#false} is VALID [2022-02-20 19:54:41,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {8540#false} assume !false; {8540#false} is VALID [2022-02-20 19:54:41,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {8540#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {8540#false} is VALID [2022-02-20 19:54:41,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {8540#false} assume !false; {8540#false} is VALID [2022-02-20 19:54:41,213 INFO L272 TraceCheckUtils]: 43: Hoare triple {8540#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {8539#true} is VALID [2022-02-20 19:54:41,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {8539#true} havoc ~__retres1~6; {8539#true} is VALID [2022-02-20 19:54:41,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {8539#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {8539#true} is VALID [2022-02-20 19:54:41,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {8539#true} #res := ~__retres1~6; {8539#true} is VALID [2022-02-20 19:54:41,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {8539#true} assume true; {8539#true} is VALID [2022-02-20 19:54:41,214 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8539#true} {8540#false} #610#return; {8540#false} is VALID [2022-02-20 19:54:41,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {8540#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {8540#false} is VALID [2022-02-20 19:54:41,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {8540#false} assume 0 != eval2_~tmp~4#1; {8540#false} is VALID [2022-02-20 19:54:41,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {8540#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {8540#false} is VALID [2022-02-20 19:54:41,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {8540#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {8540#false} is VALID [2022-02-20 19:54:41,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {8540#false} assume !(0 == ~m_pc~0); {8540#false} is VALID [2022-02-20 19:54:41,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {8540#false} assume 1 == ~m_pc~0; {8540#false} is VALID [2022-02-20 19:54:41,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {8540#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {8540#false} is VALID [2022-02-20 19:54:41,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {8540#false} assume !false; {8540#false} is VALID [2022-02-20 19:54:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:41,215 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:41,215 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081600699] [2022-02-20 19:54:41,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081600699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:41,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:41,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:54:41,216 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891908082] [2022-02-20 19:54:41,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:41,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:41,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:41,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:41,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:41,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:54:41,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:41,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:54:41,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:54:41,248 INFO L87 Difference]: Start difference. First operand 465 states and 635 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:42,415 INFO L93 Difference]: Finished difference Result 689 states and 962 transitions. [2022-02-20 19:54:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:54:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 563 transitions. [2022-02-20 19:54:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 563 transitions. [2022-02-20 19:54:42,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 563 transitions. [2022-02-20 19:54:42,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 563 edges. 563 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:42,792 INFO L225 Difference]: With dead ends: 689 [2022-02-20 19:54:42,793 INFO L226 Difference]: Without dead ends: 596 [2022-02-20 19:54:42,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:54:42,796 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 434 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:42,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 660 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:54:42,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-02-20 19:54:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 555. [2022-02-20 19:54:42,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:42,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 596 states. Second operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-02-20 19:54:42,826 INFO L74 IsIncluded]: Start isIncluded. First operand 596 states. Second operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-02-20 19:54:42,827 INFO L87 Difference]: Start difference. First operand 596 states. Second operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-02-20 19:54:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:42,842 INFO L93 Difference]: Finished difference Result 596 states and 825 transitions. [2022-02-20 19:54:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 825 transitions. [2022-02-20 19:54:42,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:42,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:42,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) Second operand 596 states. [2022-02-20 19:54:42,847 INFO L87 Difference]: Start difference. First operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) Second operand 596 states. [2022-02-20 19:54:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:42,863 INFO L93 Difference]: Finished difference Result 596 states and 825 transitions. [2022-02-20 19:54:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 825 transitions. [2022-02-20 19:54:42,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:42,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:42,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:42,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 475 states have (on average 1.3726315789473684) internal successors, (652), 483 states have internal predecessors, (652), 49 states have call successors, (49), 27 states have call predecessors, (49), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-02-20 19:54:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 763 transitions. [2022-02-20 19:54:42,883 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 763 transitions. Word has length 57 [2022-02-20 19:54:42,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:42,883 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 763 transitions. [2022-02-20 19:54:42,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 763 transitions. [2022-02-20 19:54:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:54:42,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:42,885 INFO L514 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] [2022-02-20 19:54:42,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:54:42,885 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:42,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1340236402, now seen corresponding path program 1 times [2022-02-20 19:54:42,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:42,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737987076] [2022-02-20 19:54:42,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:42,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:42,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {11486#true} assume true; {11486#true} is VALID [2022-02-20 19:54:42,913 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {11486#true} {11488#(= ~T1_E~0 ~M_E~0)} #602#return; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:54:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:42,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {11522#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {11523#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:42,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {11523#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:42,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:42,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:42,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:42,940 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {11488#(= ~T1_E~0 ~M_E~0)} #604#return; {11487#false} is VALID [2022-02-20 19:54:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:54:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:42,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {11525#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {11486#true} is VALID [2022-02-20 19:54:42,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {11486#true} assume !(1 == ~m_pc~0); {11486#true} is VALID [2022-02-20 19:54:42,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {11486#true} is_master_triggered_~__retres1~4#1 := 0; {11486#true} is VALID [2022-02-20 19:54:42,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {11486#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {11486#true} is VALID [2022-02-20 19:54:42,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {11486#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {11486#true} is VALID [2022-02-20 19:54:42,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {11486#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {11486#true} is VALID [2022-02-20 19:54:42,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {11486#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {11486#true} is VALID [2022-02-20 19:54:42,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {11486#true} assume 1 == ~t1_pc~0; {11486#true} is VALID [2022-02-20 19:54:42,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {11486#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {11486#true} is VALID [2022-02-20 19:54:42,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {11486#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {11486#true} is VALID [2022-02-20 19:54:42,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {11486#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {11486#true} is VALID [2022-02-20 19:54:42,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {11486#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {11486#true} is VALID [2022-02-20 19:54:42,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {11486#true} assume true; {11486#true} is VALID [2022-02-20 19:54:42,965 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11486#true} {11487#false} #606#return; {11487#false} is VALID [2022-02-20 19:54:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:54:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:42,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {11522#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {11486#true} is VALID [2022-02-20 19:54:42,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {11486#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {11486#true} is VALID [2022-02-20 19:54:42,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {11486#true} assume 1 == ~E_M~0;~E_M~0 := 2; {11486#true} is VALID [2022-02-20 19:54:42,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {11486#true} assume 1 == ~E_1~0;~E_1~0 := 2; {11486#true} is VALID [2022-02-20 19:54:42,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {11486#true} assume true; {11486#true} is VALID [2022-02-20 19:54:42,969 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11486#true} {11487#false} #608#return; {11487#false} is VALID [2022-02-20 19:54:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:42,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {11486#true} havoc ~__retres1~6; {11486#true} is VALID [2022-02-20 19:54:42,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {11486#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {11486#true} is VALID [2022-02-20 19:54:42,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {11486#true} #res := ~__retres1~6; {11486#true} is VALID [2022-02-20 19:54:42,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {11486#true} assume true; {11486#true} is VALID [2022-02-20 19:54:42,973 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11486#true} {11487#false} #610#return; {11487#false} is VALID [2022-02-20 19:54:42,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {11486#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {11488#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {11488#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {11488#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {11488#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {11486#true} is VALID [2022-02-20 19:54:42,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {11486#true} assume true; {11486#true} is VALID [2022-02-20 19:54:42,975 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11486#true} {11488#(= ~T1_E~0 ~M_E~0)} #602#return; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {11488#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {11488#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {11488#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {11488#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {11488#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:42,977 INFO L272 TraceCheckUtils]: 11: Hoare triple {11488#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {11522#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:42,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {11522#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {11523#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:42,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {11523#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:42,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:42,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:42,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:42,979 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {11524#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {11488#(= ~T1_E~0 ~M_E~0)} #604#return; {11487#false} is VALID [2022-02-20 19:54:42,979 INFO L272 TraceCheckUtils]: 18: Hoare triple {11487#false} call activate_threads2(); {11525#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:54:42,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {11525#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {11486#true} is VALID [2022-02-20 19:54:42,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {11486#true} assume !(1 == ~m_pc~0); {11486#true} is VALID [2022-02-20 19:54:42,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {11486#true} is_master_triggered_~__retres1~4#1 := 0; {11486#true} is VALID [2022-02-20 19:54:42,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {11486#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {11486#true} is VALID [2022-02-20 19:54:42,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {11486#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {11486#true} is VALID [2022-02-20 19:54:42,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {11486#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {11486#true} is VALID [2022-02-20 19:54:42,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {11486#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {11486#true} is VALID [2022-02-20 19:54:42,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {11486#true} assume 1 == ~t1_pc~0; {11486#true} is VALID [2022-02-20 19:54:42,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {11486#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {11486#true} is VALID [2022-02-20 19:54:42,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {11486#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {11486#true} is VALID [2022-02-20 19:54:42,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {11486#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {11486#true} is VALID [2022-02-20 19:54:42,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {11486#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {11486#true} is VALID [2022-02-20 19:54:42,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {11486#true} assume true; {11486#true} is VALID [2022-02-20 19:54:42,981 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11486#true} {11487#false} #606#return; {11487#false} is VALID [2022-02-20 19:54:42,981 INFO L272 TraceCheckUtils]: 33: Hoare triple {11487#false} call reset_delta_events2(); {11522#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:42,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {11522#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {11486#true} is VALID [2022-02-20 19:54:42,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {11486#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {11486#true} is VALID [2022-02-20 19:54:42,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {11486#true} assume 1 == ~E_M~0;~E_M~0 := 2; {11486#true} is VALID [2022-02-20 19:54:42,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {11486#true} assume 1 == ~E_1~0;~E_1~0 := 2; {11486#true} is VALID [2022-02-20 19:54:42,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {11486#true} assume true; {11486#true} is VALID [2022-02-20 19:54:42,982 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11486#true} {11487#false} #608#return; {11487#false} is VALID [2022-02-20 19:54:42,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {11487#false} assume !false; {11487#false} is VALID [2022-02-20 19:54:42,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {11487#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {11487#false} is VALID [2022-02-20 19:54:42,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {11487#false} assume !false; {11487#false} is VALID [2022-02-20 19:54:42,983 INFO L272 TraceCheckUtils]: 43: Hoare triple {11487#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {11486#true} is VALID [2022-02-20 19:54:42,983 INFO L290 TraceCheckUtils]: 44: Hoare triple {11486#true} havoc ~__retres1~6; {11486#true} is VALID [2022-02-20 19:54:42,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {11486#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {11486#true} is VALID [2022-02-20 19:54:42,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {11486#true} #res := ~__retres1~6; {11486#true} is VALID [2022-02-20 19:54:42,983 INFO L290 TraceCheckUtils]: 47: Hoare triple {11486#true} assume true; {11486#true} is VALID [2022-02-20 19:54:42,983 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11486#true} {11487#false} #610#return; {11487#false} is VALID [2022-02-20 19:54:42,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {11487#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {11487#false} is VALID [2022-02-20 19:54:42,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {11487#false} assume 0 != eval2_~tmp~4#1; {11487#false} is VALID [2022-02-20 19:54:42,984 INFO L290 TraceCheckUtils]: 51: Hoare triple {11487#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {11487#false} is VALID [2022-02-20 19:54:42,984 INFO L290 TraceCheckUtils]: 52: Hoare triple {11487#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {11487#false} is VALID [2022-02-20 19:54:42,984 INFO L290 TraceCheckUtils]: 53: Hoare triple {11487#false} assume !(0 == ~m_pc~0); {11487#false} is VALID [2022-02-20 19:54:42,984 INFO L290 TraceCheckUtils]: 54: Hoare triple {11487#false} assume 1 == ~m_pc~0; {11487#false} is VALID [2022-02-20 19:54:42,984 INFO L290 TraceCheckUtils]: 55: Hoare triple {11487#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {11487#false} is VALID [2022-02-20 19:54:42,984 INFO L290 TraceCheckUtils]: 56: Hoare triple {11487#false} assume !false; {11487#false} is VALID [2022-02-20 19:54:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:42,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:42,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737987076] [2022-02-20 19:54:42,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737987076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:42,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:42,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:54:42,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134235202] [2022-02-20 19:54:42,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:42,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:42,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:42,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:43,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:43,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:54:43,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:43,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:54:43,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:54:43,015 INFO L87 Difference]: Start difference. First operand 555 states and 763 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:44,673 INFO L93 Difference]: Finished difference Result 887 states and 1237 transitions. [2022-02-20 19:54:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:54:44,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 559 transitions. [2022-02-20 19:54:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:44,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 559 transitions. [2022-02-20 19:54:44,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 559 transitions. [2022-02-20 19:54:45,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:45,058 INFO L225 Difference]: With dead ends: 887 [2022-02-20 19:54:45,058 INFO L226 Difference]: Without dead ends: 704 [2022-02-20 19:54:45,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:54:45,060 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 424 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:45,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 984 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:54:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-02-20 19:54:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 640. [2022-02-20 19:54:45,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:45,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 704 states. Second operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:54:45,085 INFO L74 IsIncluded]: Start isIncluded. First operand 704 states. Second operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:54:45,086 INFO L87 Difference]: Start difference. First operand 704 states. Second operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:54:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:45,108 INFO L93 Difference]: Finished difference Result 704 states and 975 transitions. [2022-02-20 19:54:45,108 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 975 transitions. [2022-02-20 19:54:45,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:45,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:45,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) Second operand 704 states. [2022-02-20 19:54:45,113 INFO L87 Difference]: Start difference. First operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) Second operand 704 states. [2022-02-20 19:54:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:45,133 INFO L93 Difference]: Finished difference Result 704 states and 975 transitions. [2022-02-20 19:54:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 975 transitions. [2022-02-20 19:54:45,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:45,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:45,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:45,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 543 states have (on average 1.3756906077348066) internal successors, (747), 552 states have internal predecessors, (747), 59 states have call successors, (59), 33 states have call predecessors, (59), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:54:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 880 transitions. [2022-02-20 19:54:45,160 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 880 transitions. Word has length 57 [2022-02-20 19:54:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:45,160 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 880 transitions. [2022-02-20 19:54:45,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 880 transitions. [2022-02-20 19:54:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:54:45,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:45,162 INFO L514 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] [2022-02-20 19:54:45,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:54:45,162 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash 905343052, now seen corresponding path program 1 times [2022-02-20 19:54:45,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:45,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103373357] [2022-02-20 19:54:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {15038#true} assume true; {15038#true} is VALID [2022-02-20 19:54:45,206 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {15038#true} {15040#(= ~E_1~0 ~M_E~0)} #602#return; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:54:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {15074#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:45,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:45,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:45,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {15076#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:45,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {15076#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {15076#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:45,234 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15076#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {15040#(= ~E_1~0 ~M_E~0)} #604#return; {15039#false} is VALID [2022-02-20 19:54:45,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:54:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {15077#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {15038#true} is VALID [2022-02-20 19:54:45,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {15038#true} assume !(1 == ~m_pc~0); {15038#true} is VALID [2022-02-20 19:54:45,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {15038#true} is_master_triggered_~__retres1~4#1 := 0; {15038#true} is VALID [2022-02-20 19:54:45,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {15038#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {15038#true} is VALID [2022-02-20 19:54:45,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {15038#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {15038#true} is VALID [2022-02-20 19:54:45,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {15038#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {15038#true} is VALID [2022-02-20 19:54:45,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {15038#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {15038#true} is VALID [2022-02-20 19:54:45,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {15038#true} assume 1 == ~t1_pc~0; {15038#true} is VALID [2022-02-20 19:54:45,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {15038#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {15038#true} is VALID [2022-02-20 19:54:45,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {15038#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {15038#true} is VALID [2022-02-20 19:54:45,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {15038#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {15038#true} is VALID [2022-02-20 19:54:45,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {15038#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {15038#true} is VALID [2022-02-20 19:54:45,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {15038#true} assume true; {15038#true} is VALID [2022-02-20 19:54:45,249 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {15038#true} {15039#false} #606#return; {15039#false} is VALID [2022-02-20 19:54:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:54:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {15074#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {15038#true} is VALID [2022-02-20 19:54:45,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {15038#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {15038#true} is VALID [2022-02-20 19:54:45,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {15038#true} assume 1 == ~E_M~0;~E_M~0 := 2; {15038#true} is VALID [2022-02-20 19:54:45,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {15038#true} assume 1 == ~E_1~0;~E_1~0 := 2; {15038#true} is VALID [2022-02-20 19:54:45,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {15038#true} assume true; {15038#true} is VALID [2022-02-20 19:54:45,258 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {15038#true} {15039#false} #608#return; {15039#false} is VALID [2022-02-20 19:54:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:45,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {15038#true} havoc ~__retres1~6; {15038#true} is VALID [2022-02-20 19:54:45,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {15038#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {15038#true} is VALID [2022-02-20 19:54:45,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {15038#true} #res := ~__retres1~6; {15038#true} is VALID [2022-02-20 19:54:45,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {15038#true} assume true; {15038#true} is VALID [2022-02-20 19:54:45,262 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15038#true} {15039#false} #610#return; {15039#false} is VALID [2022-02-20 19:54:45,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {15038#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {15040#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {15040#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {15040#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {15040#(= ~E_1~0 ~M_E~0)} call update_channels2(); {15038#true} is VALID [2022-02-20 19:54:45,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {15038#true} assume true; {15038#true} is VALID [2022-02-20 19:54:45,265 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {15038#true} {15040#(= ~E_1~0 ~M_E~0)} #602#return; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {15040#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {15040#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {15040#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {15040#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {15040#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:54:45,269 INFO L272 TraceCheckUtils]: 11: Hoare triple {15040#(= ~E_1~0 ~M_E~0)} call fire_delta_events2(); {15074#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:45,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {15074#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:45,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~T1_E~0); {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:45,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume !(0 == ~E_M~0); {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:54:45,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {15075#(and (= ~E_1~0 |old(~E_1~0)|) (not (= |old(~M_E~0)| 0)))} assume 0 == ~E_1~0;~E_1~0 := 1; {15076#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:45,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {15076#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {15076#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:45,275 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15076#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {15040#(= ~E_1~0 ~M_E~0)} #604#return; {15039#false} is VALID [2022-02-20 19:54:45,275 INFO L272 TraceCheckUtils]: 18: Hoare triple {15039#false} call activate_threads2(); {15077#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:54:45,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {15077#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {15038#true} is VALID [2022-02-20 19:54:45,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {15038#true} assume !(1 == ~m_pc~0); {15038#true} is VALID [2022-02-20 19:54:45,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {15038#true} is_master_triggered_~__retres1~4#1 := 0; {15038#true} is VALID [2022-02-20 19:54:45,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {15038#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {15038#true} is VALID [2022-02-20 19:54:45,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {15038#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {15038#true} is VALID [2022-02-20 19:54:45,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {15038#true} assume 0 != ~tmp~5#1;~m_st~0 := 0; {15038#true} is VALID [2022-02-20 19:54:45,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {15038#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {15038#true} is VALID [2022-02-20 19:54:45,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {15038#true} assume 1 == ~t1_pc~0; {15038#true} is VALID [2022-02-20 19:54:45,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {15038#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {15038#true} is VALID [2022-02-20 19:54:45,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {15038#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {15038#true} is VALID [2022-02-20 19:54:45,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {15038#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {15038#true} is VALID [2022-02-20 19:54:45,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {15038#true} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {15038#true} is VALID [2022-02-20 19:54:45,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {15038#true} assume true; {15038#true} is VALID [2022-02-20 19:54:45,277 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15038#true} {15039#false} #606#return; {15039#false} is VALID [2022-02-20 19:54:45,277 INFO L272 TraceCheckUtils]: 33: Hoare triple {15039#false} call reset_delta_events2(); {15074#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:45,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {15074#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {15038#true} is VALID [2022-02-20 19:54:45,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {15038#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {15038#true} is VALID [2022-02-20 19:54:45,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {15038#true} assume 1 == ~E_M~0;~E_M~0 := 2; {15038#true} is VALID [2022-02-20 19:54:45,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {15038#true} assume 1 == ~E_1~0;~E_1~0 := 2; {15038#true} is VALID [2022-02-20 19:54:45,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {15038#true} assume true; {15038#true} is VALID [2022-02-20 19:54:45,278 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15038#true} {15039#false} #608#return; {15039#false} is VALID [2022-02-20 19:54:45,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {15039#false} assume !false; {15039#false} is VALID [2022-02-20 19:54:45,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {15039#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {15039#false} is VALID [2022-02-20 19:54:45,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {15039#false} assume !false; {15039#false} is VALID [2022-02-20 19:54:45,278 INFO L272 TraceCheckUtils]: 43: Hoare triple {15039#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {15038#true} is VALID [2022-02-20 19:54:45,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {15038#true} havoc ~__retres1~6; {15038#true} is VALID [2022-02-20 19:54:45,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {15038#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {15038#true} is VALID [2022-02-20 19:54:45,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {15038#true} #res := ~__retres1~6; {15038#true} is VALID [2022-02-20 19:54:45,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {15038#true} assume true; {15038#true} is VALID [2022-02-20 19:54:45,279 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15038#true} {15039#false} #610#return; {15039#false} is VALID [2022-02-20 19:54:45,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {15039#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {15039#false} is VALID [2022-02-20 19:54:45,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {15039#false} assume 0 != eval2_~tmp~4#1; {15039#false} is VALID [2022-02-20 19:54:45,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {15039#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {15039#false} is VALID [2022-02-20 19:54:45,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {15039#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {15039#false} is VALID [2022-02-20 19:54:45,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {15039#false} assume !(0 == ~m_pc~0); {15039#false} is VALID [2022-02-20 19:54:45,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {15039#false} assume 1 == ~m_pc~0; {15039#false} is VALID [2022-02-20 19:54:45,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {15039#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {15039#false} is VALID [2022-02-20 19:54:45,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {15039#false} assume !false; {15039#false} is VALID [2022-02-20 19:54:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:45,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:45,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103373357] [2022-02-20 19:54:45,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103373357] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:45,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:45,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:54:45,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397808118] [2022-02-20 19:54:45,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:45,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:45,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:45,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:45,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:45,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:54:45,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:45,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:54:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:54:45,311 INFO L87 Difference]: Start difference. First operand 640 states and 880 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:46,896 INFO L93 Difference]: Finished difference Result 1198 states and 1670 transitions. [2022-02-20 19:54:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 19:54:46,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 578 transitions. [2022-02-20 19:54:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 578 transitions. [2022-02-20 19:54:46,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 578 transitions. [2022-02-20 19:54:47,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 578 edges. 578 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:47,312 INFO L225 Difference]: With dead ends: 1198 [2022-02-20 19:54:47,313 INFO L226 Difference]: Without dead ends: 930 [2022-02-20 19:54:47,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:54:47,316 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 435 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:47,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 959 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:54:47,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-02-20 19:54:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 798. [2022-02-20 19:54:47,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:47,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 930 states. Second operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-02-20 19:54:47,345 INFO L74 IsIncluded]: Start isIncluded. First operand 930 states. Second operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-02-20 19:54:47,346 INFO L87 Difference]: Start difference. First operand 930 states. Second operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-02-20 19:54:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,380 INFO L93 Difference]: Finished difference Result 930 states and 1286 transitions. [2022-02-20 19:54:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1286 transitions. [2022-02-20 19:54:47,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:47,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:47,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) Second operand 930 states. [2022-02-20 19:54:47,386 INFO L87 Difference]: Start difference. First operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) Second operand 930 states. [2022-02-20 19:54:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:47,419 INFO L93 Difference]: Finished difference Result 930 states and 1286 transitions. [2022-02-20 19:54:47,420 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1286 transitions. [2022-02-20 19:54:47,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:47,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:47,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:47,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 669 states have (on average 1.3811659192825112) internal successors, (924), 680 states have internal predecessors, (924), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-02-20 19:54:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions. [2022-02-20 19:54:47,474 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 57 [2022-02-20 19:54:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:47,474 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions. [2022-02-20 19:54:47,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions. [2022-02-20 19:54:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:54:47,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:47,477 INFO L514 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] [2022-02-20 19:54:47,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:54:47,477 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:47,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:47,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1153489546, now seen corresponding path program 1 times [2022-02-20 19:54:47,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:47,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492787788] [2022-02-20 19:54:47,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-02-20 19:54:47,505 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {19670#true} {19670#true} #602#return; {19670#true} is VALID [2022-02-20 19:54:47,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:54:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {19705#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {19670#true} is VALID [2022-02-20 19:54:47,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {19670#true} assume !(0 == ~T1_E~0); {19670#true} is VALID [2022-02-20 19:54:47,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {19670#true} assume !(0 == ~E_M~0); {19670#true} is VALID [2022-02-20 19:54:47,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {19670#true} assume !(0 == ~E_1~0); {19670#true} is VALID [2022-02-20 19:54:47,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-02-20 19:54:47,513 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19670#true} {19670#true} #604#return; {19670#true} is VALID [2022-02-20 19:54:47,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:54:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {19706#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {19670#true} is VALID [2022-02-20 19:54:47,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {19670#true} assume !(1 == ~m_pc~0); {19670#true} is VALID [2022-02-20 19:54:47,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {19670#true} is_master_triggered_~__retres1~4#1 := 0; {19707#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:54:47,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {19707#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {19708#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:54:47,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {19708#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {19709#(and (<= |activate_threads2_~tmp~5#1| 0) (< 0 (+ |activate_threads2_~tmp~5#1| 1)))} is VALID [2022-02-20 19:54:47,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {19709#(and (<= |activate_threads2_~tmp~5#1| 0) (< 0 (+ |activate_threads2_~tmp~5#1| 1)))} assume 0 != ~tmp~5#1;~m_st~0 := 0; {19671#false} is VALID [2022-02-20 19:54:47,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {19671#false} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {19671#false} is VALID [2022-02-20 19:54:47,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {19671#false} assume 1 == ~t1_pc~0; {19671#false} is VALID [2022-02-20 19:54:47,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {19671#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {19671#false} is VALID [2022-02-20 19:54:47,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {19671#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {19671#false} is VALID [2022-02-20 19:54:47,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {19671#false} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {19671#false} is VALID [2022-02-20 19:54:47,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {19671#false} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {19671#false} is VALID [2022-02-20 19:54:47,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {19671#false} assume true; {19671#false} is VALID [2022-02-20 19:54:47,572 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {19671#false} {19670#true} #606#return; {19671#false} is VALID [2022-02-20 19:54:47,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:54:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {19705#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {19670#true} is VALID [2022-02-20 19:54:47,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {19670#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {19670#true} is VALID [2022-02-20 19:54:47,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {19670#true} assume 1 == ~E_M~0;~E_M~0 := 2; {19670#true} is VALID [2022-02-20 19:54:47,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {19670#true} assume 1 == ~E_1~0;~E_1~0 := 2; {19670#true} is VALID [2022-02-20 19:54:47,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-02-20 19:54:47,578 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19670#true} {19671#false} #608#return; {19671#false} is VALID [2022-02-20 19:54:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:47,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {19670#true} havoc ~__retres1~6; {19670#true} is VALID [2022-02-20 19:54:47,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {19670#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {19670#true} is VALID [2022-02-20 19:54:47,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {19670#true} #res := ~__retres1~6; {19670#true} is VALID [2022-02-20 19:54:47,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-02-20 19:54:47,582 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19670#true} {19671#false} #610#return; {19671#false} is VALID [2022-02-20 19:54:47,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {19670#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {19670#true} is VALID [2022-02-20 19:54:47,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {19670#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {19670#true} is VALID [2022-02-20 19:54:47,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {19670#true} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {19670#true} is VALID [2022-02-20 19:54:47,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {19670#true} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {19670#true} is VALID [2022-02-20 19:54:47,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {19670#true} call update_channels2(); {19670#true} is VALID [2022-02-20 19:54:47,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-02-20 19:54:47,583 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {19670#true} {19670#true} #602#return; {19670#true} is VALID [2022-02-20 19:54:47,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {19670#true} assume { :begin_inline_init_threads2 } true; {19670#true} is VALID [2022-02-20 19:54:47,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {19670#true} assume 1 == ~m_i~0;~m_st~0 := 0; {19670#true} is VALID [2022-02-20 19:54:47,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {19670#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {19670#true} is VALID [2022-02-20 19:54:47,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {19670#true} assume { :end_inline_init_threads2 } true; {19670#true} is VALID [2022-02-20 19:54:47,584 INFO L272 TraceCheckUtils]: 11: Hoare triple {19670#true} call fire_delta_events2(); {19705#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:47,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {19705#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {19670#true} is VALID [2022-02-20 19:54:47,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {19670#true} assume !(0 == ~T1_E~0); {19670#true} is VALID [2022-02-20 19:54:47,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {19670#true} assume !(0 == ~E_M~0); {19670#true} is VALID [2022-02-20 19:54:47,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {19670#true} assume !(0 == ~E_1~0); {19670#true} is VALID [2022-02-20 19:54:47,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-02-20 19:54:47,585 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19670#true} {19670#true} #604#return; {19670#true} is VALID [2022-02-20 19:54:47,585 INFO L272 TraceCheckUtils]: 18: Hoare triple {19670#true} call activate_threads2(); {19706#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:54:47,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {19706#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {19670#true} is VALID [2022-02-20 19:54:47,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {19670#true} assume !(1 == ~m_pc~0); {19670#true} is VALID [2022-02-20 19:54:47,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {19670#true} is_master_triggered_~__retres1~4#1 := 0; {19707#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:54:47,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {19707#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {19708#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:54:47,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {19708#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {19709#(and (<= |activate_threads2_~tmp~5#1| 0) (< 0 (+ |activate_threads2_~tmp~5#1| 1)))} is VALID [2022-02-20 19:54:47,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {19709#(and (<= |activate_threads2_~tmp~5#1| 0) (< 0 (+ |activate_threads2_~tmp~5#1| 1)))} assume 0 != ~tmp~5#1;~m_st~0 := 0; {19671#false} is VALID [2022-02-20 19:54:47,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {19671#false} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {19671#false} is VALID [2022-02-20 19:54:47,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {19671#false} assume 1 == ~t1_pc~0; {19671#false} is VALID [2022-02-20 19:54:47,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {19671#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {19671#false} is VALID [2022-02-20 19:54:47,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {19671#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {19671#false} is VALID [2022-02-20 19:54:47,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {19671#false} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {19671#false} is VALID [2022-02-20 19:54:47,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {19671#false} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {19671#false} is VALID [2022-02-20 19:54:47,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {19671#false} assume true; {19671#false} is VALID [2022-02-20 19:54:47,588 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19671#false} {19670#true} #606#return; {19671#false} is VALID [2022-02-20 19:54:47,588 INFO L272 TraceCheckUtils]: 33: Hoare triple {19671#false} call reset_delta_events2(); {19705#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:47,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {19705#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {19670#true} is VALID [2022-02-20 19:54:47,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {19670#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {19670#true} is VALID [2022-02-20 19:54:47,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {19670#true} assume 1 == ~E_M~0;~E_M~0 := 2; {19670#true} is VALID [2022-02-20 19:54:47,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {19670#true} assume 1 == ~E_1~0;~E_1~0 := 2; {19670#true} is VALID [2022-02-20 19:54:47,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-02-20 19:54:47,589 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19670#true} {19671#false} #608#return; {19671#false} is VALID [2022-02-20 19:54:47,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {19671#false} assume !false; {19671#false} is VALID [2022-02-20 19:54:47,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {19671#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {19671#false} is VALID [2022-02-20 19:54:47,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {19671#false} assume !false; {19671#false} is VALID [2022-02-20 19:54:47,589 INFO L272 TraceCheckUtils]: 43: Hoare triple {19671#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {19670#true} is VALID [2022-02-20 19:54:47,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {19670#true} havoc ~__retres1~6; {19670#true} is VALID [2022-02-20 19:54:47,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {19670#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {19670#true} is VALID [2022-02-20 19:54:47,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {19670#true} #res := ~__retres1~6; {19670#true} is VALID [2022-02-20 19:54:47,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-02-20 19:54:47,591 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {19670#true} {19671#false} #610#return; {19671#false} is VALID [2022-02-20 19:54:47,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {19671#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {19671#false} is VALID [2022-02-20 19:54:47,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {19671#false} assume 0 != eval2_~tmp~4#1; {19671#false} is VALID [2022-02-20 19:54:47,591 INFO L290 TraceCheckUtils]: 51: Hoare triple {19671#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {19671#false} is VALID [2022-02-20 19:54:47,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {19671#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {19671#false} is VALID [2022-02-20 19:54:47,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {19671#false} assume !(0 == ~m_pc~0); {19671#false} is VALID [2022-02-20 19:54:47,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {19671#false} assume 1 == ~m_pc~0; {19671#false} is VALID [2022-02-20 19:54:47,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {19671#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {19671#false} is VALID [2022-02-20 19:54:47,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {19671#false} assume !false; {19671#false} is VALID [2022-02-20 19:54:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:47,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:47,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492787788] [2022-02-20 19:54:47,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492787788] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:47,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:47,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:54:47,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893944248] [2022-02-20 19:54:47,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:47,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:47,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:47,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:47,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:47,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:54:47,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:54:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:54:47,621 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:48,989 INFO L93 Difference]: Finished difference Result 1381 states and 1951 transitions. [2022-02-20 19:54:48,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:54:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 436 transitions. [2022-02-20 19:54:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 436 transitions. [2022-02-20 19:54:48,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 436 transitions. [2022-02-20 19:54:49,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:49,329 INFO L225 Difference]: With dead ends: 1381 [2022-02-20 19:54:49,329 INFO L226 Difference]: Without dead ends: 956 [2022-02-20 19:54:49,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:54:49,331 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 224 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:49,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 852 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:54:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2022-02-20 19:54:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 813. [2022-02-20 19:54:49,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:49,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 956 states. Second operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-02-20 19:54:49,392 INFO L74 IsIncluded]: Start isIncluded. First operand 956 states. Second operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-02-20 19:54:49,393 INFO L87 Difference]: Start difference. First operand 956 states. Second operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-02-20 19:54:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:49,426 INFO L93 Difference]: Finished difference Result 956 states and 1331 transitions. [2022-02-20 19:54:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1331 transitions. [2022-02-20 19:54:49,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:49,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:49,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) Second operand 956 states. [2022-02-20 19:54:49,430 INFO L87 Difference]: Start difference. First operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) Second operand 956 states. [2022-02-20 19:54:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:49,465 INFO L93 Difference]: Finished difference Result 956 states and 1331 transitions. [2022-02-20 19:54:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1331 transitions. [2022-02-20 19:54:49,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:49,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:49,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:49,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 684 states have (on average 1.3728070175438596) internal successors, (939), 695 states have internal predecessors, (939), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-02-20 19:54:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1116 transitions. [2022-02-20 19:54:49,502 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1116 transitions. Word has length 57 [2022-02-20 19:54:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:49,502 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 1116 transitions. [2022-02-20 19:54:49,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1116 transitions. [2022-02-20 19:54:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:54:49,503 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:49,504 INFO L514 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] [2022-02-20 19:54:49,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:54:49,504 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1081102988, now seen corresponding path program 1 times [2022-02-20 19:54:49,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:49,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573106922] [2022-02-20 19:54:49,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:49,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {24611#true} assume true; {24611#true} is VALID [2022-02-20 19:54:49,535 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {24611#true} {24613#(= ~t1_pc~0 0)} #602#return; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:54:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {24647#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {24611#true} is VALID [2022-02-20 19:54:49,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {24611#true} assume !(0 == ~T1_E~0); {24611#true} is VALID [2022-02-20 19:54:49,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {24611#true} assume !(0 == ~E_M~0); {24611#true} is VALID [2022-02-20 19:54:49,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {24611#true} assume !(0 == ~E_1~0); {24611#true} is VALID [2022-02-20 19:54:49,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {24611#true} assume true; {24611#true} is VALID [2022-02-20 19:54:49,554 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24611#true} {24613#(= ~t1_pc~0 0)} #604#return; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:54:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {24648#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {24611#true} is VALID [2022-02-20 19:54:49,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {24611#true} assume !(1 == ~m_pc~0); {24611#true} is VALID [2022-02-20 19:54:49,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {24611#true} is_master_triggered_~__retres1~4#1 := 0; {24611#true} is VALID [2022-02-20 19:54:49,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {24611#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {24611#true} is VALID [2022-02-20 19:54:49,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {24611#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {24611#true} is VALID [2022-02-20 19:54:49,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {24611#true} assume !(0 != ~tmp~5#1); {24611#true} is VALID [2022-02-20 19:54:49,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {24611#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {24611#true} is VALID [2022-02-20 19:54:49,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {24611#true} assume 1 == ~t1_pc~0; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {24649#(<= 1 ~t1_pc~0)} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {24649#(<= 1 ~t1_pc~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {24649#(<= 1 ~t1_pc~0)} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {24649#(<= 1 ~t1_pc~0)} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {24649#(<= 1 ~t1_pc~0)} assume true; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,574 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {24649#(<= 1 ~t1_pc~0)} {24613#(= ~t1_pc~0 0)} #606#return; {24612#false} is VALID [2022-02-20 19:54:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:54:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {24647#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {24611#true} is VALID [2022-02-20 19:54:49,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {24611#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {24611#true} is VALID [2022-02-20 19:54:49,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {24611#true} assume 1 == ~E_M~0;~E_M~0 := 2; {24611#true} is VALID [2022-02-20 19:54:49,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {24611#true} assume 1 == ~E_1~0;~E_1~0 := 2; {24611#true} is VALID [2022-02-20 19:54:49,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {24611#true} assume true; {24611#true} is VALID [2022-02-20 19:54:49,589 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {24611#true} {24612#false} #608#return; {24612#false} is VALID [2022-02-20 19:54:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:49,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {24611#true} havoc ~__retres1~6; {24611#true} is VALID [2022-02-20 19:54:49,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {24611#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {24611#true} is VALID [2022-02-20 19:54:49,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {24611#true} #res := ~__retres1~6; {24611#true} is VALID [2022-02-20 19:54:49,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {24611#true} assume true; {24611#true} is VALID [2022-02-20 19:54:49,593 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24611#true} {24612#false} #610#return; {24612#false} is VALID [2022-02-20 19:54:49,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {24611#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {24613#(= ~t1_pc~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {24613#(= ~t1_pc~0 0)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {24613#(= ~t1_pc~0 0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {24613#(= ~t1_pc~0 0)} call update_channels2(); {24611#true} is VALID [2022-02-20 19:54:49,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {24611#true} assume true; {24611#true} is VALID [2022-02-20 19:54:49,595 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {24611#true} {24613#(= ~t1_pc~0 0)} #602#return; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {24613#(= ~t1_pc~0 0)} assume { :begin_inline_init_threads2 } true; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {24613#(= ~t1_pc~0 0)} assume 1 == ~m_i~0;~m_st~0 := 0; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {24613#(= ~t1_pc~0 0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {24613#(= ~t1_pc~0 0)} assume { :end_inline_init_threads2 } true; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,596 INFO L272 TraceCheckUtils]: 11: Hoare triple {24613#(= ~t1_pc~0 0)} call fire_delta_events2(); {24647#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:49,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {24647#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {24611#true} is VALID [2022-02-20 19:54:49,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {24611#true} assume !(0 == ~T1_E~0); {24611#true} is VALID [2022-02-20 19:54:49,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {24611#true} assume !(0 == ~E_M~0); {24611#true} is VALID [2022-02-20 19:54:49,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {24611#true} assume !(0 == ~E_1~0); {24611#true} is VALID [2022-02-20 19:54:49,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {24611#true} assume true; {24611#true} is VALID [2022-02-20 19:54:49,597 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24611#true} {24613#(= ~t1_pc~0 0)} #604#return; {24613#(= ~t1_pc~0 0)} is VALID [2022-02-20 19:54:49,597 INFO L272 TraceCheckUtils]: 18: Hoare triple {24613#(= ~t1_pc~0 0)} call activate_threads2(); {24648#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:54:49,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {24648#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {24611#true} is VALID [2022-02-20 19:54:49,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {24611#true} assume !(1 == ~m_pc~0); {24611#true} is VALID [2022-02-20 19:54:49,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {24611#true} is_master_triggered_~__retres1~4#1 := 0; {24611#true} is VALID [2022-02-20 19:54:49,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {24611#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {24611#true} is VALID [2022-02-20 19:54:49,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {24611#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {24611#true} is VALID [2022-02-20 19:54:49,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {24611#true} assume !(0 != ~tmp~5#1); {24611#true} is VALID [2022-02-20 19:54:49,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {24611#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {24611#true} is VALID [2022-02-20 19:54:49,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {24611#true} assume 1 == ~t1_pc~0; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {24649#(<= 1 ~t1_pc~0)} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {24649#(<= 1 ~t1_pc~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {24649#(<= 1 ~t1_pc~0)} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {24649#(<= 1 ~t1_pc~0)} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {24649#(<= 1 ~t1_pc~0)} assume true; {24649#(<= 1 ~t1_pc~0)} is VALID [2022-02-20 19:54:49,600 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24649#(<= 1 ~t1_pc~0)} {24613#(= ~t1_pc~0 0)} #606#return; {24612#false} is VALID [2022-02-20 19:54:49,600 INFO L272 TraceCheckUtils]: 33: Hoare triple {24612#false} call reset_delta_events2(); {24647#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:49,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {24647#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {24611#true} is VALID [2022-02-20 19:54:49,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {24611#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {24611#true} is VALID [2022-02-20 19:54:49,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {24611#true} assume 1 == ~E_M~0;~E_M~0 := 2; {24611#true} is VALID [2022-02-20 19:54:49,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {24611#true} assume 1 == ~E_1~0;~E_1~0 := 2; {24611#true} is VALID [2022-02-20 19:54:49,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {24611#true} assume true; {24611#true} is VALID [2022-02-20 19:54:49,601 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24611#true} {24612#false} #608#return; {24612#false} is VALID [2022-02-20 19:54:49,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {24612#false} assume !false; {24612#false} is VALID [2022-02-20 19:54:49,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {24612#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {24612#false} is VALID [2022-02-20 19:54:49,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {24612#false} assume !false; {24612#false} is VALID [2022-02-20 19:54:49,601 INFO L272 TraceCheckUtils]: 43: Hoare triple {24612#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {24611#true} is VALID [2022-02-20 19:54:49,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {24611#true} havoc ~__retres1~6; {24611#true} is VALID [2022-02-20 19:54:49,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {24611#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {24611#true} is VALID [2022-02-20 19:54:49,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {24611#true} #res := ~__retres1~6; {24611#true} is VALID [2022-02-20 19:54:49,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {24611#true} assume true; {24611#true} is VALID [2022-02-20 19:54:49,602 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24611#true} {24612#false} #610#return; {24612#false} is VALID [2022-02-20 19:54:49,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {24612#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {24612#false} is VALID [2022-02-20 19:54:49,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {24612#false} assume 0 != eval2_~tmp~4#1; {24612#false} is VALID [2022-02-20 19:54:49,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {24612#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {24612#false} is VALID [2022-02-20 19:54:49,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {24612#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {24612#false} is VALID [2022-02-20 19:54:49,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {24612#false} assume !(0 == ~m_pc~0); {24612#false} is VALID [2022-02-20 19:54:49,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {24612#false} assume 1 == ~m_pc~0; {24612#false} is VALID [2022-02-20 19:54:49,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {24612#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {24612#false} is VALID [2022-02-20 19:54:49,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {24612#false} assume !false; {24612#false} is VALID [2022-02-20 19:54:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:49,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:49,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573106922] [2022-02-20 19:54:49,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573106922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:49,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:49,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:54:49,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573350504] [2022-02-20 19:54:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:49,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:49,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:49,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:49,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:49,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:54:49,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:49,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:54:49,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:54:49,638 INFO L87 Difference]: Start difference. First operand 813 states and 1116 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:51,203 INFO L93 Difference]: Finished difference Result 1803 states and 2499 transitions. [2022-02-20 19:54:51,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:54:51,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 554 transitions. [2022-02-20 19:54:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 554 transitions. [2022-02-20 19:54:51,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 554 transitions. [2022-02-20 19:54:51,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 554 edges. 554 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:51,658 INFO L225 Difference]: With dead ends: 1803 [2022-02-20 19:54:51,658 INFO L226 Difference]: Without dead ends: 1363 [2022-02-20 19:54:51,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:54:51,660 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 563 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:51,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 775 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:54:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2022-02-20 19:54:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1204. [2022-02-20 19:54:51,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:51,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1363 states. Second operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-02-20 19:54:51,823 INFO L74 IsIncluded]: Start isIncluded. First operand 1363 states. Second operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-02-20 19:54:51,824 INFO L87 Difference]: Start difference. First operand 1363 states. Second operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-02-20 19:54:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:51,881 INFO L93 Difference]: Finished difference Result 1363 states and 1856 transitions. [2022-02-20 19:54:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1856 transitions. [2022-02-20 19:54:51,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:51,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:51,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) Second operand 1363 states. [2022-02-20 19:54:51,887 INFO L87 Difference]: Start difference. First operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) Second operand 1363 states. [2022-02-20 19:54:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:51,946 INFO L93 Difference]: Finished difference Result 1363 states and 1856 transitions. [2022-02-20 19:54:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1856 transitions. [2022-02-20 19:54:51,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:51,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:51,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:51,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1001 states have (on average 1.3716283716283717) internal successors, (1373), 1016 states have internal predecessors, (1373), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-02-20 19:54:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1644 transitions. [2022-02-20 19:54:52,016 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1644 transitions. Word has length 57 [2022-02-20 19:54:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:52,017 INFO L470 AbstractCegarLoop]: Abstraction has 1204 states and 1644 transitions. [2022-02-20 19:54:52,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1644 transitions. [2022-02-20 19:54:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:54:52,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:52,018 INFO L514 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] [2022-02-20 19:54:52,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:54:52,019 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:52,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash -690367987, now seen corresponding path program 1 times [2022-02-20 19:54:52,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:52,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357870611] [2022-02-20 19:54:52,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:52,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {31474#true} assume true; {31474#true} is VALID [2022-02-20 19:54:52,044 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {31474#true} {31474#true} #602#return; {31474#true} is VALID [2022-02-20 19:54:52,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:54:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {31509#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {31474#true} is VALID [2022-02-20 19:54:52,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {31474#true} assume !(0 == ~T1_E~0); {31474#true} is VALID [2022-02-20 19:54:52,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {31474#true} assume !(0 == ~E_M~0); {31474#true} is VALID [2022-02-20 19:54:52,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {31474#true} assume !(0 == ~E_1~0); {31474#true} is VALID [2022-02-20 19:54:52,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {31474#true} assume true; {31474#true} is VALID [2022-02-20 19:54:52,054 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31474#true} {31474#true} #604#return; {31474#true} is VALID [2022-02-20 19:54:52,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:54:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {31510#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {31474#true} is VALID [2022-02-20 19:54:52,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {31474#true} assume !(1 == ~m_pc~0); {31474#true} is VALID [2022-02-20 19:54:52,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {31474#true} is_master_triggered_~__retres1~4#1 := 0; {31474#true} is VALID [2022-02-20 19:54:52,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {31474#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {31474#true} is VALID [2022-02-20 19:54:52,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {31474#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {31474#true} is VALID [2022-02-20 19:54:52,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {31474#true} assume !(0 != ~tmp~5#1); {31474#true} is VALID [2022-02-20 19:54:52,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {31474#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {31474#true} is VALID [2022-02-20 19:54:52,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {31474#true} assume !(1 == ~t1_pc~0); {31474#true} is VALID [2022-02-20 19:54:52,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {31474#true} is_transmit1_triggered_~__retres1~5#1 := 0; {31511#(and (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0) (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|))} is VALID [2022-02-20 19:54:52,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {31511#(and (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0) (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {31512#(and (<= |activate_threads2_is_transmit1_triggered_#res#1| 0) (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|))} is VALID [2022-02-20 19:54:52,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {31512#(and (<= |activate_threads2_is_transmit1_triggered_#res#1| 0) (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|))} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {31513#(and (< 0 (+ |activate_threads2_~tmp___0~2#1| 1)) (<= |activate_threads2_~tmp___0~2#1| 0))} is VALID [2022-02-20 19:54:52,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {31513#(and (< 0 (+ |activate_threads2_~tmp___0~2#1| 1)) (<= |activate_threads2_~tmp___0~2#1| 0))} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {31475#false} is VALID [2022-02-20 19:54:52,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {31475#false} assume true; {31475#false} is VALID [2022-02-20 19:54:52,103 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {31475#false} {31474#true} #606#return; {31475#false} is VALID [2022-02-20 19:54:52,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:54:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {31509#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {31474#true} is VALID [2022-02-20 19:54:52,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {31474#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {31474#true} is VALID [2022-02-20 19:54:52,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {31474#true} assume 1 == ~E_M~0;~E_M~0 := 2; {31474#true} is VALID [2022-02-20 19:54:52,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {31474#true} assume 1 == ~E_1~0;~E_1~0 := 2; {31474#true} is VALID [2022-02-20 19:54:52,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {31474#true} assume true; {31474#true} is VALID [2022-02-20 19:54:52,108 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {31474#true} {31475#false} #608#return; {31475#false} is VALID [2022-02-20 19:54:52,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:52,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {31474#true} havoc ~__retres1~6; {31474#true} is VALID [2022-02-20 19:54:52,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {31474#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {31474#true} is VALID [2022-02-20 19:54:52,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {31474#true} #res := ~__retres1~6; {31474#true} is VALID [2022-02-20 19:54:52,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {31474#true} assume true; {31474#true} is VALID [2022-02-20 19:54:52,114 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31474#true} {31475#false} #610#return; {31475#false} is VALID [2022-02-20 19:54:52,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {31474#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {31474#true} is VALID [2022-02-20 19:54:52,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {31474#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {31474#true} is VALID [2022-02-20 19:54:52,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {31474#true} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {31474#true} is VALID [2022-02-20 19:54:52,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {31474#true} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {31474#true} is VALID [2022-02-20 19:54:52,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {31474#true} call update_channels2(); {31474#true} is VALID [2022-02-20 19:54:52,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {31474#true} assume true; {31474#true} is VALID [2022-02-20 19:54:52,115 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31474#true} {31474#true} #602#return; {31474#true} is VALID [2022-02-20 19:54:52,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {31474#true} assume { :begin_inline_init_threads2 } true; {31474#true} is VALID [2022-02-20 19:54:52,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {31474#true} assume 1 == ~m_i~0;~m_st~0 := 0; {31474#true} is VALID [2022-02-20 19:54:52,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {31474#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {31474#true} is VALID [2022-02-20 19:54:52,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {31474#true} assume { :end_inline_init_threads2 } true; {31474#true} is VALID [2022-02-20 19:54:52,116 INFO L272 TraceCheckUtils]: 11: Hoare triple {31474#true} call fire_delta_events2(); {31509#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:52,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {31509#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {31474#true} is VALID [2022-02-20 19:54:52,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {31474#true} assume !(0 == ~T1_E~0); {31474#true} is VALID [2022-02-20 19:54:52,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {31474#true} assume !(0 == ~E_M~0); {31474#true} is VALID [2022-02-20 19:54:52,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {31474#true} assume !(0 == ~E_1~0); {31474#true} is VALID [2022-02-20 19:54:52,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {31474#true} assume true; {31474#true} is VALID [2022-02-20 19:54:52,117 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {31474#true} {31474#true} #604#return; {31474#true} is VALID [2022-02-20 19:54:52,117 INFO L272 TraceCheckUtils]: 18: Hoare triple {31474#true} call activate_threads2(); {31510#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:54:52,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {31510#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {31474#true} is VALID [2022-02-20 19:54:52,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {31474#true} assume !(1 == ~m_pc~0); {31474#true} is VALID [2022-02-20 19:54:52,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {31474#true} is_master_triggered_~__retres1~4#1 := 0; {31474#true} is VALID [2022-02-20 19:54:52,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {31474#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {31474#true} is VALID [2022-02-20 19:54:52,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {31474#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {31474#true} is VALID [2022-02-20 19:54:52,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {31474#true} assume !(0 != ~tmp~5#1); {31474#true} is VALID [2022-02-20 19:54:52,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {31474#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {31474#true} is VALID [2022-02-20 19:54:52,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {31474#true} assume !(1 == ~t1_pc~0); {31474#true} is VALID [2022-02-20 19:54:52,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {31474#true} is_transmit1_triggered_~__retres1~5#1 := 0; {31511#(and (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0) (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|))} is VALID [2022-02-20 19:54:52,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {31511#(and (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0) (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {31512#(and (<= |activate_threads2_is_transmit1_triggered_#res#1| 0) (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|))} is VALID [2022-02-20 19:54:52,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {31512#(and (<= |activate_threads2_is_transmit1_triggered_#res#1| 0) (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|))} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {31513#(and (< 0 (+ |activate_threads2_~tmp___0~2#1| 1)) (<= |activate_threads2_~tmp___0~2#1| 0))} is VALID [2022-02-20 19:54:52,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {31513#(and (< 0 (+ |activate_threads2_~tmp___0~2#1| 1)) (<= |activate_threads2_~tmp___0~2#1| 0))} assume 0 != ~tmp___0~2#1;~t1_st~0 := 0; {31475#false} is VALID [2022-02-20 19:54:52,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {31475#false} assume true; {31475#false} is VALID [2022-02-20 19:54:52,120 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {31475#false} {31474#true} #606#return; {31475#false} is VALID [2022-02-20 19:54:52,120 INFO L272 TraceCheckUtils]: 33: Hoare triple {31475#false} call reset_delta_events2(); {31509#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:52,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {31509#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {31474#true} is VALID [2022-02-20 19:54:52,120 INFO L290 TraceCheckUtils]: 35: Hoare triple {31474#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {31474#true} is VALID [2022-02-20 19:54:52,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {31474#true} assume 1 == ~E_M~0;~E_M~0 := 2; {31474#true} is VALID [2022-02-20 19:54:52,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {31474#true} assume 1 == ~E_1~0;~E_1~0 := 2; {31474#true} is VALID [2022-02-20 19:54:52,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {31474#true} assume true; {31474#true} is VALID [2022-02-20 19:54:52,126 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31474#true} {31475#false} #608#return; {31475#false} is VALID [2022-02-20 19:54:52,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {31475#false} assume !false; {31475#false} is VALID [2022-02-20 19:54:52,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {31475#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {31475#false} is VALID [2022-02-20 19:54:52,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {31475#false} assume !false; {31475#false} is VALID [2022-02-20 19:54:52,127 INFO L272 TraceCheckUtils]: 43: Hoare triple {31475#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {31474#true} is VALID [2022-02-20 19:54:52,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {31474#true} havoc ~__retres1~6; {31474#true} is VALID [2022-02-20 19:54:52,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {31474#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {31474#true} is VALID [2022-02-20 19:54:52,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {31474#true} #res := ~__retres1~6; {31474#true} is VALID [2022-02-20 19:54:52,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {31474#true} assume true; {31474#true} is VALID [2022-02-20 19:54:52,127 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {31474#true} {31475#false} #610#return; {31475#false} is VALID [2022-02-20 19:54:52,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {31475#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {31475#false} is VALID [2022-02-20 19:54:52,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {31475#false} assume 0 != eval2_~tmp~4#1; {31475#false} is VALID [2022-02-20 19:54:52,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {31475#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {31475#false} is VALID [2022-02-20 19:54:52,128 INFO L290 TraceCheckUtils]: 52: Hoare triple {31475#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {31475#false} is VALID [2022-02-20 19:54:52,128 INFO L290 TraceCheckUtils]: 53: Hoare triple {31475#false} assume !(0 == ~m_pc~0); {31475#false} is VALID [2022-02-20 19:54:52,128 INFO L290 TraceCheckUtils]: 54: Hoare triple {31475#false} assume 1 == ~m_pc~0; {31475#false} is VALID [2022-02-20 19:54:52,128 INFO L290 TraceCheckUtils]: 55: Hoare triple {31475#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {31475#false} is VALID [2022-02-20 19:54:52,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {31475#false} assume !false; {31475#false} is VALID [2022-02-20 19:54:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:52,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:52,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357870611] [2022-02-20 19:54:52,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357870611] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:52,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:52,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:54:52,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540952219] [2022-02-20 19:54:52,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:52,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:52,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:52,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:52,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:52,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:54:52,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:52,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:54:52,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:54:52,156 INFO L87 Difference]: Start difference. First operand 1204 states and 1644 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:53,784 INFO L93 Difference]: Finished difference Result 2242 states and 3103 transitions. [2022-02-20 19:54:53,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 19:54:53,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 427 transitions. [2022-02-20 19:54:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 427 transitions. [2022-02-20 19:54:53,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 427 transitions. [2022-02-20 19:54:54,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:54,138 INFO L225 Difference]: With dead ends: 2242 [2022-02-20 19:54:54,138 INFO L226 Difference]: Without dead ends: 1411 [2022-02-20 19:54:54,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:54:54,141 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 190 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:54,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 846 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:54:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-02-20 19:54:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1219. [2022-02-20 19:54:54,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:54,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1411 states. Second operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-02-20 19:54:54,364 INFO L74 IsIncluded]: Start isIncluded. First operand 1411 states. Second operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-02-20 19:54:54,365 INFO L87 Difference]: Start difference. First operand 1411 states. Second operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-02-20 19:54:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:54,442 INFO L93 Difference]: Finished difference Result 1411 states and 1913 transitions. [2022-02-20 19:54:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1913 transitions. [2022-02-20 19:54:54,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:54,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:54,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) Second operand 1411 states. [2022-02-20 19:54:54,448 INFO L87 Difference]: Start difference. First operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) Second operand 1411 states. [2022-02-20 19:54:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:54,511 INFO L93 Difference]: Finished difference Result 1411 states and 1913 transitions. [2022-02-20 19:54:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1913 transitions. [2022-02-20 19:54:54,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:54,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:54,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:54,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1016 states have (on average 1.361220472440945) internal successors, (1383), 1031 states have internal predecessors, (1383), 119 states have call successors, (119), 73 states have call predecessors, (119), 82 states have return successors, (152), 118 states have call predecessors, (152), 117 states have call successors, (152) [2022-02-20 19:54:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1654 transitions. [2022-02-20 19:54:54,590 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1654 transitions. Word has length 57 [2022-02-20 19:54:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:54,590 INFO L470 AbstractCegarLoop]: Abstraction has 1219 states and 1654 transitions. [2022-02-20 19:54:54,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1654 transitions. [2022-02-20 19:54:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:54:54,592 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:54,592 INFO L514 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] [2022-02-20 19:54:54,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:54:54,592 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:54,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1232860047, now seen corresponding path program 1 times [2022-02-20 19:54:54,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:54,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538958532] [2022-02-20 19:54:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {39053#true} assume true; {39053#true} is VALID [2022-02-20 19:54:54,617 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {39053#true} {39055#(= ~T1_E~0 ~M_E~0)} #602#return; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:54:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {39089#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} assume !(0 == ~T1_E~0); {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} assume !(0 == ~E_M~0); {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} assume !(0 == ~E_1~0); {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} assume true; {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,632 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} {39055#(= ~T1_E~0 ~M_E~0)} #604#return; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:54:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {39091#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {39053#true} is VALID [2022-02-20 19:54:54,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {39053#true} assume !(1 == ~m_pc~0); {39053#true} is VALID [2022-02-20 19:54:54,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {39053#true} is_master_triggered_~__retres1~4#1 := 0; {39053#true} is VALID [2022-02-20 19:54:54,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {39053#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {39053#true} is VALID [2022-02-20 19:54:54,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {39053#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {39053#true} is VALID [2022-02-20 19:54:54,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {39053#true} assume !(0 != ~tmp~5#1); {39053#true} is VALID [2022-02-20 19:54:54,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {39053#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {39053#true} is VALID [2022-02-20 19:54:54,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {39053#true} assume !(1 == ~t1_pc~0); {39053#true} is VALID [2022-02-20 19:54:54,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {39053#true} is_transmit1_triggered_~__retres1~5#1 := 0; {39053#true} is VALID [2022-02-20 19:54:54,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {39053#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {39053#true} is VALID [2022-02-20 19:54:54,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {39053#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {39053#true} is VALID [2022-02-20 19:54:54,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {39053#true} assume !(0 != ~tmp___0~2#1); {39053#true} is VALID [2022-02-20 19:54:54,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {39053#true} assume true; {39053#true} is VALID [2022-02-20 19:54:54,646 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {39053#true} {39055#(= ~T1_E~0 ~M_E~0)} #606#return; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:54:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {39089#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {39092#(and (not (= |old(~M_E~0)| 1)) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {39092#(and (not (= |old(~M_E~0)| 1)) (= |old(~T1_E~0)| ~T1_E~0))} assume 1 == ~T1_E~0;~T1_E~0 := 2; {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:54,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 1 == ~E_M~0;~E_M~0 := 2; {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:54,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 1 == ~E_1~0;~E_1~0 := 2; {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:54,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:54,663 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {39055#(= ~T1_E~0 ~M_E~0)} #608#return; {39054#false} is VALID [2022-02-20 19:54:54,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:54,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {39053#true} havoc ~__retres1~6; {39053#true} is VALID [2022-02-20 19:54:54,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {39053#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {39053#true} is VALID [2022-02-20 19:54:54,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {39053#true} #res := ~__retres1~6; {39053#true} is VALID [2022-02-20 19:54:54,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {39053#true} assume true; {39053#true} is VALID [2022-02-20 19:54:54,666 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {39053#true} {39054#false} #610#return; {39054#false} is VALID [2022-02-20 19:54:54,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {39053#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {39053#true} is VALID [2022-02-20 19:54:54,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {39053#true} assume true; {39053#true} is VALID [2022-02-20 19:54:54,668 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {39053#true} {39055#(= ~T1_E~0 ~M_E~0)} #602#return; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {39089#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:54,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {39089#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} assume !(0 == ~T1_E~0); {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} assume !(0 == ~E_M~0); {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} assume !(0 == ~E_1~0); {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} assume true; {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,672 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {39090#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0))} {39055#(= ~T1_E~0 ~M_E~0)} #604#return; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,672 INFO L272 TraceCheckUtils]: 18: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} call activate_threads2(); {39091#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:54:54,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {39091#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {39053#true} is VALID [2022-02-20 19:54:54,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {39053#true} assume !(1 == ~m_pc~0); {39053#true} is VALID [2022-02-20 19:54:54,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {39053#true} is_master_triggered_~__retres1~4#1 := 0; {39053#true} is VALID [2022-02-20 19:54:54,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {39053#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {39053#true} is VALID [2022-02-20 19:54:54,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {39053#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {39053#true} is VALID [2022-02-20 19:54:54,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {39053#true} assume !(0 != ~tmp~5#1); {39053#true} is VALID [2022-02-20 19:54:54,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {39053#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {39053#true} is VALID [2022-02-20 19:54:54,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {39053#true} assume !(1 == ~t1_pc~0); {39053#true} is VALID [2022-02-20 19:54:54,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {39053#true} is_transmit1_triggered_~__retres1~5#1 := 0; {39053#true} is VALID [2022-02-20 19:54:54,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {39053#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {39053#true} is VALID [2022-02-20 19:54:54,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {39053#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {39053#true} is VALID [2022-02-20 19:54:54,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {39053#true} assume !(0 != ~tmp___0~2#1); {39053#true} is VALID [2022-02-20 19:54:54,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {39053#true} assume true; {39053#true} is VALID [2022-02-20 19:54:54,673 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {39053#true} {39055#(= ~T1_E~0 ~M_E~0)} #606#return; {39055#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:54:54,674 INFO L272 TraceCheckUtils]: 33: Hoare triple {39055#(= ~T1_E~0 ~M_E~0)} call reset_delta_events2(); {39089#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:54,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {39089#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {39092#(and (not (= |old(~M_E~0)| 1)) (= |old(~T1_E~0)| ~T1_E~0))} is VALID [2022-02-20 19:54:54,674 INFO L290 TraceCheckUtils]: 35: Hoare triple {39092#(and (not (= |old(~M_E~0)| 1)) (= |old(~T1_E~0)| ~T1_E~0))} assume 1 == ~T1_E~0;~T1_E~0 := 2; {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:54,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 1 == ~E_M~0;~E_M~0 := 2; {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:54,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 1 == ~E_1~0;~E_1~0 := 2; {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:54,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:54,675 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {39093#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {39055#(= ~T1_E~0 ~M_E~0)} #608#return; {39054#false} is VALID [2022-02-20 19:54:54,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {39054#false} assume !false; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {39054#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {39054#false} assume !false; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L272 TraceCheckUtils]: 43: Hoare triple {39054#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {39053#true} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {39053#true} havoc ~__retres1~6; {39053#true} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {39053#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {39053#true} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {39053#true} #res := ~__retres1~6; {39053#true} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {39053#true} assume true; {39053#true} is VALID [2022-02-20 19:54:54,676 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {39053#true} {39054#false} #610#return; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {39054#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {39054#false} assume 0 != eval2_~tmp~4#1; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {39054#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 52: Hoare triple {39054#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 53: Hoare triple {39054#false} assume !(0 == ~m_pc~0); {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 54: Hoare triple {39054#false} assume 1 == ~m_pc~0; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 55: Hoare triple {39054#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {39054#false} is VALID [2022-02-20 19:54:54,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {39054#false} assume !false; {39054#false} is VALID [2022-02-20 19:54:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:54,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:54,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538958532] [2022-02-20 19:54:54,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538958532] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:54,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:54,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:54:54,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64157522] [2022-02-20 19:54:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:54,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:54,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:54,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:54,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:54,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:54:54,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:54:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:54:54,707 INFO L87 Difference]: Start difference. First operand 1219 states and 1654 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:56,424 INFO L93 Difference]: Finished difference Result 1767 states and 2397 transitions. [2022-02-20 19:54:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:54:56,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:56,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 556 transitions. [2022-02-20 19:54:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 556 transitions. [2022-02-20 19:54:56,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 556 transitions. [2022-02-20 19:54:56,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:56,815 INFO L225 Difference]: With dead ends: 1767 [2022-02-20 19:54:56,815 INFO L226 Difference]: Without dead ends: 1237 [2022-02-20 19:54:56,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:54:56,817 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 606 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:56,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [619 Valid, 770 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:54:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2022-02-20 19:54:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1051. [2022-02-20 19:54:56,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:54:56,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1237 states. Second operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2022-02-20 19:54:56,989 INFO L74 IsIncluded]: Start isIncluded. First operand 1237 states. Second operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2022-02-20 19:54:56,990 INFO L87 Difference]: Start difference. First operand 1237 states. Second operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2022-02-20 19:54:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:57,037 INFO L93 Difference]: Finished difference Result 1237 states and 1661 transitions. [2022-02-20 19:54:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1661 transitions. [2022-02-20 19:54:57,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:57,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:57,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) Second operand 1237 states. [2022-02-20 19:54:57,042 INFO L87 Difference]: Start difference. First operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) Second operand 1237 states. [2022-02-20 19:54:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:57,089 INFO L93 Difference]: Finished difference Result 1237 states and 1661 transitions. [2022-02-20 19:54:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1661 transitions. [2022-02-20 19:54:57,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:57,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:57,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:57,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 879 states have (on average 1.3515358361774743) internal successors, (1188), 890 states have internal predecessors, (1188), 103 states have call successors, (103), 62 states have call predecessors, (103), 67 states have return successors, (120), 100 states have call predecessors, (120), 101 states have call successors, (120) [2022-02-20 19:54:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1411 transitions. [2022-02-20 19:54:57,144 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1411 transitions. Word has length 57 [2022-02-20 19:54:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:57,144 INFO L470 AbstractCegarLoop]: Abstraction has 1051 states and 1411 transitions. [2022-02-20 19:54:57,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1411 transitions. [2022-02-20 19:54:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:54:57,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:57,145 INFO L514 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] [2022-02-20 19:54:57,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:54:57,146 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1451714765, now seen corresponding path program 1 times [2022-02-20 19:54:57,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:57,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055375226] [2022-02-20 19:54:57,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:57,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:54:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {45422#true} assume true; {45422#true} is VALID [2022-02-20 19:54:57,175 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {45422#true} {45424#(= ~E_M~0 ~M_E~0)} #602#return; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:54:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {45458#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} assume !(0 == ~T1_E~0); {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} assume !(0 == ~E_M~0); {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} assume !(0 == ~E_1~0); {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} assume true; {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,191 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} {45424#(= ~E_M~0 ~M_E~0)} #604#return; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:54:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {45460#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {45422#true} is VALID [2022-02-20 19:54:57,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {45422#true} assume !(1 == ~m_pc~0); {45422#true} is VALID [2022-02-20 19:54:57,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {45422#true} is_master_triggered_~__retres1~4#1 := 0; {45422#true} is VALID [2022-02-20 19:54:57,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {45422#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {45422#true} is VALID [2022-02-20 19:54:57,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {45422#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {45422#true} is VALID [2022-02-20 19:54:57,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {45422#true} assume !(0 != ~tmp~5#1); {45422#true} is VALID [2022-02-20 19:54:57,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {45422#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {45422#true} is VALID [2022-02-20 19:54:57,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {45422#true} assume !(1 == ~t1_pc~0); {45422#true} is VALID [2022-02-20 19:54:57,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {45422#true} is_transmit1_triggered_~__retres1~5#1 := 0; {45422#true} is VALID [2022-02-20 19:54:57,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {45422#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {45422#true} is VALID [2022-02-20 19:54:57,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {45422#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {45422#true} is VALID [2022-02-20 19:54:57,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {45422#true} assume !(0 != ~tmp___0~2#1); {45422#true} is VALID [2022-02-20 19:54:57,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {45422#true} assume true; {45422#true} is VALID [2022-02-20 19:54:57,201 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {45422#true} {45424#(= ~E_M~0 ~M_E~0)} #606#return; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:54:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {45458#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {45461#(and (not (= |old(~M_E~0)| 1)) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {45461#(and (not (= |old(~M_E~0)| 1)) (= ~E_M~0 |old(~E_M~0)|))} assume !(1 == ~T1_E~0); {45461#(and (not (= |old(~M_E~0)| 1)) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {45461#(and (not (= |old(~M_E~0)| 1)) (= ~E_M~0 |old(~E_M~0)|))} assume 1 == ~E_M~0;~E_M~0 := 2; {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 1 == ~E_1~0;~E_1~0 := 2; {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,220 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {45424#(= ~E_M~0 ~M_E~0)} #608#return; {45423#false} is VALID [2022-02-20 19:54:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:54:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:57,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {45422#true} havoc ~__retres1~6; {45422#true} is VALID [2022-02-20 19:54:57,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {45422#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {45422#true} is VALID [2022-02-20 19:54:57,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {45422#true} #res := ~__retres1~6; {45422#true} is VALID [2022-02-20 19:54:57,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {45422#true} assume true; {45422#true} is VALID [2022-02-20 19:54:57,227 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {45422#true} {45423#false} #610#return; {45423#false} is VALID [2022-02-20 19:54:57,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {45422#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} call update_channels2(); {45422#true} is VALID [2022-02-20 19:54:57,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {45422#true} assume true; {45422#true} is VALID [2022-02-20 19:54:57,229 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {45422#true} {45424#(= ~E_M~0 ~M_E~0)} #602#return; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,230 INFO L272 TraceCheckUtils]: 11: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} call fire_delta_events2(); {45458#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:57,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {45458#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} assume !(0 == ~T1_E~0); {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} assume !(0 == ~E_M~0); {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} assume !(0 == ~E_1~0); {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} assume true; {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,232 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {45459#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_M~0 |old(~E_M~0)|))} {45424#(= ~E_M~0 ~M_E~0)} #604#return; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,233 INFO L272 TraceCheckUtils]: 18: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} call activate_threads2(); {45460#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:54:57,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {45460#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {45422#true} is VALID [2022-02-20 19:54:57,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {45422#true} assume !(1 == ~m_pc~0); {45422#true} is VALID [2022-02-20 19:54:57,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {45422#true} is_master_triggered_~__retres1~4#1 := 0; {45422#true} is VALID [2022-02-20 19:54:57,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {45422#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {45422#true} is VALID [2022-02-20 19:54:57,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {45422#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {45422#true} is VALID [2022-02-20 19:54:57,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {45422#true} assume !(0 != ~tmp~5#1); {45422#true} is VALID [2022-02-20 19:54:57,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {45422#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {45422#true} is VALID [2022-02-20 19:54:57,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {45422#true} assume !(1 == ~t1_pc~0); {45422#true} is VALID [2022-02-20 19:54:57,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {45422#true} is_transmit1_triggered_~__retres1~5#1 := 0; {45422#true} is VALID [2022-02-20 19:54:57,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {45422#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {45422#true} is VALID [2022-02-20 19:54:57,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {45422#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {45422#true} is VALID [2022-02-20 19:54:57,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {45422#true} assume !(0 != ~tmp___0~2#1); {45422#true} is VALID [2022-02-20 19:54:57,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {45422#true} assume true; {45422#true} is VALID [2022-02-20 19:54:57,234 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {45422#true} {45424#(= ~E_M~0 ~M_E~0)} #606#return; {45424#(= ~E_M~0 ~M_E~0)} is VALID [2022-02-20 19:54:57,235 INFO L272 TraceCheckUtils]: 33: Hoare triple {45424#(= ~E_M~0 ~M_E~0)} call reset_delta_events2(); {45458#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:54:57,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {45458#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {45461#(and (not (= |old(~M_E~0)| 1)) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {45461#(and (not (= |old(~M_E~0)| 1)) (= ~E_M~0 |old(~E_M~0)|))} assume !(1 == ~T1_E~0); {45461#(and (not (= |old(~M_E~0)| 1)) (= ~E_M~0 |old(~E_M~0)|))} is VALID [2022-02-20 19:54:57,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {45461#(and (not (= |old(~M_E~0)| 1)) (= ~E_M~0 |old(~E_M~0)|))} assume 1 == ~E_M~0;~E_M~0 := 2; {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume 1 == ~E_1~0;~E_1~0 := 2; {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,236 INFO L290 TraceCheckUtils]: 38: Hoare triple {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} assume true; {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:54:57,237 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45462#(not (= |old(~E_M~0)| |old(~M_E~0)|))} {45424#(= ~E_M~0 ~M_E~0)} #608#return; {45423#false} is VALID [2022-02-20 19:54:57,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {45423#false} assume !false; {45423#false} is VALID [2022-02-20 19:54:57,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {45423#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {45423#false} is VALID [2022-02-20 19:54:57,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {45423#false} assume !false; {45423#false} is VALID [2022-02-20 19:54:57,237 INFO L272 TraceCheckUtils]: 43: Hoare triple {45423#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {45422#true} is VALID [2022-02-20 19:54:57,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {45422#true} havoc ~__retres1~6; {45422#true} is VALID [2022-02-20 19:54:57,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {45422#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {45422#true} is VALID [2022-02-20 19:54:57,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {45422#true} #res := ~__retres1~6; {45422#true} is VALID [2022-02-20 19:54:57,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {45422#true} assume true; {45422#true} is VALID [2022-02-20 19:54:57,238 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {45422#true} {45423#false} #610#return; {45423#false} is VALID [2022-02-20 19:54:57,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {45423#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {45423#false} is VALID [2022-02-20 19:54:57,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {45423#false} assume 0 != eval2_~tmp~4#1; {45423#false} is VALID [2022-02-20 19:54:57,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {45423#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {45423#false} is VALID [2022-02-20 19:54:57,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {45423#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {45423#false} is VALID [2022-02-20 19:54:57,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {45423#false} assume !(0 == ~m_pc~0); {45423#false} is VALID [2022-02-20 19:54:57,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {45423#false} assume 1 == ~m_pc~0; {45423#false} is VALID [2022-02-20 19:54:57,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {45423#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {45423#false} is VALID [2022-02-20 19:54:57,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {45423#false} assume !false; {45423#false} is VALID [2022-02-20 19:54:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:54:57,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:57,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055375226] [2022-02-20 19:54:57,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055375226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:57,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:57,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:54:57,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705618169] [2022-02-20 19:54:57,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:57,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:57,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:57,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:57,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:57,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:54:57,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:54:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:54:57,268 INFO L87 Difference]: Start difference. First operand 1051 states and 1411 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:59,476 INFO L93 Difference]: Finished difference Result 2334 states and 3104 transitions. [2022-02-20 19:54:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 19:54:59,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:54:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:54:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 580 transitions. [2022-02-20 19:54:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:54:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 580 transitions. [2022-02-20 19:54:59,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 580 transitions. [2022-02-20 19:54:59,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 580 edges. 580 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:59,941 INFO L225 Difference]: With dead ends: 2334 [2022-02-20 19:54:59,941 INFO L226 Difference]: Without dead ends: 1657 [2022-02-20 19:54:59,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-02-20 19:54:59,943 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 493 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:54:59,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [504 Valid, 890 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:54:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-02-20 19:55:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1365. [2022-02-20 19:55:00,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:00,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1657 states. Second operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2022-02-20 19:55:00,175 INFO L74 IsIncluded]: Start isIncluded. First operand 1657 states. Second operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2022-02-20 19:55:00,176 INFO L87 Difference]: Start difference. First operand 1657 states. Second operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2022-02-20 19:55:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:00,262 INFO L93 Difference]: Finished difference Result 1657 states and 2190 transitions. [2022-02-20 19:55:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2190 transitions. [2022-02-20 19:55:00,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:00,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:00,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) Second operand 1657 states. [2022-02-20 19:55:00,267 INFO L87 Difference]: Start difference. First operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) Second operand 1657 states. [2022-02-20 19:55:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:00,358 INFO L93 Difference]: Finished difference Result 1657 states and 2190 transitions. [2022-02-20 19:55:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2190 transitions. [2022-02-20 19:55:00,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:00,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:00,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:00,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1131 states have (on average 1.3386383731211318) internal successors, (1514), 1148 states have internal predecessors, (1514), 137 states have call successors, (137), 84 states have call predecessors, (137), 95 states have return successors, (168), 136 states have call predecessors, (168), 135 states have call successors, (168) [2022-02-20 19:55:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1819 transitions. [2022-02-20 19:55:00,445 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1819 transitions. Word has length 57 [2022-02-20 19:55:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:00,445 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 1819 transitions. [2022-02-20 19:55:00,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1819 transitions. [2022-02-20 19:55:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:55:00,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:00,448 INFO L514 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] [2022-02-20 19:55:00,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 19:55:00,448 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:00,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:00,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1874416591, now seen corresponding path program 1 times [2022-02-20 19:55:00,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:00,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253474148] [2022-02-20 19:55:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:00,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {53846#true} assume true; {53846#true} is VALID [2022-02-20 19:55:00,479 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {53846#true} {53848#(= ~E_1~0 ~M_E~0)} #602#return; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:55:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:00,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {53882#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~T1_E~0); {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~E_M~0); {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~E_1~0); {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume true; {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,498 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} {53848#(= ~E_1~0 ~M_E~0)} #604#return; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:55:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:00,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {53884#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {53846#true} is VALID [2022-02-20 19:55:00,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {53846#true} assume !(1 == ~m_pc~0); {53846#true} is VALID [2022-02-20 19:55:00,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {53846#true} is_master_triggered_~__retres1~4#1 := 0; {53846#true} is VALID [2022-02-20 19:55:00,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {53846#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {53846#true} is VALID [2022-02-20 19:55:00,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {53846#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {53846#true} is VALID [2022-02-20 19:55:00,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {53846#true} assume !(0 != ~tmp~5#1); {53846#true} is VALID [2022-02-20 19:55:00,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {53846#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {53846#true} is VALID [2022-02-20 19:55:00,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {53846#true} assume !(1 == ~t1_pc~0); {53846#true} is VALID [2022-02-20 19:55:00,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {53846#true} is_transmit1_triggered_~__retres1~5#1 := 0; {53846#true} is VALID [2022-02-20 19:55:00,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {53846#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {53846#true} is VALID [2022-02-20 19:55:00,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {53846#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {53846#true} is VALID [2022-02-20 19:55:00,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {53846#true} assume !(0 != ~tmp___0~2#1); {53846#true} is VALID [2022-02-20 19:55:00,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {53846#true} assume true; {53846#true} is VALID [2022-02-20 19:55:00,508 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {53846#true} {53848#(= ~E_1~0 ~M_E~0)} #606#return; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:55:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:00,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {53882#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~T1_E~0); {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~E_M~0); {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~E_1~0;~E_1~0 := 2; {53886#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:00,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {53886#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {53886#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:00,525 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {53886#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {53848#(= ~E_1~0 ~M_E~0)} #608#return; {53847#false} is VALID [2022-02-20 19:55:00,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:55:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:00,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {53846#true} havoc ~__retres1~6; {53846#true} is VALID [2022-02-20 19:55:00,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {53846#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {53846#true} is VALID [2022-02-20 19:55:00,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {53846#true} #res := ~__retres1~6; {53846#true} is VALID [2022-02-20 19:55:00,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {53846#true} assume true; {53846#true} is VALID [2022-02-20 19:55:00,528 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53846#true} {53847#false} #610#return; {53847#false} is VALID [2022-02-20 19:55:00,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {53846#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} call update_channels2(); {53846#true} is VALID [2022-02-20 19:55:00,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {53846#true} assume true; {53846#true} is VALID [2022-02-20 19:55:00,530 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53846#true} {53848#(= ~E_1~0 ~M_E~0)} #602#return; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,532 INFO L272 TraceCheckUtils]: 11: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} call fire_delta_events2(); {53882#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {53882#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~T1_E~0); {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~E_M~0); {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~E_1~0); {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume true; {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,534 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {53883#(and (= ~M_E~0 |old(~M_E~0)|) (= ~E_1~0 |old(~E_1~0)|))} {53848#(= ~E_1~0 ~M_E~0)} #604#return; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,534 INFO L272 TraceCheckUtils]: 18: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} call activate_threads2(); {53884#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:00,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {53884#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {53846#true} is VALID [2022-02-20 19:55:00,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {53846#true} assume !(1 == ~m_pc~0); {53846#true} is VALID [2022-02-20 19:55:00,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {53846#true} is_master_triggered_~__retres1~4#1 := 0; {53846#true} is VALID [2022-02-20 19:55:00,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {53846#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {53846#true} is VALID [2022-02-20 19:55:00,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {53846#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {53846#true} is VALID [2022-02-20 19:55:00,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {53846#true} assume !(0 != ~tmp~5#1); {53846#true} is VALID [2022-02-20 19:55:00,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {53846#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {53846#true} is VALID [2022-02-20 19:55:00,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {53846#true} assume !(1 == ~t1_pc~0); {53846#true} is VALID [2022-02-20 19:55:00,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {53846#true} is_transmit1_triggered_~__retres1~5#1 := 0; {53846#true} is VALID [2022-02-20 19:55:00,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {53846#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {53846#true} is VALID [2022-02-20 19:55:00,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {53846#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {53846#true} is VALID [2022-02-20 19:55:00,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {53846#true} assume !(0 != ~tmp___0~2#1); {53846#true} is VALID [2022-02-20 19:55:00,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {53846#true} assume true; {53846#true} is VALID [2022-02-20 19:55:00,536 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {53846#true} {53848#(= ~E_1~0 ~M_E~0)} #606#return; {53848#(= ~E_1~0 ~M_E~0)} is VALID [2022-02-20 19:55:00,536 INFO L272 TraceCheckUtils]: 33: Hoare triple {53848#(= ~E_1~0 ~M_E~0)} call reset_delta_events2(); {53882#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {53882#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~T1_E~0); {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~E_M~0); {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:00,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {53885#(and (not (= |old(~M_E~0)| 1)) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~E_1~0;~E_1~0 := 2; {53886#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:00,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {53886#(not (= |old(~E_1~0)| |old(~M_E~0)|))} assume true; {53886#(not (= |old(~E_1~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:55:00,538 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {53886#(not (= |old(~E_1~0)| |old(~M_E~0)|))} {53848#(= ~E_1~0 ~M_E~0)} #608#return; {53847#false} is VALID [2022-02-20 19:55:00,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {53847#false} assume !false; {53847#false} is VALID [2022-02-20 19:55:00,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {53847#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {53847#false} is VALID [2022-02-20 19:55:00,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {53847#false} assume !false; {53847#false} is VALID [2022-02-20 19:55:00,539 INFO L272 TraceCheckUtils]: 43: Hoare triple {53847#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {53846#true} is VALID [2022-02-20 19:55:00,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {53846#true} havoc ~__retres1~6; {53846#true} is VALID [2022-02-20 19:55:00,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {53846#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {53846#true} is VALID [2022-02-20 19:55:00,539 INFO L290 TraceCheckUtils]: 46: Hoare triple {53846#true} #res := ~__retres1~6; {53846#true} is VALID [2022-02-20 19:55:00,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {53846#true} assume true; {53846#true} is VALID [2022-02-20 19:55:00,539 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {53846#true} {53847#false} #610#return; {53847#false} is VALID [2022-02-20 19:55:00,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {53847#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {53847#false} is VALID [2022-02-20 19:55:00,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {53847#false} assume 0 != eval2_~tmp~4#1; {53847#false} is VALID [2022-02-20 19:55:00,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {53847#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {53847#false} is VALID [2022-02-20 19:55:00,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {53847#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {53847#false} is VALID [2022-02-20 19:55:00,540 INFO L290 TraceCheckUtils]: 53: Hoare triple {53847#false} assume !(0 == ~m_pc~0); {53847#false} is VALID [2022-02-20 19:55:00,540 INFO L290 TraceCheckUtils]: 54: Hoare triple {53847#false} assume 1 == ~m_pc~0; {53847#false} is VALID [2022-02-20 19:55:00,540 INFO L290 TraceCheckUtils]: 55: Hoare triple {53847#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {53847#false} is VALID [2022-02-20 19:55:00,540 INFO L290 TraceCheckUtils]: 56: Hoare triple {53847#false} assume !false; {53847#false} is VALID [2022-02-20 19:55:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:55:00,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:00,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253474148] [2022-02-20 19:55:00,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253474148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:00,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:00,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:55:00,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548454502] [2022-02-20 19:55:00,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:00,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:55:00,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:00,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:00,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:00,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:55:00,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:55:00,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:55:00,570 INFO L87 Difference]: Start difference. First operand 1365 states and 1819 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:02,673 INFO L93 Difference]: Finished difference Result 2334 states and 3094 transitions. [2022-02-20 19:55:02,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 19:55:02,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-02-20 19:55:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 563 transitions. [2022-02-20 19:55:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 563 transitions. [2022-02-20 19:55:02,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 563 transitions. [2022-02-20 19:55:03,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 563 edges. 563 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:03,174 INFO L225 Difference]: With dead ends: 2334 [2022-02-20 19:55:03,174 INFO L226 Difference]: Without dead ends: 1633 [2022-02-20 19:55:03,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-02-20 19:55:03,176 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 479 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:03,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 877 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:55:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-02-20 19:55:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1355. [2022-02-20 19:55:03,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:03,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1633 states. Second operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2022-02-20 19:55:03,428 INFO L74 IsIncluded]: Start isIncluded. First operand 1633 states. Second operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2022-02-20 19:55:03,429 INFO L87 Difference]: Start difference. First operand 1633 states. Second operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2022-02-20 19:55:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:03,513 INFO L93 Difference]: Finished difference Result 1633 states and 2149 transitions. [2022-02-20 19:55:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2149 transitions. [2022-02-20 19:55:03,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:03,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:03,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) Second operand 1633 states. [2022-02-20 19:55:03,519 INFO L87 Difference]: Start difference. First operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) Second operand 1633 states. [2022-02-20 19:55:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:03,628 INFO L93 Difference]: Finished difference Result 1633 states and 2149 transitions. [2022-02-20 19:55:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2149 transitions. [2022-02-20 19:55:03,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:03,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:03,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:03,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1125 states have (on average 1.3351111111111111) internal successors, (1502), 1138 states have internal predecessors, (1502), 137 states have call successors, (137), 84 states have call predecessors, (137), 91 states have return successors, (158), 134 states have call predecessors, (158), 135 states have call successors, (158) [2022-02-20 19:55:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1797 transitions. [2022-02-20 19:55:03,723 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1797 transitions. Word has length 57 [2022-02-20 19:55:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:03,723 INFO L470 AbstractCegarLoop]: Abstraction has 1355 states and 1797 transitions. [2022-02-20 19:55:03,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:55:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1797 transitions. [2022-02-20 19:55:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-20 19:55:03,724 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:03,724 INFO L514 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] [2022-02-20 19:55:03,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 19:55:03,725 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:03,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1056768141, now seen corresponding path program 1 times [2022-02-20 19:55:03,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:03,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431837512] [2022-02-20 19:55:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:03,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:03,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,753 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #602#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:55:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:03,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {62249#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {62213#true} is VALID [2022-02-20 19:55:03,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {62213#true} assume !(0 == ~T1_E~0); {62213#true} is VALID [2022-02-20 19:55:03,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {62213#true} assume !(0 == ~E_M~0); {62213#true} is VALID [2022-02-20 19:55:03,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {62213#true} assume !(0 == ~E_1~0); {62213#true} is VALID [2022-02-20 19:55:03,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,762 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #604#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:55:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:03,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {62250#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {62213#true} is VALID [2022-02-20 19:55:03,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {62213#true} assume !(1 == ~m_pc~0); {62213#true} is VALID [2022-02-20 19:55:03,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {62213#true} is_master_triggered_~__retres1~4#1 := 0; {62213#true} is VALID [2022-02-20 19:55:03,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {62213#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {62213#true} is VALID [2022-02-20 19:55:03,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {62213#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {62213#true} is VALID [2022-02-20 19:55:03,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {62213#true} assume !(0 != ~tmp~5#1); {62213#true} is VALID [2022-02-20 19:55:03,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {62213#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {62213#true} is VALID [2022-02-20 19:55:03,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {62213#true} assume !(1 == ~t1_pc~0); {62213#true} is VALID [2022-02-20 19:55:03,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {62213#true} is_transmit1_triggered_~__retres1~5#1 := 0; {62213#true} is VALID [2022-02-20 19:55:03,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {62213#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {62213#true} is VALID [2022-02-20 19:55:03,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {62213#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {62213#true} is VALID [2022-02-20 19:55:03,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {62213#true} assume !(0 != ~tmp___0~2#1); {62213#true} is VALID [2022-02-20 19:55:03,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,773 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #606#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:55:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:03,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {62249#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {62213#true} is VALID [2022-02-20 19:55:03,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {62213#true} assume !(1 == ~T1_E~0); {62213#true} is VALID [2022-02-20 19:55:03,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {62213#true} assume !(1 == ~E_M~0); {62213#true} is VALID [2022-02-20 19:55:03,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {62213#true} assume !(1 == ~E_1~0); {62213#true} is VALID [2022-02-20 19:55:03,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,776 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #608#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:55:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:03,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {62213#true} havoc ~__retres1~6; {62213#true} is VALID [2022-02-20 19:55:03,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {62213#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {62213#true} is VALID [2022-02-20 19:55:03,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {62213#true} #res := ~__retres1~6; {62213#true} is VALID [2022-02-20 19:55:03,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,779 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #610#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {62213#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {62215#(= ~m_pc~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {62215#(= ~m_pc~0 0)} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {62215#(= ~m_pc~0 0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {62215#(= ~m_pc~0 0)} call update_channels2(); {62213#true} is VALID [2022-02-20 19:55:03,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,781 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #602#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {62215#(= ~m_pc~0 0)} assume { :begin_inline_init_threads2 } true; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {62215#(= ~m_pc~0 0)} assume 1 == ~m_i~0;~m_st~0 := 0; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {62215#(= ~m_pc~0 0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {62215#(= ~m_pc~0 0)} assume { :end_inline_init_threads2 } true; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,782 INFO L272 TraceCheckUtils]: 11: Hoare triple {62215#(= ~m_pc~0 0)} call fire_delta_events2(); {62249#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:03,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {62249#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {62213#true} is VALID [2022-02-20 19:55:03,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {62213#true} assume !(0 == ~T1_E~0); {62213#true} is VALID [2022-02-20 19:55:03,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {62213#true} assume !(0 == ~E_M~0); {62213#true} is VALID [2022-02-20 19:55:03,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {62213#true} assume !(0 == ~E_1~0); {62213#true} is VALID [2022-02-20 19:55:03,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,784 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #604#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,784 INFO L272 TraceCheckUtils]: 18: Hoare triple {62215#(= ~m_pc~0 0)} call activate_threads2(); {62250#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:03,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {62250#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {62213#true} is VALID [2022-02-20 19:55:03,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {62213#true} assume !(1 == ~m_pc~0); {62213#true} is VALID [2022-02-20 19:55:03,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {62213#true} is_master_triggered_~__retres1~4#1 := 0; {62213#true} is VALID [2022-02-20 19:55:03,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {62213#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {62213#true} is VALID [2022-02-20 19:55:03,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {62213#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {62213#true} is VALID [2022-02-20 19:55:03,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {62213#true} assume !(0 != ~tmp~5#1); {62213#true} is VALID [2022-02-20 19:55:03,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {62213#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {62213#true} is VALID [2022-02-20 19:55:03,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {62213#true} assume !(1 == ~t1_pc~0); {62213#true} is VALID [2022-02-20 19:55:03,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {62213#true} is_transmit1_triggered_~__retres1~5#1 := 0; {62213#true} is VALID [2022-02-20 19:55:03,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {62213#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {62213#true} is VALID [2022-02-20 19:55:03,785 INFO L290 TraceCheckUtils]: 29: Hoare triple {62213#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {62213#true} is VALID [2022-02-20 19:55:03,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {62213#true} assume !(0 != ~tmp___0~2#1); {62213#true} is VALID [2022-02-20 19:55:03,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,786 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #606#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,786 INFO L272 TraceCheckUtils]: 33: Hoare triple {62215#(= ~m_pc~0 0)} call reset_delta_events2(); {62249#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:03,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {62249#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {62213#true} is VALID [2022-02-20 19:55:03,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {62213#true} assume !(1 == ~T1_E~0); {62213#true} is VALID [2022-02-20 19:55:03,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {62213#true} assume !(1 == ~E_M~0); {62213#true} is VALID [2022-02-20 19:55:03,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {62213#true} assume !(1 == ~E_1~0); {62213#true} is VALID [2022-02-20 19:55:03,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,787 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #608#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,787 INFO L290 TraceCheckUtils]: 40: Hoare triple {62215#(= ~m_pc~0 0)} assume !false; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {62215#(= ~m_pc~0 0)} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {62215#(= ~m_pc~0 0)} assume !false; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,788 INFO L272 TraceCheckUtils]: 43: Hoare triple {62215#(= ~m_pc~0 0)} call eval2_#t~ret18#1 := exists_runnable_thread2(); {62213#true} is VALID [2022-02-20 19:55:03,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {62213#true} havoc ~__retres1~6; {62213#true} is VALID [2022-02-20 19:55:03,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {62213#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {62213#true} is VALID [2022-02-20 19:55:03,788 INFO L290 TraceCheckUtils]: 46: Hoare triple {62213#true} #res := ~__retres1~6; {62213#true} is VALID [2022-02-20 19:55:03,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {62213#true} assume true; {62213#true} is VALID [2022-02-20 19:55:03,789 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {62213#true} {62215#(= ~m_pc~0 0)} #610#return; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {62215#(= ~m_pc~0 0)} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {62215#(= ~m_pc~0 0)} assume 0 != eval2_~tmp~4#1; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {62215#(= ~m_pc~0 0)} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,790 INFO L290 TraceCheckUtils]: 52: Hoare triple {62215#(= ~m_pc~0 0)} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {62215#(= ~m_pc~0 0)} is VALID [2022-02-20 19:55:03,790 INFO L290 TraceCheckUtils]: 53: Hoare triple {62215#(= ~m_pc~0 0)} assume !(0 == ~m_pc~0); {62214#false} is VALID [2022-02-20 19:55:03,790 INFO L290 TraceCheckUtils]: 54: Hoare triple {62214#false} assume 1 == ~m_pc~0; {62214#false} is VALID [2022-02-20 19:55:03,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {62214#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {62214#false} is VALID [2022-02-20 19:55:03,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {62214#false} assume !false; {62214#false} is VALID [2022-02-20 19:55:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:55:03,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:03,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431837512] [2022-02-20 19:55:03,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431837512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:03,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:03,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:55:03,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762142244] [2022-02-20 19:55:03,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:03,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-02-20 19:55:03,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:03,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 19:55:03,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:03,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:55:03,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:03,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:55:03,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:55:03,819 INFO L87 Difference]: Start difference. First operand 1355 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 19:55:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:05,410 INFO L93 Difference]: Finished difference Result 2962 states and 3933 transitions. [2022-02-20 19:55:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:55:05,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2022-02-20 19:55:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 19:55:05,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 547 transitions. [2022-02-20 19:55:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 19:55:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 547 transitions. [2022-02-20 19:55:05,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 547 transitions. [2022-02-20 19:55:05,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:05,901 INFO L225 Difference]: With dead ends: 2962 [2022-02-20 19:55:05,901 INFO L226 Difference]: Without dead ends: 1977 [2022-02-20 19:55:05,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:55:05,904 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 443 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:05,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 499 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:55:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2022-02-20 19:55:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1759. [2022-02-20 19:55:06,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:06,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1977 states. Second operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2022-02-20 19:55:06,310 INFO L74 IsIncluded]: Start isIncluded. First operand 1977 states. Second operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2022-02-20 19:55:06,311 INFO L87 Difference]: Start difference. First operand 1977 states. Second operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2022-02-20 19:55:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:06,432 INFO L93 Difference]: Finished difference Result 1977 states and 2589 transitions. [2022-02-20 19:55:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2589 transitions. [2022-02-20 19:55:06,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:06,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:06,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) Second operand 1977 states. [2022-02-20 19:55:06,439 INFO L87 Difference]: Start difference. First operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) Second operand 1977 states. [2022-02-20 19:55:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:06,556 INFO L93 Difference]: Finished difference Result 1977 states and 2589 transitions. [2022-02-20 19:55:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2589 transitions. [2022-02-20 19:55:06,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:06,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:06,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:06,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1470 states have internal predecessors, (1908), 185 states have call successors, (185), 116 states have call predecessors, (185), 125 states have return successors, (208), 174 states have call predecessors, (208), 183 states have call successors, (208) [2022-02-20 19:55:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2301 transitions. [2022-02-20 19:55:06,705 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2301 transitions. Word has length 57 [2022-02-20 19:55:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:06,705 INFO L470 AbstractCegarLoop]: Abstraction has 1759 states and 2301 transitions. [2022-02-20 19:55:06,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 19:55:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2301 transitions. [2022-02-20 19:55:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 19:55:06,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:06,708 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 19:55:06,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 19:55:06,709 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:06,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2041766118, now seen corresponding path program 1 times [2022-02-20 19:55:06,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:06,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818770305] [2022-02-20 19:55:06,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:06,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:55:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {72657#true} havoc ~__retres1~2; {72657#true} is VALID [2022-02-20 19:55:06,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {72657#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {72657#true} is VALID [2022-02-20 19:55:06,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {72657#true} #res := ~__retres1~2; {72657#true} is VALID [2022-02-20 19:55:06,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {72657#true} assume true; {72657#true} is VALID [2022-02-20 19:55:06,736 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {72657#true} {72657#true} #590#return; {72657#true} is VALID [2022-02-20 19:55:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 19:55:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {72657#true} havoc ~__retres1~2; {72657#true} is VALID [2022-02-20 19:55:06,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {72657#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {72657#true} is VALID [2022-02-20 19:55:06,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {72657#true} #res := ~__retres1~2; {72657#true} is VALID [2022-02-20 19:55:06,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {72657#true} assume true; {72657#true} is VALID [2022-02-20 19:55:06,741 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {72657#true} {72664#(= ~c_dr_st~0 2)} #590#return; {72664#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:55:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:55:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:06,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {72684#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {72657#true} is VALID [2022-02-20 19:55:06,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {72657#true} assume 1 == ~p_dw_pc~0; {72657#true} is VALID [2022-02-20 19:55:06,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {72657#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {72657#true} is VALID [2022-02-20 19:55:06,750 INFO L290 TraceCheckUtils]: 3: Hoare triple {72657#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {72657#true} is VALID [2022-02-20 19:55:06,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {72657#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {72657#true} is VALID [2022-02-20 19:55:06,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {72657#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {72657#true} is VALID [2022-02-20 19:55:06,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {72657#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {72657#true} is VALID [2022-02-20 19:55:06,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {72657#true} assume !(1 == ~c_dr_pc~0); {72657#true} is VALID [2022-02-20 19:55:06,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {72657#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {72657#true} is VALID [2022-02-20 19:55:06,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {72657#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {72657#true} is VALID [2022-02-20 19:55:06,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {72657#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {72657#true} is VALID [2022-02-20 19:55:06,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {72657#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {72657#true} is VALID [2022-02-20 19:55:06,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {72657#true} assume true; {72657#true} is VALID [2022-02-20 19:55:06,752 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {72657#true} {72658#false} #594#return; {72658#false} is VALID [2022-02-20 19:55:06,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {72657#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {72657#true} is VALID [2022-02-20 19:55:06,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {72657#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {72657#true} is VALID [2022-02-20 19:55:06,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {72657#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {72657#true} is VALID [2022-02-20 19:55:06,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {72657#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {72657#true} is VALID [2022-02-20 19:55:06,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {72657#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {72657#true} is VALID [2022-02-20 19:55:06,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {72657#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {72657#true} is VALID [2022-02-20 19:55:06,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {72657#true} assume { :end_inline_init_threads1 } true; {72657#true} is VALID [2022-02-20 19:55:06,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {72657#true} assume !false; {72657#true} is VALID [2022-02-20 19:55:06,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {72657#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {72657#true} is VALID [2022-02-20 19:55:06,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {72657#true} assume !false; {72657#true} is VALID [2022-02-20 19:55:06,753 INFO L272 TraceCheckUtils]: 10: Hoare triple {72657#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {72657#true} is VALID [2022-02-20 19:55:06,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {72657#true} havoc ~__retres1~2; {72657#true} is VALID [2022-02-20 19:55:06,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {72657#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {72657#true} is VALID [2022-02-20 19:55:06,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {72657#true} #res := ~__retres1~2; {72657#true} is VALID [2022-02-20 19:55:06,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {72657#true} assume true; {72657#true} is VALID [2022-02-20 19:55:06,754 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {72657#true} {72657#true} #590#return; {72657#true} is VALID [2022-02-20 19:55:06,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {72657#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {72657#true} is VALID [2022-02-20 19:55:06,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {72657#true} assume 0 != eval1_~tmp___1~0#1; {72657#true} is VALID [2022-02-20 19:55:06,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {72657#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {72657#true} is VALID [2022-02-20 19:55:06,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {72657#true} assume !(0 != eval1_~tmp~1#1); {72657#true} is VALID [2022-02-20 19:55:06,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {72657#true} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {72657#true} is VALID [2022-02-20 19:55:06,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {72657#true} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {72657#true} is VALID [2022-02-20 19:55:06,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {72657#true} assume 0 == ~c_dr_pc~0; {72657#true} is VALID [2022-02-20 19:55:06,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {72657#true} assume !false; {72657#true} is VALID [2022-02-20 19:55:06,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {72657#true} assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0#1; {72664#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:55:06,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {72664#(= ~c_dr_st~0 2)} assume { :end_inline_do_read_c } true; {72664#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:55:06,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {72664#(= ~c_dr_st~0 2)} assume !false; {72664#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:55:06,755 INFO L272 TraceCheckUtils]: 27: Hoare triple {72664#(= ~c_dr_st~0 2)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {72657#true} is VALID [2022-02-20 19:55:06,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {72657#true} havoc ~__retres1~2; {72657#true} is VALID [2022-02-20 19:55:06,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {72657#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {72657#true} is VALID [2022-02-20 19:55:06,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {72657#true} #res := ~__retres1~2; {72657#true} is VALID [2022-02-20 19:55:06,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {72657#true} assume true; {72657#true} is VALID [2022-02-20 19:55:06,756 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {72657#true} {72664#(= ~c_dr_st~0 2)} #590#return; {72664#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:55:06,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {72664#(= ~c_dr_st~0 2)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {72664#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:55:06,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {72664#(= ~c_dr_st~0 2)} assume 0 != eval1_~tmp___1~0#1; {72664#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:55:06,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {72664#(= ~c_dr_st~0 2)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {72664#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:55:06,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {72664#(= ~c_dr_st~0 2)} assume !(0 != eval1_~tmp~1#1); {72664#(= ~c_dr_st~0 2)} is VALID [2022-02-20 19:55:06,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {72664#(= ~c_dr_st~0 2)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {72658#false} is VALID [2022-02-20 19:55:06,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {72658#false} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {72658#false} is VALID [2022-02-20 19:55:06,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {72658#false} assume !(0 == ~c_dr_pc~0); {72658#false} is VALID [2022-02-20 19:55:06,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {72658#false} assume 1 == ~c_dr_pc~0; {72658#false} is VALID [2022-02-20 19:55:06,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {72658#false} do_read_c_~a~0#1 := ~a_t~0; {72658#false} is VALID [2022-02-20 19:55:06,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {72658#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {72658#false} is VALID [2022-02-20 19:55:06,758 INFO L272 TraceCheckUtils]: 43: Hoare triple {72658#false} call immediate_notify_threads(); {72684#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:06,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {72684#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {72657#true} is VALID [2022-02-20 19:55:06,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {72657#true} assume 1 == ~p_dw_pc~0; {72657#true} is VALID [2022-02-20 19:55:06,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {72657#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {72657#true} is VALID [2022-02-20 19:55:06,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {72657#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {72657#true} is VALID [2022-02-20 19:55:06,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {72657#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {72657#true} is VALID [2022-02-20 19:55:06,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {72657#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {72657#true} is VALID [2022-02-20 19:55:06,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {72657#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {72657#true} is VALID [2022-02-20 19:55:06,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {72657#true} assume !(1 == ~c_dr_pc~0); {72657#true} is VALID [2022-02-20 19:55:06,759 INFO L290 TraceCheckUtils]: 52: Hoare triple {72657#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {72657#true} is VALID [2022-02-20 19:55:06,759 INFO L290 TraceCheckUtils]: 53: Hoare triple {72657#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {72657#true} is VALID [2022-02-20 19:55:06,759 INFO L290 TraceCheckUtils]: 54: Hoare triple {72657#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {72657#true} is VALID [2022-02-20 19:55:06,760 INFO L290 TraceCheckUtils]: 55: Hoare triple {72657#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {72657#true} is VALID [2022-02-20 19:55:06,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {72657#true} assume true; {72657#true} is VALID [2022-02-20 19:55:06,760 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {72657#true} {72658#false} #594#return; {72658#false} is VALID [2022-02-20 19:55:06,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {72658#false} ~q_read_ev~0 := 2; {72658#false} is VALID [2022-02-20 19:55:06,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {72658#false} assume !(~p_last_write~0 == ~c_last_read~0); {72658#false} is VALID [2022-02-20 19:55:06,760 INFO L272 TraceCheckUtils]: 60: Hoare triple {72658#false} call error1(); {72658#false} is VALID [2022-02-20 19:55:06,760 INFO L290 TraceCheckUtils]: 61: Hoare triple {72658#false} assume !false; {72658#false} is VALID [2022-02-20 19:55:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 19:55:06,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:06,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818770305] [2022-02-20 19:55:06,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818770305] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:06,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:06,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:55:06,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145735389] [2022-02-20 19:55:06,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:06,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-02-20 19:55:06,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:06,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:06,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:06,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:55:06,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:06,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:55:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:55:06,788 INFO L87 Difference]: Start difference. First operand 1759 states and 2301 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:07,788 INFO L93 Difference]: Finished difference Result 2343 states and 3086 transitions. [2022-02-20 19:55:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:55:07,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-02-20 19:55:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2022-02-20 19:55:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2022-02-20 19:55:07,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 413 transitions. [2022-02-20 19:55:08,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:08,173 INFO L225 Difference]: With dead ends: 2343 [2022-02-20 19:55:08,173 INFO L226 Difference]: Without dead ends: 1987 [2022-02-20 19:55:08,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:55:08,174 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 132 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:08,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 620 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:55:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2022-02-20 19:55:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1949. [2022-02-20 19:55:08,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:08,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1987 states. Second operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2022-02-20 19:55:08,616 INFO L74 IsIncluded]: Start isIncluded. First operand 1987 states. Second operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2022-02-20 19:55:08,618 INFO L87 Difference]: Start difference. First operand 1987 states. Second operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2022-02-20 19:55:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:08,739 INFO L93 Difference]: Finished difference Result 1987 states and 2585 transitions. [2022-02-20 19:55:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2585 transitions. [2022-02-20 19:55:08,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:08,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:08,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) Second operand 1987 states. [2022-02-20 19:55:08,745 INFO L87 Difference]: Start difference. First operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) Second operand 1987 states. [2022-02-20 19:55:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:08,867 INFO L93 Difference]: Finished difference Result 1987 states and 2585 transitions. [2022-02-20 19:55:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2585 transitions. [2022-02-20 19:55:08,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:08,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:08,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:08,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1613 states have (on average 1.3068815871047736) internal successors, (2108), 1638 states have internal predecessors, (2108), 199 states have call successors, (199), 124 states have call predecessors, (199), 135 states have return successors, (232), 188 states have call predecessors, (232), 197 states have call successors, (232) [2022-02-20 19:55:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2539 transitions. [2022-02-20 19:55:09,045 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2539 transitions. Word has length 62 [2022-02-20 19:55:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:09,046 INFO L470 AbstractCegarLoop]: Abstraction has 1949 states and 2539 transitions. [2022-02-20 19:55:09,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2539 transitions. [2022-02-20 19:55:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 19:55:09,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:09,047 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 19:55:09,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 19:55:09,048 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2064164623, now seen corresponding path program 1 times [2022-02-20 19:55:09,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:09,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338679493] [2022-02-20 19:55:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:09,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:55:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:09,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {82577#true} havoc ~__retres1~2; {82577#true} is VALID [2022-02-20 19:55:09,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {82577#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {82577#true} is VALID [2022-02-20 19:55:09,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {82577#true} #res := ~__retres1~2; {82577#true} is VALID [2022-02-20 19:55:09,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {82577#true} assume true; {82577#true} is VALID [2022-02-20 19:55:09,083 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {82577#true} {82579#(= ~p_dw_pc~0 0)} #590#return; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 19:55:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:09,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {82613#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {82577#true} is VALID [2022-02-20 19:55:09,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {82577#true} assume 1 == ~p_dw_pc~0; {82577#true} is VALID [2022-02-20 19:55:09,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {82577#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {82577#true} is VALID [2022-02-20 19:55:09,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {82577#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {82577#true} is VALID [2022-02-20 19:55:09,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {82577#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {82577#true} is VALID [2022-02-20 19:55:09,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {82577#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {82577#true} is VALID [2022-02-20 19:55:09,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {82577#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {82577#true} is VALID [2022-02-20 19:55:09,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {82577#true} assume !(1 == ~c_dr_pc~0); {82577#true} is VALID [2022-02-20 19:55:09,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {82577#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {82577#true} is VALID [2022-02-20 19:55:09,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {82577#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {82577#true} is VALID [2022-02-20 19:55:09,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {82577#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {82577#true} is VALID [2022-02-20 19:55:09,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {82577#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {82577#true} is VALID [2022-02-20 19:55:09,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {82577#true} assume true; {82577#true} is VALID [2022-02-20 19:55:09,092 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {82577#true} {82578#false} #592#return; {82578#false} is VALID [2022-02-20 19:55:09,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:55:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:09,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {82613#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {82577#true} is VALID [2022-02-20 19:55:09,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {82577#true} assume 1 == ~p_dw_pc~0; {82577#true} is VALID [2022-02-20 19:55:09,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {82577#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {82577#true} is VALID [2022-02-20 19:55:09,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {82577#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {82577#true} is VALID [2022-02-20 19:55:09,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {82577#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {82577#true} is VALID [2022-02-20 19:55:09,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {82577#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {82577#true} is VALID [2022-02-20 19:55:09,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {82577#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {82577#true} is VALID [2022-02-20 19:55:09,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {82577#true} assume !(1 == ~c_dr_pc~0); {82577#true} is VALID [2022-02-20 19:55:09,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {82577#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {82577#true} is VALID [2022-02-20 19:55:09,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {82577#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {82577#true} is VALID [2022-02-20 19:55:09,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {82577#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {82577#true} is VALID [2022-02-20 19:55:09,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {82577#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {82577#true} is VALID [2022-02-20 19:55:09,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {82577#true} assume true; {82577#true} is VALID [2022-02-20 19:55:09,098 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {82577#true} {82578#false} #594#return; {82578#false} is VALID [2022-02-20 19:55:09,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {82577#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {82577#true} is VALID [2022-02-20 19:55:09,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {82577#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {82577#true} is VALID [2022-02-20 19:55:09,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {82577#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume !false; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {82579#(= ~p_dw_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume !false; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,101 INFO L272 TraceCheckUtils]: 10: Hoare triple {82579#(= ~p_dw_pc~0 0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {82577#true} is VALID [2022-02-20 19:55:09,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {82577#true} havoc ~__retres1~2; {82577#true} is VALID [2022-02-20 19:55:09,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {82577#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {82577#true} is VALID [2022-02-20 19:55:09,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {82577#true} #res := ~__retres1~2; {82577#true} is VALID [2022-02-20 19:55:09,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {82577#true} assume true; {82577#true} is VALID [2022-02-20 19:55:09,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {82577#true} {82579#(= ~p_dw_pc~0 0)} #590#return; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {82579#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:55:09,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {82579#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {82578#false} is VALID [2022-02-20 19:55:09,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {82578#false} assume 1 == ~p_dw_pc~0; {82578#false} is VALID [2022-02-20 19:55:09,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {82578#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {82578#false} is VALID [2022-02-20 19:55:09,103 INFO L272 TraceCheckUtils]: 23: Hoare triple {82578#false} call immediate_notify_threads(); {82613#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:09,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {82613#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {82577#true} is VALID [2022-02-20 19:55:09,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {82577#true} assume 1 == ~p_dw_pc~0; {82577#true} is VALID [2022-02-20 19:55:09,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {82577#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {82577#true} is VALID [2022-02-20 19:55:09,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {82577#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {82577#true} is VALID [2022-02-20 19:55:09,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {82577#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {82577#true} is VALID [2022-02-20 19:55:09,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {82577#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {82577#true} is VALID [2022-02-20 19:55:09,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {82577#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {82577#true} is VALID [2022-02-20 19:55:09,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {82577#true} assume !(1 == ~c_dr_pc~0); {82577#true} is VALID [2022-02-20 19:55:09,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {82577#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {82577#true} is VALID [2022-02-20 19:55:09,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {82577#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {82577#true} is VALID [2022-02-20 19:55:09,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {82577#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {82577#true} is VALID [2022-02-20 19:55:09,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {82577#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {82577#true} is VALID [2022-02-20 19:55:09,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {82577#true} assume true; {82577#true} is VALID [2022-02-20 19:55:09,105 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {82577#true} {82578#false} #592#return; {82578#false} is VALID [2022-02-20 19:55:09,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {82578#false} ~q_write_ev~0 := 2; {82578#false} is VALID [2022-02-20 19:55:09,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {82578#false} assume !false; {82578#false} is VALID [2022-02-20 19:55:09,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {82578#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {82578#false} is VALID [2022-02-20 19:55:09,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {82578#false} assume { :end_inline_do_write_p } true; {82578#false} is VALID [2022-02-20 19:55:09,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {82578#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {82578#false} is VALID [2022-02-20 19:55:09,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {82578#false} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {82578#false} is VALID [2022-02-20 19:55:09,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {82578#false} assume 0 == ~c_dr_pc~0; {82578#false} is VALID [2022-02-20 19:55:09,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {82578#false} assume !false; {82578#false} is VALID [2022-02-20 19:55:09,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {82578#false} assume !(1 == ~q_free~0); {82578#false} is VALID [2022-02-20 19:55:09,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {82578#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {82578#false} is VALID [2022-02-20 19:55:09,106 INFO L272 TraceCheckUtils]: 48: Hoare triple {82578#false} call immediate_notify_threads(); {82613#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:09,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {82613#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {82577#true} is VALID [2022-02-20 19:55:09,106 INFO L290 TraceCheckUtils]: 50: Hoare triple {82577#true} assume 1 == ~p_dw_pc~0; {82577#true} is VALID [2022-02-20 19:55:09,106 INFO L290 TraceCheckUtils]: 51: Hoare triple {82577#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {82577#true} is VALID [2022-02-20 19:55:09,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {82577#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {82577#true} is VALID [2022-02-20 19:55:09,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {82577#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {82577#true} is VALID [2022-02-20 19:55:09,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {82577#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {82577#true} is VALID [2022-02-20 19:55:09,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {82577#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {82577#true} is VALID [2022-02-20 19:55:09,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {82577#true} assume !(1 == ~c_dr_pc~0); {82577#true} is VALID [2022-02-20 19:55:09,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {82577#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {82577#true} is VALID [2022-02-20 19:55:09,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {82577#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {82577#true} is VALID [2022-02-20 19:55:09,107 INFO L290 TraceCheckUtils]: 59: Hoare triple {82577#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {82577#true} is VALID [2022-02-20 19:55:09,107 INFO L290 TraceCheckUtils]: 60: Hoare triple {82577#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {82577#true} is VALID [2022-02-20 19:55:09,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {82577#true} assume true; {82577#true} is VALID [2022-02-20 19:55:09,108 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {82577#true} {82578#false} #594#return; {82578#false} is VALID [2022-02-20 19:55:09,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {82578#false} ~q_read_ev~0 := 2; {82578#false} is VALID [2022-02-20 19:55:09,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {82578#false} assume !(~p_last_write~0 == ~c_last_read~0); {82578#false} is VALID [2022-02-20 19:55:09,108 INFO L272 TraceCheckUtils]: 65: Hoare triple {82578#false} call error1(); {82578#false} is VALID [2022-02-20 19:55:09,108 INFO L290 TraceCheckUtils]: 66: Hoare triple {82578#false} assume !false; {82578#false} is VALID [2022-02-20 19:55:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 19:55:09,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:09,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338679493] [2022-02-20 19:55:09,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338679493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:09,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:09,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 19:55:09,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150181367] [2022-02-20 19:55:09,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:09,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-02-20 19:55:09,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:09,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:55:09,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:09,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:55:09,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:55:09,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:55:09,147 INFO L87 Difference]: Start difference. First operand 1949 states and 2539 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:55:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:10,152 INFO L93 Difference]: Finished difference Result 2602 states and 3392 transitions. [2022-02-20 19:55:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:55:10,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-02-20 19:55:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:55:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 411 transitions. [2022-02-20 19:55:10,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:55:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 411 transitions. [2022-02-20 19:55:10,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 411 transitions. [2022-02-20 19:55:10,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:10,566 INFO L225 Difference]: With dead ends: 2602 [2022-02-20 19:55:10,566 INFO L226 Difference]: Without dead ends: 2148 [2022-02-20 19:55:10,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:55:10,567 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 279 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:10,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 457 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 19:55:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-02-20 19:55:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2093. [2022-02-20 19:55:10,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:10,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2148 states. Second operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-02-20 19:55:10,953 INFO L74 IsIncluded]: Start isIncluded. First operand 2148 states. Second operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-02-20 19:55:10,955 INFO L87 Difference]: Start difference. First operand 2148 states. Second operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-02-20 19:55:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:11,102 INFO L93 Difference]: Finished difference Result 2148 states and 2779 transitions. [2022-02-20 19:55:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2779 transitions. [2022-02-20 19:55:11,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:11,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:11,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) Second operand 2148 states. [2022-02-20 19:55:11,108 INFO L87 Difference]: Start difference. First operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) Second operand 2148 states. [2022-02-20 19:55:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:11,242 INFO L93 Difference]: Finished difference Result 2148 states and 2779 transitions. [2022-02-20 19:55:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 2779 transitions. [2022-02-20 19:55:11,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:11,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:11,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:11,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1741 states have (on average 1.2975301550832854) internal successors, (2259), 1768 states have internal predecessors, (2259), 207 states have call successors, (207), 130 states have call predecessors, (207), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-02-20 19:55:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2712 transitions. [2022-02-20 19:55:11,461 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2712 transitions. Word has length 67 [2022-02-20 19:55:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:11,461 INFO L470 AbstractCegarLoop]: Abstraction has 2093 states and 2712 transitions. [2022-02-20 19:55:11,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 19:55:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2712 transitions. [2022-02-20 19:55:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 19:55:11,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:11,463 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 19:55:11,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 19:55:11,463 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1473250423, now seen corresponding path program 1 times [2022-02-20 19:55:11,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:11,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683071997] [2022-02-20 19:55:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:55:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:11,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {93394#true} havoc ~__retres1~2; {93394#true} is VALID [2022-02-20 19:55:11,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {93394#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {93394#true} is VALID [2022-02-20 19:55:11,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {93394#true} #res := ~__retres1~2; {93394#true} is VALID [2022-02-20 19:55:11,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {93394#true} assume true; {93394#true} is VALID [2022-02-20 19:55:11,483 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {93394#true} {93394#true} #590#return; {93394#true} is VALID [2022-02-20 19:55:11,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:11,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {93429#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {93394#true} assume !(1 == ~p_dw_pc~0); {93394#true} is VALID [2022-02-20 19:55:11,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {93394#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {93430#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:55:11,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {93430#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {93431#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:55:11,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {93431#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {93432#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:55:11,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {93432#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {93395#false} is VALID [2022-02-20 19:55:11,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {93395#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {93395#false} is VALID [2022-02-20 19:55:11,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {93395#false} assume !(1 == ~c_dr_pc~0); {93395#false} is VALID [2022-02-20 19:55:11,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {93395#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {93395#false} is VALID [2022-02-20 19:55:11,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {93395#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {93395#false} is VALID [2022-02-20 19:55:11,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {93395#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {93395#false} is VALID [2022-02-20 19:55:11,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {93395#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {93395#false} is VALID [2022-02-20 19:55:11,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {93395#false} assume true; {93395#false} is VALID [2022-02-20 19:55:11,522 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {93395#false} {93394#true} #592#return; {93395#false} is VALID [2022-02-20 19:55:11,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:55:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:11,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {93429#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {93394#true} assume 1 == ~p_dw_pc~0; {93394#true} is VALID [2022-02-20 19:55:11,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {93394#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {93394#true} is VALID [2022-02-20 19:55:11,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {93394#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {93394#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {93394#true} is VALID [2022-02-20 19:55:11,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {93394#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {93394#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {93394#true} is VALID [2022-02-20 19:55:11,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {93394#true} assume !(1 == ~c_dr_pc~0); {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {93394#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {93394#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {93394#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {93394#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {93394#true} assume true; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {93394#true} {93395#false} #594#return; {93395#false} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {93394#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {93394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {93394#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {93394#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {93394#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {93394#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {93394#true} assume { :end_inline_init_threads1 } true; {93394#true} is VALID [2022-02-20 19:55:11,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {93394#true} assume !false; {93394#true} is VALID [2022-02-20 19:55:11,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {93394#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {93394#true} assume !false; {93394#true} is VALID [2022-02-20 19:55:11,539 INFO L272 TraceCheckUtils]: 10: Hoare triple {93394#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {93394#true} is VALID [2022-02-20 19:55:11,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {93394#true} havoc ~__retres1~2; {93394#true} is VALID [2022-02-20 19:55:11,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {93394#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {93394#true} is VALID [2022-02-20 19:55:11,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {93394#true} #res := ~__retres1~2; {93394#true} is VALID [2022-02-20 19:55:11,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {93394#true} assume true; {93394#true} is VALID [2022-02-20 19:55:11,539 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {93394#true} {93394#true} #590#return; {93394#true} is VALID [2022-02-20 19:55:11,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {93394#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {93394#true} is VALID [2022-02-20 19:55:11,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {93394#true} assume 0 != eval1_~tmp___1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {93394#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {93394#true} is VALID [2022-02-20 19:55:11,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {93394#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {93394#true} is VALID [2022-02-20 19:55:11,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {93394#true} assume 0 == ~p_dw_pc~0; {93394#true} is VALID [2022-02-20 19:55:11,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {93394#true} assume !false; {93394#true} is VALID [2022-02-20 19:55:11,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {93394#true} assume !(0 == ~q_free~0); {93394#true} is VALID [2022-02-20 19:55:11,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {93394#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {93394#true} is VALID [2022-02-20 19:55:11,541 INFO L272 TraceCheckUtils]: 24: Hoare triple {93394#true} call immediate_notify_threads(); {93429#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:11,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {93429#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {93394#true} assume !(1 == ~p_dw_pc~0); {93394#true} is VALID [2022-02-20 19:55:11,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {93394#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {93430#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:55:11,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {93430#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {93431#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:55:11,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {93431#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {93432#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:55:11,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {93432#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {93395#false} is VALID [2022-02-20 19:55:11,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {93395#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {93395#false} is VALID [2022-02-20 19:55:11,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {93395#false} assume !(1 == ~c_dr_pc~0); {93395#false} is VALID [2022-02-20 19:55:11,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {93395#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {93395#false} is VALID [2022-02-20 19:55:11,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {93395#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {93395#false} is VALID [2022-02-20 19:55:11,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {93395#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {93395#false} is VALID [2022-02-20 19:55:11,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {93395#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {93395#false} is VALID [2022-02-20 19:55:11,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {93395#false} assume true; {93395#false} is VALID [2022-02-20 19:55:11,544 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {93395#false} {93394#true} #592#return; {93395#false} is VALID [2022-02-20 19:55:11,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {93395#false} ~q_write_ev~0 := 2; {93395#false} is VALID [2022-02-20 19:55:11,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {93395#false} assume !false; {93395#false} is VALID [2022-02-20 19:55:11,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {93395#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {93395#false} is VALID [2022-02-20 19:55:11,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {93395#false} assume { :end_inline_do_write_p } true; {93395#false} is VALID [2022-02-20 19:55:11,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {93395#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {93395#false} is VALID [2022-02-20 19:55:11,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {93395#false} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {93395#false} is VALID [2022-02-20 19:55:11,544 INFO L290 TraceCheckUtils]: 45: Hoare triple {93395#false} assume 0 == ~c_dr_pc~0; {93395#false} is VALID [2022-02-20 19:55:11,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {93395#false} assume !false; {93395#false} is VALID [2022-02-20 19:55:11,545 INFO L290 TraceCheckUtils]: 47: Hoare triple {93395#false} assume !(1 == ~q_free~0); {93395#false} is VALID [2022-02-20 19:55:11,545 INFO L290 TraceCheckUtils]: 48: Hoare triple {93395#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {93395#false} is VALID [2022-02-20 19:55:11,545 INFO L272 TraceCheckUtils]: 49: Hoare triple {93395#false} call immediate_notify_threads(); {93429#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:11,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {93429#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,545 INFO L290 TraceCheckUtils]: 51: Hoare triple {93394#true} assume 1 == ~p_dw_pc~0; {93394#true} is VALID [2022-02-20 19:55:11,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {93394#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {93394#true} is VALID [2022-02-20 19:55:11,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {93394#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {93394#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {93394#true} is VALID [2022-02-20 19:55:11,546 INFO L290 TraceCheckUtils]: 55: Hoare triple {93394#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,546 INFO L290 TraceCheckUtils]: 56: Hoare triple {93394#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {93394#true} is VALID [2022-02-20 19:55:11,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {93394#true} assume !(1 == ~c_dr_pc~0); {93394#true} is VALID [2022-02-20 19:55:11,546 INFO L290 TraceCheckUtils]: 58: Hoare triple {93394#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {93394#true} is VALID [2022-02-20 19:55:11,546 INFO L290 TraceCheckUtils]: 59: Hoare triple {93394#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {93394#true} is VALID [2022-02-20 19:55:11,546 INFO L290 TraceCheckUtils]: 60: Hoare triple {93394#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {93394#true} is VALID [2022-02-20 19:55:11,546 INFO L290 TraceCheckUtils]: 61: Hoare triple {93394#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,546 INFO L290 TraceCheckUtils]: 62: Hoare triple {93394#true} assume true; {93394#true} is VALID [2022-02-20 19:55:11,547 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {93394#true} {93395#false} #594#return; {93395#false} is VALID [2022-02-20 19:55:11,547 INFO L290 TraceCheckUtils]: 64: Hoare triple {93395#false} ~q_read_ev~0 := 2; {93395#false} is VALID [2022-02-20 19:55:11,547 INFO L290 TraceCheckUtils]: 65: Hoare triple {93395#false} assume !(~p_last_write~0 == ~c_last_read~0); {93395#false} is VALID [2022-02-20 19:55:11,547 INFO L272 TraceCheckUtils]: 66: Hoare triple {93395#false} call error1(); {93395#false} is VALID [2022-02-20 19:55:11,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {93395#false} assume !false; {93395#false} is VALID [2022-02-20 19:55:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 19:55:11,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:11,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683071997] [2022-02-20 19:55:11,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683071997] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:55:11,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915440440] [2022-02-20 19:55:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:11,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:55:11,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:55:11,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:55:11,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:55:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:11,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:55:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:11,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:55:11,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {93394#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {93394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {93394#true} is VALID [2022-02-20 19:55:11,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {93394#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {93394#true} is VALID [2022-02-20 19:55:11,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {93394#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {93394#true} is VALID [2022-02-20 19:55:11,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {93394#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {93394#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {93394#true} assume { :end_inline_init_threads1 } true; {93394#true} is VALID [2022-02-20 19:55:11,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {93394#true} assume !false; {93394#true} is VALID [2022-02-20 19:55:11,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {93394#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {93394#true} assume !false; {93394#true} is VALID [2022-02-20 19:55:11,846 INFO L272 TraceCheckUtils]: 10: Hoare triple {93394#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {93394#true} is VALID [2022-02-20 19:55:11,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {93394#true} havoc ~__retres1~2; {93394#true} is VALID [2022-02-20 19:55:11,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {93394#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {93394#true} is VALID [2022-02-20 19:55:11,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {93394#true} #res := ~__retres1~2; {93394#true} is VALID [2022-02-20 19:55:11,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {93394#true} assume true; {93394#true} is VALID [2022-02-20 19:55:11,847 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {93394#true} {93394#true} #590#return; {93394#true} is VALID [2022-02-20 19:55:11,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {93394#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {93394#true} is VALID [2022-02-20 19:55:11,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {93394#true} assume 0 != eval1_~tmp___1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {93394#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {93394#true} is VALID [2022-02-20 19:55:11,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {93394#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {93394#true} is VALID [2022-02-20 19:55:11,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {93394#true} assume 0 == ~p_dw_pc~0; {93394#true} is VALID [2022-02-20 19:55:11,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {93394#true} assume !false; {93394#true} is VALID [2022-02-20 19:55:11,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {93394#true} assume !(0 == ~q_free~0); {93394#true} is VALID [2022-02-20 19:55:11,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {93394#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,849 INFO L272 TraceCheckUtils]: 24: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} call immediate_notify_threads(); {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~p_dw_pc~0); {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} is_do_write_p_triggered_~__retres1~0#1 := 0; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,850 INFO L290 TraceCheckUtils]: 29: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,851 INFO L290 TraceCheckUtils]: 32: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~c_dr_pc~0); {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} is_do_read_c_triggered_~__retres1~1#1 := 0; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume true; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,853 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {93505#(= ~p_last_write~0 ~q_buf_0~0)} {93505#(= ~p_last_write~0 ~q_buf_0~0)} #592#return; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} ~q_write_ev~0 := 2; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,855 INFO L290 TraceCheckUtils]: 43: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,857 INFO L272 TraceCheckUtils]: 49: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} call immediate_notify_threads(); {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,857 INFO L290 TraceCheckUtils]: 50: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} assume 1 == ~p_dw_pc~0; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,859 INFO L290 TraceCheckUtils]: 54: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,860 INFO L290 TraceCheckUtils]: 57: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} assume !(1 == ~c_dr_pc~0); {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} is_do_read_c_triggered_~__retres1~1#1 := 0; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,860 INFO L290 TraceCheckUtils]: 59: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,861 INFO L290 TraceCheckUtils]: 60: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} assume true; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,862 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {93581#(= ~c_last_read~0 ~p_last_write~0)} {93581#(= ~c_last_read~0 ~p_last_write~0)} #594#return; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} ~q_read_ev~0 := 2; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {93395#false} is VALID [2022-02-20 19:55:11,862 INFO L272 TraceCheckUtils]: 66: Hoare triple {93395#false} call error1(); {93395#false} is VALID [2022-02-20 19:55:11,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {93395#false} assume !false; {93395#false} is VALID [2022-02-20 19:55:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:55:11,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:55:11,974 INFO L290 TraceCheckUtils]: 67: Hoare triple {93395#false} assume !false; {93395#false} is VALID [2022-02-20 19:55:11,974 INFO L272 TraceCheckUtils]: 66: Hoare triple {93395#false} call error1(); {93395#false} is VALID [2022-02-20 19:55:11,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {93395#false} is VALID [2022-02-20 19:55:11,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} ~q_read_ev~0 := 2; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,975 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {93394#true} {93581#(= ~c_last_read~0 ~p_last_write~0)} #594#return; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {93394#true} assume true; {93394#true} is VALID [2022-02-20 19:55:11,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {93394#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {93394#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {93394#true} is VALID [2022-02-20 19:55:11,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {93394#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {93394#true} is VALID [2022-02-20 19:55:11,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {93394#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {93394#true} is VALID [2022-02-20 19:55:11,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {93394#true} assume !(1 == ~c_dr_pc~0); {93394#true} is VALID [2022-02-20 19:55:11,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {93394#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {93394#true} is VALID [2022-02-20 19:55:11,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {93394#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {93394#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {93394#true} is VALID [2022-02-20 19:55:11,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {93394#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {93394#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {93394#true} is VALID [2022-02-20 19:55:11,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {93394#true} assume 1 == ~p_dw_pc~0; {93394#true} is VALID [2022-02-20 19:55:11,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {93394#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,977 INFO L272 TraceCheckUtils]: 49: Hoare triple {93581#(= ~c_last_read~0 ~p_last_write~0)} call immediate_notify_threads(); {93394#true} is VALID [2022-02-20 19:55:11,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {93581#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:55:11,978 INFO L290 TraceCheckUtils]: 47: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,978 INFO L290 TraceCheckUtils]: 46: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} ~q_write_ev~0 := 2; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,981 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {93394#true} {93505#(= ~p_last_write~0 ~q_buf_0~0)} #592#return; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {93394#true} assume true; {93394#true} is VALID [2022-02-20 19:55:11,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {93394#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {93394#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {93394#true} is VALID [2022-02-20 19:55:11,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {93394#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {93394#true} is VALID [2022-02-20 19:55:11,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {93394#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {93394#true} is VALID [2022-02-20 19:55:11,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {93394#true} assume !(1 == ~c_dr_pc~0); {93394#true} is VALID [2022-02-20 19:55:11,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {93394#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {93394#true} is VALID [2022-02-20 19:55:11,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {93394#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {93394#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {93394#true} is VALID [2022-02-20 19:55:11,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {93394#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {93394#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {93394#true} is VALID [2022-02-20 19:55:11,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {93394#true} assume !(1 == ~p_dw_pc~0); {93394#true} is VALID [2022-02-20 19:55:11,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {93394#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,982 INFO L272 TraceCheckUtils]: 24: Hoare triple {93505#(= ~p_last_write~0 ~q_buf_0~0)} call immediate_notify_threads(); {93394#true} is VALID [2022-02-20 19:55:11,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {93394#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {93505#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:55:11,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {93394#true} assume !(0 == ~q_free~0); {93394#true} is VALID [2022-02-20 19:55:11,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {93394#true} assume !false; {93394#true} is VALID [2022-02-20 19:55:11,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {93394#true} assume 0 == ~p_dw_pc~0; {93394#true} is VALID [2022-02-20 19:55:11,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {93394#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {93394#true} is VALID [2022-02-20 19:55:11,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {93394#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {93394#true} is VALID [2022-02-20 19:55:11,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {93394#true} assume 0 != eval1_~tmp___1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {93394#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {93394#true} is VALID [2022-02-20 19:55:11,984 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {93394#true} {93394#true} #590#return; {93394#true} is VALID [2022-02-20 19:55:11,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {93394#true} assume true; {93394#true} is VALID [2022-02-20 19:55:11,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {93394#true} #res := ~__retres1~2; {93394#true} is VALID [2022-02-20 19:55:11,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {93394#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {93394#true} is VALID [2022-02-20 19:55:11,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {93394#true} havoc ~__retres1~2; {93394#true} is VALID [2022-02-20 19:55:11,984 INFO L272 TraceCheckUtils]: 10: Hoare triple {93394#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {93394#true} is VALID [2022-02-20 19:55:11,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {93394#true} assume !false; {93394#true} is VALID [2022-02-20 19:55:11,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {93394#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {93394#true} is VALID [2022-02-20 19:55:11,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {93394#true} assume !false; {93394#true} is VALID [2022-02-20 19:55:11,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {93394#true} assume { :end_inline_init_threads1 } true; {93394#true} is VALID [2022-02-20 19:55:11,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {93394#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {93394#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {93394#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {93394#true} is VALID [2022-02-20 19:55:11,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {93394#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {93394#true} is VALID [2022-02-20 19:55:11,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {93394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {93394#true} is VALID [2022-02-20 19:55:11,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {93394#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {93394#true} is VALID [2022-02-20 19:55:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 19:55:11,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915440440] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 19:55:11,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:55:11,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-02-20 19:55:11,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121554091] [2022-02-20 19:55:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:11,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-02-20 19:55:11,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:11,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:12,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:12,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:55:12,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:12,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:55:12,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:55:12,014 INFO L87 Difference]: Start difference. First operand 2093 states and 2712 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:12,849 INFO L93 Difference]: Finished difference Result 2149 states and 2780 transitions. [2022-02-20 19:55:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:55:12,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-02-20 19:55:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 301 transitions. [2022-02-20 19:55:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 301 transitions. [2022-02-20 19:55:12,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 301 transitions. [2022-02-20 19:55:13,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:13,208 INFO L225 Difference]: With dead ends: 2149 [2022-02-20 19:55:13,208 INFO L226 Difference]: Without dead ends: 2146 [2022-02-20 19:55:13,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:55:13,209 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 399 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:13,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 328 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:55:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2022-02-20 19:55:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2092. [2022-02-20 19:55:13,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:13,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2146 states. Second operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-02-20 19:55:13,609 INFO L74 IsIncluded]: Start isIncluded. First operand 2146 states. Second operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-02-20 19:55:13,610 INFO L87 Difference]: Start difference. First operand 2146 states. Second operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-02-20 19:55:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:13,749 INFO L93 Difference]: Finished difference Result 2146 states and 2776 transitions. [2022-02-20 19:55:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2776 transitions. [2022-02-20 19:55:13,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:13,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:13,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) Second operand 2146 states. [2022-02-20 19:55:13,757 INFO L87 Difference]: Start difference. First operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) Second operand 2146 states. [2022-02-20 19:55:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:13,900 INFO L93 Difference]: Finished difference Result 2146 states and 2776 transitions. [2022-02-20 19:55:13,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2776 transitions. [2022-02-20 19:55:13,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:13,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:13,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:13,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1741 states have (on average 1.296381390005744) internal successors, (2257), 1767 states have internal predecessors, (2257), 206 states have call successors, (206), 130 states have call predecessors, (206), 143 states have return successors, (246), 196 states have call predecessors, (246), 205 states have call successors, (246) [2022-02-20 19:55:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2709 transitions. [2022-02-20 19:55:14,110 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2709 transitions. Word has length 68 [2022-02-20 19:55:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:14,110 INFO L470 AbstractCegarLoop]: Abstraction has 2092 states and 2709 transitions. [2022-02-20 19:55:14,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:55:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2709 transitions. [2022-02-20 19:55:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-20 19:55:14,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:14,111 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 19:55:14,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 19:55:14,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-20 19:55:14,330 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:14,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1574463180, now seen corresponding path program 1 times [2022-02-20 19:55:14,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:14,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418589415] [2022-02-20 19:55:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:55:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:14,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {103999#true} havoc ~__retres1~2; {103999#true} is VALID [2022-02-20 19:55:14,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {103999#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {103999#true} is VALID [2022-02-20 19:55:14,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {103999#true} #res := ~__retres1~2; {103999#true} is VALID [2022-02-20 19:55:14,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {103999#true} assume true; {103999#true} is VALID [2022-02-20 19:55:14,358 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {103999#true} {103999#true} #590#return; {103999#true} is VALID [2022-02-20 19:55:14,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:14,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {104034#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:14,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {103999#true} assume !(1 == ~p_dw_pc~0); {103999#true} is VALID [2022-02-20 19:55:14,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {103999#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {104035#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:55:14,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {104035#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {104036#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:55:14,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {104036#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {104037#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:55:14,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {104037#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {104000#false} is VALID [2022-02-20 19:55:14,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {104000#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {104000#false} is VALID [2022-02-20 19:55:14,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {104000#false} assume !(1 == ~c_dr_pc~0); {104000#false} is VALID [2022-02-20 19:55:14,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {104000#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {104000#false} is VALID [2022-02-20 19:55:14,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {104000#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {104000#false} is VALID [2022-02-20 19:55:14,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {104000#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {104000#false} is VALID [2022-02-20 19:55:14,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {104000#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {104000#false} is VALID [2022-02-20 19:55:14,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {104000#false} assume true; {104000#false} is VALID [2022-02-20 19:55:14,394 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {104000#false} {103999#true} #592#return; {104000#false} is VALID [2022-02-20 19:55:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:55:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:14,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {104034#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:14,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {103999#true} assume 1 == ~p_dw_pc~0; {103999#true} is VALID [2022-02-20 19:55:14,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {103999#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {103999#true} is VALID [2022-02-20 19:55:14,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {103999#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:14,408 INFO L290 TraceCheckUtils]: 4: Hoare triple {103999#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {103999#true} is VALID [2022-02-20 19:55:14,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {103999#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:14,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {103999#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {103999#true} is VALID [2022-02-20 19:55:14,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {103999#true} assume !(1 == ~c_dr_pc~0); {103999#true} is VALID [2022-02-20 19:55:14,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {103999#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {103999#true} is VALID [2022-02-20 19:55:14,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {103999#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {103999#true} is VALID [2022-02-20 19:55:14,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {103999#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {103999#true} is VALID [2022-02-20 19:55:14,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {103999#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:14,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {103999#true} assume true; {103999#true} is VALID [2022-02-20 19:55:14,409 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {103999#true} {104000#false} #594#return; {104000#false} is VALID [2022-02-20 19:55:14,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {103999#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {103999#true} is VALID [2022-02-20 19:55:14,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {103999#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {103999#true} is VALID [2022-02-20 19:55:14,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {103999#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {103999#true} is VALID [2022-02-20 19:55:14,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {103999#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {103999#true} is VALID [2022-02-20 19:55:14,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {103999#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:14,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {103999#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:14,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {103999#true} assume { :end_inline_init_threads1 } true; {103999#true} is VALID [2022-02-20 19:55:14,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {103999#true} assume !false; {103999#true} is VALID [2022-02-20 19:55:14,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {103999#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {103999#true} is VALID [2022-02-20 19:55:14,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {103999#true} assume !false; {103999#true} is VALID [2022-02-20 19:55:14,411 INFO L272 TraceCheckUtils]: 10: Hoare triple {103999#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {103999#true} is VALID [2022-02-20 19:55:14,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {103999#true} havoc ~__retres1~2; {103999#true} is VALID [2022-02-20 19:55:14,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {103999#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {103999#true} is VALID [2022-02-20 19:55:14,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {103999#true} #res := ~__retres1~2; {103999#true} is VALID [2022-02-20 19:55:14,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {103999#true} assume true; {103999#true} is VALID [2022-02-20 19:55:14,411 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {103999#true} {103999#true} #590#return; {103999#true} is VALID [2022-02-20 19:55:14,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {103999#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {103999#true} is VALID [2022-02-20 19:55:14,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {103999#true} assume 0 != eval1_~tmp___1~0#1; {103999#true} is VALID [2022-02-20 19:55:14,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {103999#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {103999#true} is VALID [2022-02-20 19:55:14,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {103999#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {103999#true} is VALID [2022-02-20 19:55:14,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {103999#true} assume 0 == ~p_dw_pc~0; {103999#true} is VALID [2022-02-20 19:55:14,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {103999#true} assume !false; {103999#true} is VALID [2022-02-20 19:55:14,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {103999#true} assume !(0 == ~q_free~0); {103999#true} is VALID [2022-02-20 19:55:14,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {103999#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {103999#true} is VALID [2022-02-20 19:55:14,413 INFO L272 TraceCheckUtils]: 24: Hoare triple {103999#true} call immediate_notify_threads(); {104034#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:14,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {104034#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:14,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {103999#true} assume !(1 == ~p_dw_pc~0); {103999#true} is VALID [2022-02-20 19:55:14,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {103999#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {104035#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is VALID [2022-02-20 19:55:14,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {104035#(and (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {104036#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} is VALID [2022-02-20 19:55:14,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {104036#(and (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {104037#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} is VALID [2022-02-20 19:55:14,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {104037#(and (<= |immediate_notify_threads_~tmp~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1)))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {104000#false} is VALID [2022-02-20 19:55:14,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {104000#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {104000#false} is VALID [2022-02-20 19:55:14,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {104000#false} assume !(1 == ~c_dr_pc~0); {104000#false} is VALID [2022-02-20 19:55:14,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {104000#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {104000#false} is VALID [2022-02-20 19:55:14,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {104000#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {104000#false} is VALID [2022-02-20 19:55:14,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {104000#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {104000#false} is VALID [2022-02-20 19:55:14,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {104000#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {104000#false} is VALID [2022-02-20 19:55:14,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {104000#false} assume true; {104000#false} is VALID [2022-02-20 19:55:14,415 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {104000#false} {103999#true} #592#return; {104000#false} is VALID [2022-02-20 19:55:14,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {104000#false} ~q_write_ev~0 := 2; {104000#false} is VALID [2022-02-20 19:55:14,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {104000#false} assume !false; {104000#false} is VALID [2022-02-20 19:55:14,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {104000#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {104000#false} is VALID [2022-02-20 19:55:14,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {104000#false} assume { :end_inline_do_write_p } true; {104000#false} is VALID [2022-02-20 19:55:14,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {104000#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {104000#false} is VALID [2022-02-20 19:55:14,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {104000#false} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {104000#false} is VALID [2022-02-20 19:55:14,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {104000#false} assume 0 == ~c_dr_pc~0; {104000#false} is VALID [2022-02-20 19:55:14,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {104000#false} assume !false; {104000#false} is VALID [2022-02-20 19:55:14,416 INFO L290 TraceCheckUtils]: 47: Hoare triple {104000#false} assume !(1 == ~q_free~0); {104000#false} is VALID [2022-02-20 19:55:14,416 INFO L290 TraceCheckUtils]: 48: Hoare triple {104000#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {104000#false} is VALID [2022-02-20 19:55:14,417 INFO L272 TraceCheckUtils]: 49: Hoare triple {104000#false} call immediate_notify_threads(); {104034#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:14,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {104034#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:14,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {103999#true} assume 1 == ~p_dw_pc~0; {103999#true} is VALID [2022-02-20 19:55:14,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {103999#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {103999#true} is VALID [2022-02-20 19:55:14,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {103999#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:14,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {103999#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {103999#true} is VALID [2022-02-20 19:55:14,417 INFO L290 TraceCheckUtils]: 55: Hoare triple {103999#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:14,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {103999#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {103999#true} is VALID [2022-02-20 19:55:14,418 INFO L290 TraceCheckUtils]: 57: Hoare triple {103999#true} assume !(1 == ~c_dr_pc~0); {103999#true} is VALID [2022-02-20 19:55:14,418 INFO L290 TraceCheckUtils]: 58: Hoare triple {103999#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {103999#true} is VALID [2022-02-20 19:55:14,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {103999#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {103999#true} is VALID [2022-02-20 19:55:14,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {103999#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {103999#true} is VALID [2022-02-20 19:55:14,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {103999#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:14,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {103999#true} assume true; {103999#true} is VALID [2022-02-20 19:55:14,418 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {103999#true} {104000#false} #594#return; {104000#false} is VALID [2022-02-20 19:55:14,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {104000#false} ~q_read_ev~0 := 2; {104000#false} is VALID [2022-02-20 19:55:14,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {104000#false} assume ~p_last_write~0 == ~c_last_read~0; {104000#false} is VALID [2022-02-20 19:55:14,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {104000#false} assume !(~p_num_write~0 == ~c_num_read~0); {104000#false} is VALID [2022-02-20 19:55:14,419 INFO L272 TraceCheckUtils]: 67: Hoare triple {104000#false} call error1(); {104000#false} is VALID [2022-02-20 19:55:14,419 INFO L290 TraceCheckUtils]: 68: Hoare triple {104000#false} assume !false; {104000#false} is VALID [2022-02-20 19:55:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 19:55:14,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:14,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418589415] [2022-02-20 19:55:14,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418589415] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:55:14,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957892171] [2022-02-20 19:55:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:14,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:55:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:55:14,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:55:14,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 19:55:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:14,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:55:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:14,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:55:14,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {103999#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {103999#true} is VALID [2022-02-20 19:55:14,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {103999#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {103999#true} is VALID [2022-02-20 19:55:14,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {103999#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,881 INFO L272 TraceCheckUtils]: 10: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret8#1 := exists_runnable_thread1(); {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,882 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #590#return; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:55:14,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {104047#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,885 INFO L272 TraceCheckUtils]: 24: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} call immediate_notify_threads(); {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~p_dw_pc~0); {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_~__retres1~0#1 := 0; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~c_dr_pc~0); {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_~__retres1~1#1 := 0; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume true; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,894 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} #592#return; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} ~q_write_ev~0 := 2; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !false; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume { :end_inline_do_write_p } true; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume 0 == ~c_dr_pc~0; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !false; {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} assume !(1 == ~q_free~0); {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {104111#(and (= ~c_num_read~0 0) (= ~p_num_write~0 1))} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,898 INFO L272 TraceCheckUtils]: 49: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} call immediate_notify_threads(); {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 1 == ~p_dw_pc~0; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,899 INFO L290 TraceCheckUtils]: 52: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,899 INFO L290 TraceCheckUtils]: 53: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,900 INFO L290 TraceCheckUtils]: 55: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,900 INFO L290 TraceCheckUtils]: 56: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume !(1 == ~c_dr_pc~0); {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_~__retres1~1#1 := 0; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,901 INFO L290 TraceCheckUtils]: 59: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,902 INFO L290 TraceCheckUtils]: 61: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume true; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,903 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} #594#return; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} ~q_read_ev~0 := 2; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,910 INFO L290 TraceCheckUtils]: 65: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume ~p_last_write~0 == ~c_last_read~0; {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} is VALID [2022-02-20 19:55:14,911 INFO L290 TraceCheckUtils]: 66: Hoare triple {104187#(and (= (+ (- 1) ~c_num_read~0) 0) (= ~p_num_write~0 1))} assume !(~p_num_write~0 == ~c_num_read~0); {104000#false} is VALID [2022-02-20 19:55:14,911 INFO L272 TraceCheckUtils]: 67: Hoare triple {104000#false} call error1(); {104000#false} is VALID [2022-02-20 19:55:14,911 INFO L290 TraceCheckUtils]: 68: Hoare triple {104000#false} assume !false; {104000#false} is VALID [2022-02-20 19:55:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:55:14,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:55:15,081 INFO L290 TraceCheckUtils]: 68: Hoare triple {104000#false} assume !false; {104000#false} is VALID [2022-02-20 19:55:15,081 INFO L272 TraceCheckUtils]: 67: Hoare triple {104000#false} call error1(); {104000#false} is VALID [2022-02-20 19:55:15,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume !(~p_num_write~0 == ~c_num_read~0); {104000#false} is VALID [2022-02-20 19:55:15,082 INFO L290 TraceCheckUtils]: 65: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume ~p_last_write~0 == ~c_last_read~0; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,082 INFO L290 TraceCheckUtils]: 64: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} ~q_read_ev~0 := 2; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,082 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {103999#true} {104254#(= ~c_num_read~0 ~p_num_write~0)} #594#return; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 62: Hoare triple {103999#true} assume true; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {103999#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {103999#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 59: Hoare triple {103999#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 58: Hoare triple {103999#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 57: Hoare triple {103999#true} assume !(1 == ~c_dr_pc~0); {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {103999#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 55: Hoare triple {103999#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {103999#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {103999#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {103999#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 51: Hoare triple {103999#true} assume 1 == ~p_dw_pc~0; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L290 TraceCheckUtils]: 50: Hoare triple {103999#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:15,083 INFO L272 TraceCheckUtils]: 49: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} call immediate_notify_threads(); {103999#true} is VALID [2022-02-20 19:55:15,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !(1 == ~q_free~0); {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !false; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~c_dr_pc~0; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume { :end_inline_do_write_p } true; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} assume !false; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} ~q_write_ev~0 := 2; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,089 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {103999#true} {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} #592#return; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {103999#true} assume true; {103999#true} is VALID [2022-02-20 19:55:15,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {103999#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:15,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {103999#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {103999#true} is VALID [2022-02-20 19:55:15,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {103999#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {103999#true} is VALID [2022-02-20 19:55:15,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {103999#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {103999#true} is VALID [2022-02-20 19:55:15,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {103999#true} assume !(1 == ~c_dr_pc~0); {103999#true} is VALID [2022-02-20 19:55:15,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {103999#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {103999#true} is VALID [2022-02-20 19:55:15,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {103999#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {103999#true} is VALID [2022-02-20 19:55:15,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {103999#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {103999#true} is VALID [2022-02-20 19:55:15,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {103999#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:15,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {103999#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {103999#true} is VALID [2022-02-20 19:55:15,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {103999#true} assume !(1 == ~p_dw_pc~0); {103999#true} is VALID [2022-02-20 19:55:15,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {103999#true} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {103999#true} is VALID [2022-02-20 19:55:15,090 INFO L272 TraceCheckUtils]: 24: Hoare triple {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} call immediate_notify_threads(); {103999#true} is VALID [2022-02-20 19:55:15,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {104309#(= (+ ~c_num_read~0 1) ~p_num_write~0)} is VALID [2022-02-20 19:55:15,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume !(0 == ~q_free~0); {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume 0 == ~p_dw_pc~0; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume 0 != eval1_~tmp___1~0#1; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,093 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {103999#true} {104254#(= ~c_num_read~0 ~p_num_write~0)} #590#return; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {103999#true} assume true; {103999#true} is VALID [2022-02-20 19:55:15,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {103999#true} #res := ~__retres1~2; {103999#true} is VALID [2022-02-20 19:55:15,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {103999#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {103999#true} is VALID [2022-02-20 19:55:15,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {103999#true} havoc ~__retres1~2; {103999#true} is VALID [2022-02-20 19:55:15,093 INFO L272 TraceCheckUtils]: 10: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} call eval1_#t~ret8#1 := exists_runnable_thread1(); {103999#true} is VALID [2022-02-20 19:55:15,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume !false; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume { :end_inline_init_threads1 } true; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,095 INFO L290 TraceCheckUtils]: 4: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {104254#(= ~c_num_read~0 ~p_num_write~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {103999#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {104254#(= ~c_num_read~0 ~p_num_write~0)} is VALID [2022-02-20 19:55:15,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {103999#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {103999#true} is VALID [2022-02-20 19:55:15,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {103999#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {103999#true} is VALID [2022-02-20 19:55:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 19:55:15,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957892171] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:55:15,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:55:15,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-02-20 19:55:15,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890987258] [2022-02-20 19:55:15,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:55:15,097 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-02-20 19:55:15,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:15,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:15,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:15,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 19:55:15,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:15,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 19:55:15,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:55:15,185 INFO L87 Difference]: Start difference. First operand 2092 states and 2709 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:18,687 INFO L93 Difference]: Finished difference Result 3792 states and 4929 transitions. [2022-02-20 19:55:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-02-20 19:55:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-02-20 19:55:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 774 transitions. [2022-02-20 19:55:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 774 transitions. [2022-02-20 19:55:18,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 774 transitions. [2022-02-20 19:55:19,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 774 edges. 774 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:19,600 INFO L225 Difference]: With dead ends: 3792 [2022-02-20 19:55:19,600 INFO L226 Difference]: Without dead ends: 3248 [2022-02-20 19:55:19,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-02-20 19:55:19,602 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 814 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:19,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [836 Valid, 1961 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:55:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2022-02-20 19:55:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2481. [2022-02-20 19:55:20,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:20,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3248 states. Second operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2022-02-20 19:55:20,213 INFO L74 IsIncluded]: Start isIncluded. First operand 3248 states. Second operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2022-02-20 19:55:20,214 INFO L87 Difference]: Start difference. First operand 3248 states. Second operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2022-02-20 19:55:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:20,559 INFO L93 Difference]: Finished difference Result 3248 states and 4155 transitions. [2022-02-20 19:55:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4155 transitions. [2022-02-20 19:55:20,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:20,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:20,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) Second operand 3248 states. [2022-02-20 19:55:20,566 INFO L87 Difference]: Start difference. First operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) Second operand 3248 states. [2022-02-20 19:55:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:20,900 INFO L93 Difference]: Finished difference Result 3248 states and 4155 transitions. [2022-02-20 19:55:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4155 transitions. [2022-02-20 19:55:20,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:20,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:20,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:20,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2091 states have (on average 1.2869440459110473) internal successors, (2691), 2125 states have internal predecessors, (2691), 226 states have call successors, (226), 144 states have call predecessors, (226), 162 states have return successors, (280), 213 states have call predecessors, (280), 225 states have call successors, (280) [2022-02-20 19:55:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3197 transitions. [2022-02-20 19:55:21,186 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3197 transitions. Word has length 69 [2022-02-20 19:55:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:21,187 INFO L470 AbstractCegarLoop]: Abstraction has 2481 states and 3197 transitions. [2022-02-20 19:55:21,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 19:55:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3197 transitions. [2022-02-20 19:55:21,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 19:55:21,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:21,189 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-02-20 19:55:21,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:55:21,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-20 19:55:21,391 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:21,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:21,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1815627380, now seen corresponding path program 1 times [2022-02-20 19:55:21,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:21,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921137706] [2022-02-20 19:55:21,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:21,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:21,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:55:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:21,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {119676#true} havoc ~__retres1~2; {119676#true} is VALID [2022-02-20 19:55:21,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {119676#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119676#true} is VALID [2022-02-20 19:55:21,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {119676#true} #res := ~__retres1~2; {119676#true} is VALID [2022-02-20 19:55:21,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {119676#true} assume true; {119676#true} is VALID [2022-02-20 19:55:21,423 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {119676#true} {119676#true} #590#return; {119676#true} is VALID [2022-02-20 19:55:21,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:55:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:21,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {119725#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {119676#true} assume !(1 == ~p_dw_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {119676#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {119676#true} is VALID [2022-02-20 19:55:21,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {119676#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {119676#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {119676#true} is VALID [2022-02-20 19:55:21,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {119676#true} assume !(0 != ~tmp~0#1); {119676#true} is VALID [2022-02-20 19:55:21,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {119676#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {119676#true} assume !(1 == ~c_dr_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {119676#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {119726#(and (<= 0 |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1|) (<= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| 0))} is VALID [2022-02-20 19:55:21,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {119726#(and (<= 0 |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1|) (<= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| 0))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {119727#(and (<= |immediate_notify_threads_is_do_read_c_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_read_c_triggered_#res#1|))} is VALID [2022-02-20 19:55:21,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {119727#(and (<= |immediate_notify_threads_is_do_read_c_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_read_c_triggered_#res#1|))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {119728#(and (<= |immediate_notify_threads_~tmp___0~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp___0~0#1| 1)))} is VALID [2022-02-20 19:55:21,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {119728#(and (<= |immediate_notify_threads_~tmp___0~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp___0~0#1| 1)))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {119677#false} is VALID [2022-02-20 19:55:21,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {119677#false} assume true; {119677#false} is VALID [2022-02-20 19:55:21,477 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {119677#false} {119676#true} #592#return; {119677#false} is VALID [2022-02-20 19:55:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:55:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:21,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {119725#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {119676#true} assume !(1 == ~p_dw_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {119676#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {119676#true} is VALID [2022-02-20 19:55:21,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {119676#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {119676#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {119676#true} is VALID [2022-02-20 19:55:21,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {119676#true} assume !(0 != ~tmp~0#1); {119676#true} is VALID [2022-02-20 19:55:21,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {119676#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {119676#true} assume !(1 == ~c_dr_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {119676#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {119676#true} is VALID [2022-02-20 19:55:21,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {119676#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {119676#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {119676#true} is VALID [2022-02-20 19:55:21,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {119676#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {119676#true} assume true; {119676#true} is VALID [2022-02-20 19:55:21,484 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {119676#true} {119677#false} #592#return; {119677#false} is VALID [2022-02-20 19:55:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 19:55:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:21,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {119725#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {119676#true} assume 1 == ~p_dw_pc~0; {119676#true} is VALID [2022-02-20 19:55:21,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {119676#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {119676#true} is VALID [2022-02-20 19:55:21,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {119676#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {119676#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {119676#true} is VALID [2022-02-20 19:55:21,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {119676#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {119676#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {119676#true} assume !(1 == ~c_dr_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {119676#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {119676#true} is VALID [2022-02-20 19:55:21,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {119676#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {119676#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {119676#true} is VALID [2022-02-20 19:55:21,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {119676#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {119676#true} assume true; {119676#true} is VALID [2022-02-20 19:55:21,497 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {119676#true} {119677#false} #594#return; {119677#false} is VALID [2022-02-20 19:55:21,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {119676#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {119676#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {119676#true} is VALID [2022-02-20 19:55:21,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {119676#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {119676#true} is VALID [2022-02-20 19:55:21,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {119676#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {119676#true} is VALID [2022-02-20 19:55:21,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {119676#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {119676#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {119676#true} assume { :end_inline_init_threads1 } true; {119676#true} is VALID [2022-02-20 19:55:21,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {119676#true} assume !false; {119676#true} is VALID [2022-02-20 19:55:21,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {119676#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {119676#true} assume !false; {119676#true} is VALID [2022-02-20 19:55:21,498 INFO L272 TraceCheckUtils]: 10: Hoare triple {119676#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {119676#true} is VALID [2022-02-20 19:55:21,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {119676#true} havoc ~__retres1~2; {119676#true} is VALID [2022-02-20 19:55:21,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {119676#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119676#true} is VALID [2022-02-20 19:55:21,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {119676#true} #res := ~__retres1~2; {119676#true} is VALID [2022-02-20 19:55:21,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {119676#true} assume true; {119676#true} is VALID [2022-02-20 19:55:21,499 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {119676#true} {119676#true} #590#return; {119676#true} is VALID [2022-02-20 19:55:21,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {119676#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {119676#true} is VALID [2022-02-20 19:55:21,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {119676#true} assume 0 != eval1_~tmp___1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {119676#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {119676#true} is VALID [2022-02-20 19:55:21,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {119676#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {119676#true} is VALID [2022-02-20 19:55:21,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {119676#true} assume 0 == ~p_dw_pc~0; {119676#true} is VALID [2022-02-20 19:55:21,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {119676#true} assume !false; {119676#true} is VALID [2022-02-20 19:55:21,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {119676#true} assume !(0 == ~q_free~0); {119676#true} is VALID [2022-02-20 19:55:21,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {119676#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {119676#true} is VALID [2022-02-20 19:55:21,500 INFO L272 TraceCheckUtils]: 24: Hoare triple {119676#true} call immediate_notify_threads(); {119725#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:21,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {119725#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {119676#true} assume !(1 == ~p_dw_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {119676#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {119676#true} is VALID [2022-02-20 19:55:21,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {119676#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {119676#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {119676#true} is VALID [2022-02-20 19:55:21,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {119676#true} assume !(0 != ~tmp~0#1); {119676#true} is VALID [2022-02-20 19:55:21,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {119676#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {119676#true} assume !(1 == ~c_dr_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {119676#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {119726#(and (<= 0 |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1|) (<= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| 0))} is VALID [2022-02-20 19:55:21,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {119726#(and (<= 0 |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1|) (<= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| 0))} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {119727#(and (<= |immediate_notify_threads_is_do_read_c_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_read_c_triggered_#res#1|))} is VALID [2022-02-20 19:55:21,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {119727#(and (<= |immediate_notify_threads_is_do_read_c_triggered_#res#1| 0) (<= 0 |immediate_notify_threads_is_do_read_c_triggered_#res#1|))} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {119728#(and (<= |immediate_notify_threads_~tmp___0~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp___0~0#1| 1)))} is VALID [2022-02-20 19:55:21,502 INFO L290 TraceCheckUtils]: 36: Hoare triple {119728#(and (<= |immediate_notify_threads_~tmp___0~0#1| 0) (< 0 (+ |immediate_notify_threads_~tmp___0~0#1| 1)))} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {119677#false} is VALID [2022-02-20 19:55:21,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {119677#false} assume true; {119677#false} is VALID [2022-02-20 19:55:21,503 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119677#false} {119676#true} #592#return; {119677#false} is VALID [2022-02-20 19:55:21,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {119677#false} ~q_write_ev~0 := 2; {119677#false} is VALID [2022-02-20 19:55:21,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {119677#false} assume !false; {119677#false} is VALID [2022-02-20 19:55:21,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {119677#false} assume !(0 == ~q_free~0); {119677#false} is VALID [2022-02-20 19:55:21,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {119677#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {119677#false} is VALID [2022-02-20 19:55:21,503 INFO L272 TraceCheckUtils]: 43: Hoare triple {119677#false} call immediate_notify_threads(); {119725#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:21,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {119725#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {119676#true} assume !(1 == ~p_dw_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {119676#true} is_do_write_p_triggered_~__retres1~0#1 := 0; {119676#true} is VALID [2022-02-20 19:55:21,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {119676#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {119676#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {119676#true} is VALID [2022-02-20 19:55:21,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {119676#true} assume !(0 != ~tmp~0#1); {119676#true} is VALID [2022-02-20 19:55:21,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {119676#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {119676#true} assume !(1 == ~c_dr_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {119676#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {119676#true} is VALID [2022-02-20 19:55:21,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {119676#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {119676#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {119676#true} is VALID [2022-02-20 19:55:21,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {119676#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {119676#true} assume true; {119676#true} is VALID [2022-02-20 19:55:21,505 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {119676#true} {119677#false} #592#return; {119677#false} is VALID [2022-02-20 19:55:21,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {119677#false} ~q_write_ev~0 := 2; {119677#false} is VALID [2022-02-20 19:55:21,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {119677#false} assume !false; {119677#false} is VALID [2022-02-20 19:55:21,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {119677#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {119677#false} is VALID [2022-02-20 19:55:21,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {119677#false} assume { :end_inline_do_write_p } true; {119677#false} is VALID [2022-02-20 19:55:21,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {119677#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {119677#false} is VALID [2022-02-20 19:55:21,505 INFO L290 TraceCheckUtils]: 63: Hoare triple {119677#false} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {119677#false} is VALID [2022-02-20 19:55:21,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {119677#false} assume 0 == ~c_dr_pc~0; {119677#false} is VALID [2022-02-20 19:55:21,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {119677#false} assume !false; {119677#false} is VALID [2022-02-20 19:55:21,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {119677#false} assume !(1 == ~q_free~0); {119677#false} is VALID [2022-02-20 19:55:21,506 INFO L290 TraceCheckUtils]: 67: Hoare triple {119677#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {119677#false} is VALID [2022-02-20 19:55:21,506 INFO L272 TraceCheckUtils]: 68: Hoare triple {119677#false} call immediate_notify_threads(); {119725#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:55:21,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {119725#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {119676#true} assume 1 == ~p_dw_pc~0; {119676#true} is VALID [2022-02-20 19:55:21,506 INFO L290 TraceCheckUtils]: 71: Hoare triple {119676#true} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {119676#true} is VALID [2022-02-20 19:55:21,506 INFO L290 TraceCheckUtils]: 72: Hoare triple {119676#true} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {119676#true} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {119676#true} is VALID [2022-02-20 19:55:21,507 INFO L290 TraceCheckUtils]: 74: Hoare triple {119676#true} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,507 INFO L290 TraceCheckUtils]: 75: Hoare triple {119676#true} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,507 INFO L290 TraceCheckUtils]: 76: Hoare triple {119676#true} assume !(1 == ~c_dr_pc~0); {119676#true} is VALID [2022-02-20 19:55:21,507 INFO L290 TraceCheckUtils]: 77: Hoare triple {119676#true} is_do_read_c_triggered_~__retres1~1#1 := 0; {119676#true} is VALID [2022-02-20 19:55:21,507 INFO L290 TraceCheckUtils]: 78: Hoare triple {119676#true} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {119676#true} is VALID [2022-02-20 19:55:21,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {119676#true} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {119676#true} is VALID [2022-02-20 19:55:21,507 INFO L290 TraceCheckUtils]: 80: Hoare triple {119676#true} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,507 INFO L290 TraceCheckUtils]: 81: Hoare triple {119676#true} assume true; {119676#true} is VALID [2022-02-20 19:55:21,508 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {119676#true} {119677#false} #594#return; {119677#false} is VALID [2022-02-20 19:55:21,508 INFO L290 TraceCheckUtils]: 83: Hoare triple {119677#false} ~q_read_ev~0 := 2; {119677#false} is VALID [2022-02-20 19:55:21,508 INFO L290 TraceCheckUtils]: 84: Hoare triple {119677#false} assume ~p_last_write~0 == ~c_last_read~0; {119677#false} is VALID [2022-02-20 19:55:21,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {119677#false} assume !(~p_num_write~0 == ~c_num_read~0); {119677#false} is VALID [2022-02-20 19:55:21,508 INFO L272 TraceCheckUtils]: 86: Hoare triple {119677#false} call error1(); {119677#false} is VALID [2022-02-20 19:55:21,508 INFO L290 TraceCheckUtils]: 87: Hoare triple {119677#false} assume !false; {119677#false} is VALID [2022-02-20 19:55:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-02-20 19:55:21,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:21,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921137706] [2022-02-20 19:55:21,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921137706] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:55:21,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838029960] [2022-02-20 19:55:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:21,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:55:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:55:21,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:55:21,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 19:55:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:21,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 19:55:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:21,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:55:21,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {119676#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {119676#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {119676#true} is VALID [2022-02-20 19:55:21,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {119676#true} assume 0 != main_#t~nondet26#1;havoc main_#t~nondet26#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {119676#true} is VALID [2022-02-20 19:55:21,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {119676#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret12#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~3#1;start_simulation1_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads1 } true; {119676#true} is VALID [2022-02-20 19:55:21,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {119676#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {119676#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {119676#true} is VALID [2022-02-20 19:55:21,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {119676#true} assume { :end_inline_init_threads1 } true; {119676#true} is VALID [2022-02-20 19:55:21,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {119676#true} assume !false; {119676#true} is VALID [2022-02-20 19:55:21,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {119676#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret8#1, eval1_#t~nondet9#1, eval1_#t~nondet10#1, eval1_~tmp~1#1, eval1_~tmp___0~1#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~1#1;havoc eval1_~tmp___0~1#1;havoc eval1_~tmp___1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {119676#true} assume !false; {119676#true} is VALID [2022-02-20 19:55:21,723 INFO L272 TraceCheckUtils]: 10: Hoare triple {119676#true} call eval1_#t~ret8#1 := exists_runnable_thread1(); {119676#true} is VALID [2022-02-20 19:55:21,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {119676#true} havoc ~__retres1~2; {119676#true} is VALID [2022-02-20 19:55:21,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {119676#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119676#true} is VALID [2022-02-20 19:55:21,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {119676#true} #res := ~__retres1~2; {119676#true} is VALID [2022-02-20 19:55:21,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {119676#true} assume true; {119676#true} is VALID [2022-02-20 19:55:21,724 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {119676#true} {119676#true} #590#return; {119676#true} is VALID [2022-02-20 19:55:21,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {119676#true} assume -2147483648 <= eval1_#t~ret8#1 && eval1_#t~ret8#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret8#1;havoc eval1_#t~ret8#1; {119676#true} is VALID [2022-02-20 19:55:21,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {119676#true} assume 0 != eval1_~tmp___1~0#1; {119676#true} is VALID [2022-02-20 19:55:21,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {119676#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet9#1 && eval1_#t~nondet9#1 <= 2147483647;eval1_~tmp~1#1 := eval1_#t~nondet9#1;havoc eval1_#t~nondet9#1; {119676#true} is VALID [2022-02-20 19:55:21,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {119676#true} assume 0 != eval1_~tmp~1#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {119676#true} is VALID [2022-02-20 19:55:21,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {119676#true} assume 0 == ~p_dw_pc~0; {119676#true} is VALID [2022-02-20 19:55:21,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {119676#true} assume !false; {119676#true} is VALID [2022-02-20 19:55:21,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {119676#true} assume !(0 == ~q_free~0); {119676#true} is VALID [2022-02-20 19:55:21,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {119676#true} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,725 INFO L272 TraceCheckUtils]: 24: Hoare triple {119801#(= ~q_free~0 0)} call immediate_notify_threads(); {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {119801#(= ~q_free~0 0)} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {119801#(= ~q_free~0 0)} assume !(1 == ~p_dw_pc~0); {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {119801#(= ~q_free~0 0)} is_do_write_p_triggered_~__retres1~0#1 := 0; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {119801#(= ~q_free~0 0)} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {119801#(= ~q_free~0 0)} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {119801#(= ~q_free~0 0)} assume !(0 != ~tmp~0#1); {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {119801#(= ~q_free~0 0)} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {119801#(= ~q_free~0 0)} assume !(1 == ~c_dr_pc~0); {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {119801#(= ~q_free~0 0)} is_do_read_c_triggered_~__retres1~1#1 := 0; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {119801#(= ~q_free~0 0)} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {119801#(= ~q_free~0 0)} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {119801#(= ~q_free~0 0)} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {119801#(= ~q_free~0 0)} assume true; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,730 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119801#(= ~q_free~0 0)} {119801#(= ~q_free~0 0)} #592#return; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {119801#(= ~q_free~0 0)} ~q_write_ev~0 := 2; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {119801#(= ~q_free~0 0)} assume !false; {119801#(= ~q_free~0 0)} is VALID [2022-02-20 19:55:21,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {119801#(= ~q_free~0 0)} assume !(0 == ~q_free~0); {119677#false} is VALID [2022-02-20 19:55:21,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {119677#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_write_ev~0 := 1; {119677#false} is VALID [2022-02-20 19:55:21,731 INFO L272 TraceCheckUtils]: 43: Hoare triple {119677#false} call immediate_notify_threads(); {119677#false} is VALID [2022-02-20 19:55:21,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {119677#false} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {119677#false} is VALID [2022-02-20 19:55:21,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {119677#false} assume !(1 == ~p_dw_pc~0); {119677#false} is VALID [2022-02-20 19:55:21,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {119677#false} is_do_write_p_triggered_~__retres1~0#1 := 0; {119677#false} is VALID [2022-02-20 19:55:21,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {119677#false} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {119677#false} is VALID [2022-02-20 19:55:21,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {119677#false} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {119677#false} is VALID [2022-02-20 19:55:21,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {119677#false} assume !(0 != ~tmp~0#1); {119677#false} is VALID [2022-02-20 19:55:21,731 INFO L290 TraceCheckUtils]: 50: Hoare triple {119677#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {119677#false} is VALID [2022-02-20 19:55:21,731 INFO L290 TraceCheckUtils]: 51: Hoare triple {119677#false} assume !(1 == ~c_dr_pc~0); {119677#false} is VALID [2022-02-20 19:55:21,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {119677#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {119677#false} is VALID [2022-02-20 19:55:21,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {119677#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {119677#false} is VALID [2022-02-20 19:55:21,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {119677#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {119677#false} is VALID [2022-02-20 19:55:21,732 INFO L290 TraceCheckUtils]: 55: Hoare triple {119677#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {119677#false} is VALID [2022-02-20 19:55:21,732 INFO L290 TraceCheckUtils]: 56: Hoare triple {119677#false} assume true; {119677#false} is VALID [2022-02-20 19:55:21,732 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {119677#false} {119677#false} #592#return; {119677#false} is VALID [2022-02-20 19:55:21,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {119677#false} ~q_write_ev~0 := 2; {119677#false} is VALID [2022-02-20 19:55:21,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {119677#false} assume !false; {119677#false} is VALID [2022-02-20 19:55:21,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {119677#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {119677#false} is VALID [2022-02-20 19:55:21,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {119677#false} assume { :end_inline_do_write_p } true; {119677#false} is VALID [2022-02-20 19:55:21,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {119677#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet10#1 && eval1_#t~nondet10#1 <= 2147483647;eval1_~tmp___0~1#1 := eval1_#t~nondet10#1;havoc eval1_#t~nondet10#1; {119677#false} is VALID [2022-02-20 19:55:21,733 INFO L290 TraceCheckUtils]: 63: Hoare triple {119677#false} assume 0 != eval1_~tmp___0~1#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {119677#false} is VALID [2022-02-20 19:55:21,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {119677#false} assume 0 == ~c_dr_pc~0; {119677#false} is VALID [2022-02-20 19:55:21,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {119677#false} assume !false; {119677#false} is VALID [2022-02-20 19:55:21,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {119677#false} assume !(1 == ~q_free~0); {119677#false} is VALID [2022-02-20 19:55:21,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {119677#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_read_ev~0 := 1; {119677#false} is VALID [2022-02-20 19:55:21,733 INFO L272 TraceCheckUtils]: 68: Hoare triple {119677#false} call immediate_notify_threads(); {119677#false} is VALID [2022-02-20 19:55:21,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {119677#false} havoc ~tmp~0#1;havoc ~tmp___0~0#1;assume { :begin_inline_is_do_write_p_triggered } true;havoc is_do_write_p_triggered_#res#1;havoc is_do_write_p_triggered_~__retres1~0#1;havoc is_do_write_p_triggered_~__retres1~0#1; {119677#false} is VALID [2022-02-20 19:55:21,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {119677#false} assume 1 == ~p_dw_pc~0; {119677#false} is VALID [2022-02-20 19:55:21,734 INFO L290 TraceCheckUtils]: 71: Hoare triple {119677#false} assume 1 == ~q_read_ev~0;is_do_write_p_triggered_~__retres1~0#1 := 1; {119677#false} is VALID [2022-02-20 19:55:21,734 INFO L290 TraceCheckUtils]: 72: Hoare triple {119677#false} is_do_write_p_triggered_#res#1 := is_do_write_p_triggered_~__retres1~0#1; {119677#false} is VALID [2022-02-20 19:55:21,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {119677#false} #t~ret5#1 := is_do_write_p_triggered_#res#1;assume { :end_inline_is_do_write_p_triggered } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647;~tmp~0#1 := #t~ret5#1;havoc #t~ret5#1; {119677#false} is VALID [2022-02-20 19:55:21,734 INFO L290 TraceCheckUtils]: 74: Hoare triple {119677#false} assume 0 != ~tmp~0#1;~p_dw_st~0 := 0; {119677#false} is VALID [2022-02-20 19:55:21,734 INFO L290 TraceCheckUtils]: 75: Hoare triple {119677#false} assume { :begin_inline_is_do_read_c_triggered } true;havoc is_do_read_c_triggered_#res#1;havoc is_do_read_c_triggered_~__retres1~1#1;havoc is_do_read_c_triggered_~__retres1~1#1; {119677#false} is VALID [2022-02-20 19:55:21,734 INFO L290 TraceCheckUtils]: 76: Hoare triple {119677#false} assume !(1 == ~c_dr_pc~0); {119677#false} is VALID [2022-02-20 19:55:21,735 INFO L290 TraceCheckUtils]: 77: Hoare triple {119677#false} is_do_read_c_triggered_~__retres1~1#1 := 0; {119677#false} is VALID [2022-02-20 19:55:21,735 INFO L290 TraceCheckUtils]: 78: Hoare triple {119677#false} is_do_read_c_triggered_#res#1 := is_do_read_c_triggered_~__retres1~1#1; {119677#false} is VALID [2022-02-20 19:55:21,735 INFO L290 TraceCheckUtils]: 79: Hoare triple {119677#false} #t~ret6#1 := is_do_read_c_triggered_#res#1;assume { :end_inline_is_do_read_c_triggered } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647;~tmp___0~0#1 := #t~ret6#1;havoc #t~ret6#1; {119677#false} is VALID [2022-02-20 19:55:21,735 INFO L290 TraceCheckUtils]: 80: Hoare triple {119677#false} assume 0 != ~tmp___0~0#1;~c_dr_st~0 := 0; {119677#false} is VALID [2022-02-20 19:55:21,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {119677#false} assume true; {119677#false} is VALID [2022-02-20 19:55:21,735 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {119677#false} {119677#false} #594#return; {119677#false} is VALID [2022-02-20 19:55:21,735 INFO L290 TraceCheckUtils]: 83: Hoare triple {119677#false} ~q_read_ev~0 := 2; {119677#false} is VALID [2022-02-20 19:55:21,735 INFO L290 TraceCheckUtils]: 84: Hoare triple {119677#false} assume ~p_last_write~0 == ~c_last_read~0; {119677#false} is VALID [2022-02-20 19:55:21,735 INFO L290 TraceCheckUtils]: 85: Hoare triple {119677#false} assume !(~p_num_write~0 == ~c_num_read~0); {119677#false} is VALID [2022-02-20 19:55:21,736 INFO L272 TraceCheckUtils]: 86: Hoare triple {119677#false} call error1(); {119677#false} is VALID [2022-02-20 19:55:21,736 INFO L290 TraceCheckUtils]: 87: Hoare triple {119677#false} assume !false; {119677#false} is VALID [2022-02-20 19:55:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 19:55:21,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:55:21,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838029960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:21,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 19:55:21,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-02-20 19:55:21,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737012287] [2022-02-20 19:55:21,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:21,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-02-20 19:55:21,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:21,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 19:55:21,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:21,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:55:21,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:55:21,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:21,779 INFO L87 Difference]: Start difference. First operand 2481 states and 3197 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 19:55:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:22,915 INFO L93 Difference]: Finished difference Result 3204 states and 4135 transitions. [2022-02-20 19:55:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:55:22,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-02-20 19:55:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 19:55:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2022-02-20 19:55:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 19:55:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2022-02-20 19:55:22,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 380 transitions. [2022-02-20 19:55:23,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:23,350 INFO L225 Difference]: With dead ends: 3204 [2022-02-20 19:55:23,350 INFO L226 Difference]: Without dead ends: 2359 [2022-02-20 19:55:23,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:23,352 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 196 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:23,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 342 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:55:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2022-02-20 19:55:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2344. [2022-02-20 19:55:23,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:23,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2359 states. Second operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2022-02-20 19:55:23,879 INFO L74 IsIncluded]: Start isIncluded. First operand 2359 states. Second operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2022-02-20 19:55:23,881 INFO L87 Difference]: Start difference. First operand 2359 states. Second operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2022-02-20 19:55:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:24,039 INFO L93 Difference]: Finished difference Result 2359 states and 3032 transitions. [2022-02-20 19:55:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 3032 transitions. [2022-02-20 19:55:24,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:24,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:24,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) Second operand 2359 states. [2022-02-20 19:55:24,044 INFO L87 Difference]: Start difference. First operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) Second operand 2359 states. [2022-02-20 19:55:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:24,207 INFO L93 Difference]: Finished difference Result 2359 states and 3032 transitions. [2022-02-20 19:55:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 3032 transitions. [2022-02-20 19:55:24,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:24,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:24,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:24,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1970 states have (on average 1.2857868020304568) internal successors, (2533), 2003 states have internal predecessors, (2533), 218 states have call successors, (218), 138 states have call predecessors, (218), 154 states have return successors, (266), 204 states have call predecessors, (266), 217 states have call successors, (266) [2022-02-20 19:55:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3017 transitions. [2022-02-20 19:55:24,481 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3017 transitions. Word has length 88 [2022-02-20 19:55:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:24,482 INFO L470 AbstractCegarLoop]: Abstraction has 2344 states and 3017 transitions. [2022-02-20 19:55:24,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 19:55:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3017 transitions. [2022-02-20 19:55:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 19:55:24,483 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:24,483 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:24,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 19:55:24,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:55:24,684 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:24,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1196332864, now seen corresponding path program 1 times [2022-02-20 19:55:24,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:24,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396156806] [2022-02-20 19:55:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:24,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,721 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {132390#true} {132390#true} #602#return; {132390#true} is VALID [2022-02-20 19:55:24,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:55:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:24,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {132448#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {132390#true} is VALID [2022-02-20 19:55:24,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {132390#true} assume !(0 == ~T1_E~0); {132390#true} is VALID [2022-02-20 19:55:24,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {132390#true} assume !(0 == ~E_M~0); {132390#true} is VALID [2022-02-20 19:55:24,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {132390#true} assume !(0 == ~E_1~0); {132390#true} is VALID [2022-02-20 19:55:24,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,731 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {132390#true} {132394#(= ~t1_st~0 0)} #604#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:55:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:24,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~4#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~5#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~5#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~2#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,747 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {132450#(= |old(~t1_st~0)| ~t1_st~0)} {132394#(= ~t1_st~0 0)} #606#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:55:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:24,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {132448#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {132390#true} is VALID [2022-02-20 19:55:24,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {132390#true} assume !(1 == ~T1_E~0); {132390#true} is VALID [2022-02-20 19:55:24,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {132390#true} assume !(1 == ~E_M~0); {132390#true} is VALID [2022-02-20 19:55:24,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {132390#true} assume !(1 == ~E_1~0); {132390#true} is VALID [2022-02-20 19:55:24,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,752 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {132390#true} {132394#(= ~t1_st~0 0)} #608#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:55:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:24,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {132390#true} havoc ~__retres1~6; {132390#true} is VALID [2022-02-20 19:55:24,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {132390#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {132390#true} is VALID [2022-02-20 19:55:24,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {132390#true} #res := ~__retres1~6; {132390#true} is VALID [2022-02-20 19:55:24,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,755 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {132390#true} {132394#(= ~t1_st~0 0)} #610#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 19:55:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-20 19:55:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:24,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~4#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~5#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~5#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~2#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,794 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {132450#(= |old(~t1_st~0)| ~t1_st~0)} {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} #588#return; {132465#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 19:55:24,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} call activate_threads2(); {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:24,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~4#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~5#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~5#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~2#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,799 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {132450#(= |old(~t1_st~0)| ~t1_st~0)} {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} #588#return; {132465#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 19:55:24,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {132465#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} assume true; {132465#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 19:55:24,800 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {132465#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} {132394#(= ~t1_st~0 0)} #612#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 19:55:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:24,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {132390#true} havoc ~__retres1~6; {132390#true} is VALID [2022-02-20 19:55:24,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {132390#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {132390#true} is VALID [2022-02-20 19:55:24,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {132390#true} #res := ~__retres1~6; {132390#true} is VALID [2022-02-20 19:55:24,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,803 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {132390#true} {132391#false} #610#return; {132391#false} is VALID [2022-02-20 19:55:24,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {132390#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {132390#true} is VALID [2022-02-20 19:55:24,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {132390#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {132390#true} is VALID [2022-02-20 19:55:24,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {132390#true} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {132390#true} is VALID [2022-02-20 19:55:24,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {132390#true} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {132390#true} is VALID [2022-02-20 19:55:24,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {132390#true} call update_channels2(); {132390#true} is VALID [2022-02-20 19:55:24,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,803 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {132390#true} {132390#true} #602#return; {132390#true} is VALID [2022-02-20 19:55:24,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {132390#true} assume { :begin_inline_init_threads2 } true; {132390#true} is VALID [2022-02-20 19:55:24,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {132390#true} assume 1 == ~m_i~0;~m_st~0 := 0; {132390#true} is VALID [2022-02-20 19:55:24,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {132390#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {132394#(= ~t1_st~0 0)} assume { :end_inline_init_threads2 } true; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,805 INFO L272 TraceCheckUtils]: 11: Hoare triple {132394#(= ~t1_st~0 0)} call fire_delta_events2(); {132448#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:24,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {132448#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {132390#true} is VALID [2022-02-20 19:55:24,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {132390#true} assume !(0 == ~T1_E~0); {132390#true} is VALID [2022-02-20 19:55:24,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {132390#true} assume !(0 == ~E_M~0); {132390#true} is VALID [2022-02-20 19:55:24,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {132390#true} assume !(0 == ~E_1~0); {132390#true} is VALID [2022-02-20 19:55:24,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,806 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {132390#true} {132394#(= ~t1_st~0 0)} #604#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,806 INFO L272 TraceCheckUtils]: 18: Hoare triple {132394#(= ~t1_st~0 0)} call activate_threads2(); {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:24,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~4#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~5#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~5#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~2#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,810 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {132450#(= |old(~t1_st~0)| ~t1_st~0)} {132394#(= ~t1_st~0 0)} #606#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,810 INFO L272 TraceCheckUtils]: 33: Hoare triple {132394#(= ~t1_st~0 0)} call reset_delta_events2(); {132448#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:24,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {132448#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {132390#true} is VALID [2022-02-20 19:55:24,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {132390#true} assume !(1 == ~T1_E~0); {132390#true} is VALID [2022-02-20 19:55:24,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {132390#true} assume !(1 == ~E_M~0); {132390#true} is VALID [2022-02-20 19:55:24,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {132390#true} assume !(1 == ~E_1~0); {132390#true} is VALID [2022-02-20 19:55:24,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,811 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {132390#true} {132394#(= ~t1_st~0 0)} #608#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {132394#(= ~t1_st~0 0)} assume !false; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {132394#(= ~t1_st~0 0)} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {132394#(= ~t1_st~0 0)} assume !false; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,812 INFO L272 TraceCheckUtils]: 43: Hoare triple {132394#(= ~t1_st~0 0)} call eval2_#t~ret18#1 := exists_runnable_thread2(); {132390#true} is VALID [2022-02-20 19:55:24,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {132390#true} havoc ~__retres1~6; {132390#true} is VALID [2022-02-20 19:55:24,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {132390#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {132390#true} is VALID [2022-02-20 19:55:24,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {132390#true} #res := ~__retres1~6; {132390#true} is VALID [2022-02-20 19:55:24,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,814 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {132390#true} {132394#(= ~t1_st~0 0)} #610#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {132394#(= ~t1_st~0 0)} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,814 INFO L290 TraceCheckUtils]: 50: Hoare triple {132394#(= ~t1_st~0 0)} assume 0 != eval2_~tmp~4#1; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,814 INFO L290 TraceCheckUtils]: 51: Hoare triple {132394#(= ~t1_st~0 0)} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,815 INFO L290 TraceCheckUtils]: 52: Hoare triple {132394#(= ~t1_st~0 0)} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {132394#(= ~t1_st~0 0)} assume 0 == ~m_pc~0; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,815 INFO L290 TraceCheckUtils]: 54: Hoare triple {132394#(= ~t1_st~0 0)} assume !false; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {132394#(= ~t1_st~0 0)} assume -2147483648 <= master_#t~nondet17#1 && master_#t~nondet17#1 <= 2147483647;~token~0 := master_#t~nondet17#1;havoc master_#t~nondet17#1;~local~0 := ~token~0;~E_1~0 := 1; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,816 INFO L272 TraceCheckUtils]: 56: Hoare triple {132394#(= ~t1_st~0 0)} call immediate_notify(); {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:24,816 INFO L272 TraceCheckUtils]: 57: Hoare triple {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} call activate_threads2(); {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:24,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~m_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,817 INFO L290 TraceCheckUtils]: 60: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_~__retres1~4#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,817 INFO L290 TraceCheckUtils]: 61: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp~5#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,818 INFO L290 TraceCheckUtils]: 64: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,818 INFO L290 TraceCheckUtils]: 65: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(1 == ~t1_pc~0); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_~__retres1~5#1 := 0; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,819 INFO L290 TraceCheckUtils]: 67: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,819 INFO L290 TraceCheckUtils]: 68: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,820 INFO L290 TraceCheckUtils]: 69: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume !(0 != ~tmp___0~2#1); {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,820 INFO L290 TraceCheckUtils]: 70: Hoare triple {132450#(= |old(~t1_st~0)| ~t1_st~0)} assume true; {132450#(= |old(~t1_st~0)| ~t1_st~0)} is VALID [2022-02-20 19:55:24,820 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {132450#(= |old(~t1_st~0)| ~t1_st~0)} {132449#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} #588#return; {132465#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 19:55:24,821 INFO L290 TraceCheckUtils]: 72: Hoare triple {132465#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} assume true; {132465#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} is VALID [2022-02-20 19:55:24,821 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {132465#(and (or (< 0 (+ ~t1_st~0 1)) (<= |old(~t1_st~0)| ~t1_st~0)) (or (<= ~t1_st~0 |old(~t1_st~0)|) (<= ~t1_st~0 0)))} {132394#(= ~t1_st~0 0)} #612#return; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {132394#(= ~t1_st~0 0)} ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {132394#(= ~t1_st~0 0)} assume { :end_inline_master } true; {132394#(= ~t1_st~0 0)} is VALID [2022-02-20 19:55:24,822 INFO L290 TraceCheckUtils]: 76: Hoare triple {132394#(= ~t1_st~0 0)} assume !(0 == ~t1_st~0); {132391#false} is VALID [2022-02-20 19:55:24,822 INFO L290 TraceCheckUtils]: 77: Hoare triple {132391#false} assume !false; {132391#false} is VALID [2022-02-20 19:55:24,822 INFO L272 TraceCheckUtils]: 78: Hoare triple {132391#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {132390#true} is VALID [2022-02-20 19:55:24,822 INFO L290 TraceCheckUtils]: 79: Hoare triple {132390#true} havoc ~__retres1~6; {132390#true} is VALID [2022-02-20 19:55:24,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {132390#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {132390#true} is VALID [2022-02-20 19:55:24,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {132390#true} #res := ~__retres1~6; {132390#true} is VALID [2022-02-20 19:55:24,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {132390#true} assume true; {132390#true} is VALID [2022-02-20 19:55:24,823 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {132390#true} {132391#false} #610#return; {132391#false} is VALID [2022-02-20 19:55:24,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {132391#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {132391#false} is VALID [2022-02-20 19:55:24,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {132391#false} assume 0 != eval2_~tmp~4#1; {132391#false} is VALID [2022-02-20 19:55:24,823 INFO L290 TraceCheckUtils]: 86: Hoare triple {132391#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {132391#false} is VALID [2022-02-20 19:55:24,823 INFO L290 TraceCheckUtils]: 87: Hoare triple {132391#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {132391#false} is VALID [2022-02-20 19:55:24,823 INFO L290 TraceCheckUtils]: 88: Hoare triple {132391#false} assume !(0 == ~m_pc~0); {132391#false} is VALID [2022-02-20 19:55:24,824 INFO L290 TraceCheckUtils]: 89: Hoare triple {132391#false} assume 1 == ~m_pc~0; {132391#false} is VALID [2022-02-20 19:55:24,824 INFO L290 TraceCheckUtils]: 90: Hoare triple {132391#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {132391#false} is VALID [2022-02-20 19:55:24,824 INFO L290 TraceCheckUtils]: 91: Hoare triple {132391#false} assume !false; {132391#false} is VALID [2022-02-20 19:55:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-20 19:55:24,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:24,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396156806] [2022-02-20 19:55:24,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396156806] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:24,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:24,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:55:24,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545197499] [2022-02-20 19:55:24,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:24,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-02-20 19:55:24,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:24,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 19:55:24,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:24,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:55:24,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:55:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:55:24,871 INFO L87 Difference]: Start difference. First operand 2344 states and 3017 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 19:55:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:28,196 INFO L93 Difference]: Finished difference Result 5463 states and 7157 transitions. [2022-02-20 19:55:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:55:28,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-02-20 19:55:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:55:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 19:55:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 567 transitions. [2022-02-20 19:55:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 19:55:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 567 transitions. [2022-02-20 19:55:28,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 567 transitions. [2022-02-20 19:55:28,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:29,253 INFO L225 Difference]: With dead ends: 5463 [2022-02-20 19:55:29,253 INFO L226 Difference]: Without dead ends: 4080 [2022-02-20 19:55:29,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-02-20 19:55:29,256 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 520 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:55:29,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 657 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:55:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4080 states. [2022-02-20 19:55:30,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4080 to 3682. [2022-02-20 19:55:30,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:55:30,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4080 states. Second operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2022-02-20 19:55:30,174 INFO L74 IsIncluded]: Start isIncluded. First operand 4080 states. Second operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2022-02-20 19:55:30,176 INFO L87 Difference]: Start difference. First operand 4080 states. Second operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2022-02-20 19:55:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:30,689 INFO L93 Difference]: Finished difference Result 4080 states and 5289 transitions. [2022-02-20 19:55:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 5289 transitions. [2022-02-20 19:55:30,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:30,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:30,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) Second operand 4080 states. [2022-02-20 19:55:30,699 INFO L87 Difference]: Start difference. First operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) Second operand 4080 states. [2022-02-20 19:55:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:55:31,204 INFO L93 Difference]: Finished difference Result 4080 states and 5289 transitions. [2022-02-20 19:55:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 5289 transitions. [2022-02-20 19:55:31,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:55:31,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:55:31,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:55:31,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:55:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3029 states have (on average 1.2822713766919775) internal successors, (3884), 3089 states have internal predecessors, (3884), 371 states have call successors, (371), 238 states have call predecessors, (371), 280 states have return successors, (512), 358 states have call predecessors, (512), 370 states have call successors, (512) [2022-02-20 19:55:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4767 transitions. [2022-02-20 19:55:31,840 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4767 transitions. Word has length 92 [2022-02-20 19:55:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:55:31,840 INFO L470 AbstractCegarLoop]: Abstraction has 3682 states and 4767 transitions. [2022-02-20 19:55:31,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 19:55:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4767 transitions. [2022-02-20 19:55:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 19:55:31,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:55:31,843 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:55:31,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 19:55:31,843 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:55:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:55:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 128523330, now seen corresponding path program 1 times [2022-02-20 19:55:31,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:55:31,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172963076] [2022-02-20 19:55:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:55:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:55:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:31,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:55:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:31,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,876 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {153143#true} {153145#(= ~t1_i~0 1)} #602#return; {153145#(= ~t1_i~0 1)} is VALID [2022-02-20 19:55:31,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:55:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:31,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {153201#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {153143#true} is VALID [2022-02-20 19:55:31,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {153143#true} assume !(0 == ~T1_E~0); {153143#true} is VALID [2022-02-20 19:55:31,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {153143#true} assume !(0 == ~E_M~0); {153143#true} is VALID [2022-02-20 19:55:31,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {153143#true} assume !(0 == ~E_1~0); {153143#true} is VALID [2022-02-20 19:55:31,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,884 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {153143#true} {153144#false} #604#return; {153144#false} is VALID [2022-02-20 19:55:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:55:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:31,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {153143#true} assume !(1 == ~m_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {153143#true} is_master_triggered_~__retres1~4#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {153143#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,893 INFO L290 TraceCheckUtils]: 4: Hoare triple {153143#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {153143#true} is VALID [2022-02-20 19:55:31,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {153143#true} assume !(0 != ~tmp~5#1); {153143#true} is VALID [2022-02-20 19:55:31,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {153143#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {153143#true} assume !(1 == ~t1_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {153143#true} is_transmit1_triggered_~__retres1~5#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {153143#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {153143#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {153143#true} is VALID [2022-02-20 19:55:31,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {153143#true} assume !(0 != ~tmp___0~2#1); {153143#true} is VALID [2022-02-20 19:55:31,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,894 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {153143#true} {153144#false} #606#return; {153144#false} is VALID [2022-02-20 19:55:31,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:55:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:31,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {153201#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {153143#true} is VALID [2022-02-20 19:55:31,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {153143#true} assume !(1 == ~T1_E~0); {153143#true} is VALID [2022-02-20 19:55:31,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {153143#true} assume !(1 == ~E_M~0); {153143#true} is VALID [2022-02-20 19:55:31,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {153143#true} assume !(1 == ~E_1~0); {153143#true} is VALID [2022-02-20 19:55:31,899 INFO L290 TraceCheckUtils]: 4: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,899 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {153143#true} {153144#false} #608#return; {153144#false} is VALID [2022-02-20 19:55:31,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:55:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:31,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {153143#true} havoc ~__retres1~6; {153143#true} is VALID [2022-02-20 19:55:31,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {153143#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {153143#true} is VALID [2022-02-20 19:55:31,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {153143#true} #res := ~__retres1~6; {153143#true} is VALID [2022-02-20 19:55:31,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,902 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {153143#true} {153144#false} #610#return; {153144#false} is VALID [2022-02-20 19:55:31,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 19:55:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:31,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-20 19:55:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:31,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {153143#true} assume !(1 == ~m_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {153143#true} is_master_triggered_~__retres1~4#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {153143#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,914 INFO L290 TraceCheckUtils]: 4: Hoare triple {153143#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {153143#true} is VALID [2022-02-20 19:55:31,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {153143#true} assume !(0 != ~tmp~5#1); {153143#true} is VALID [2022-02-20 19:55:31,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {153143#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {153143#true} assume !(1 == ~t1_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {153143#true} is_transmit1_triggered_~__retres1~5#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {153143#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {153143#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {153143#true} is VALID [2022-02-20 19:55:31,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {153143#true} assume !(0 != ~tmp___0~2#1); {153143#true} is VALID [2022-02-20 19:55:31,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,915 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {153143#true} {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} #588#return; {153143#true} is VALID [2022-02-20 19:55:31,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} call activate_threads2(); {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:31,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {153143#true} assume !(1 == ~m_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {153143#true} is_master_triggered_~__retres1~4#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {153143#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {153143#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {153143#true} is VALID [2022-02-20 19:55:31,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {153143#true} assume !(0 != ~tmp~5#1); {153143#true} is VALID [2022-02-20 19:55:31,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {153143#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {153143#true} assume !(1 == ~t1_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {153143#true} is_transmit1_triggered_~__retres1~5#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {153143#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {153143#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {153143#true} is VALID [2022-02-20 19:55:31,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {153143#true} assume !(0 != ~tmp___0~2#1); {153143#true} is VALID [2022-02-20 19:55:31,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,918 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {153143#true} {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} #588#return; {153143#true} is VALID [2022-02-20 19:55:31,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,918 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {153143#true} {153144#false} #612#return; {153144#false} is VALID [2022-02-20 19:55:31,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 19:55:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:55:31,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {153143#true} havoc ~__retres1~6; {153143#true} is VALID [2022-02-20 19:55:31,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {153143#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {153143#true} is VALID [2022-02-20 19:55:31,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {153143#true} #res := ~__retres1~6; {153143#true} is VALID [2022-02-20 19:55:31,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,921 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {153143#true} {153144#false} #610#return; {153144#false} is VALID [2022-02-20 19:55:31,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {153143#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {153143#true} is VALID [2022-02-20 19:55:31,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {153143#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~ret27#1, main_#t~ret28#1;assume -2147483648 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 2147483647; {153143#true} is VALID [2022-02-20 19:55:31,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {153143#true} assume !(0 != main_#t~nondet26#1);havoc main_#t~nondet26#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {153145#(= ~t1_i~0 1)} is VALID [2022-02-20 19:55:31,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {153145#(= ~t1_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret24#1, start_simulation2_#t~ret25#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~7#1, start_simulation2_~tmp___0~3#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~7#1;havoc start_simulation2_~tmp___0~3#1;start_simulation2_~kernel_st~1#1 := 0; {153145#(= ~t1_i~0 1)} is VALID [2022-02-20 19:55:31,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {153145#(= ~t1_i~0 1)} call update_channels2(); {153143#true} is VALID [2022-02-20 19:55:31,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,922 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {153143#true} {153145#(= ~t1_i~0 1)} #602#return; {153145#(= ~t1_i~0 1)} is VALID [2022-02-20 19:55:31,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {153145#(= ~t1_i~0 1)} assume { :begin_inline_init_threads2 } true; {153145#(= ~t1_i~0 1)} is VALID [2022-02-20 19:55:31,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {153145#(= ~t1_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {153145#(= ~t1_i~0 1)} is VALID [2022-02-20 19:55:31,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {153145#(= ~t1_i~0 1)} assume !(1 == ~t1_i~0);~t1_st~0 := 2; {153144#false} is VALID [2022-02-20 19:55:31,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {153144#false} assume { :end_inline_init_threads2 } true; {153144#false} is VALID [2022-02-20 19:55:31,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {153144#false} call fire_delta_events2(); {153201#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:31,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {153201#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {153143#true} is VALID [2022-02-20 19:55:31,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {153143#true} assume !(0 == ~T1_E~0); {153143#true} is VALID [2022-02-20 19:55:31,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {153143#true} assume !(0 == ~E_M~0); {153143#true} is VALID [2022-02-20 19:55:31,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {153143#true} assume !(0 == ~E_1~0); {153143#true} is VALID [2022-02-20 19:55:31,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,924 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {153143#true} {153144#false} #604#return; {153144#false} is VALID [2022-02-20 19:55:31,924 INFO L272 TraceCheckUtils]: 18: Hoare triple {153144#false} call activate_threads2(); {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:31,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {153143#true} assume !(1 == ~m_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {153143#true} is_master_triggered_~__retres1~4#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {153143#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {153143#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {153143#true} is VALID [2022-02-20 19:55:31,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {153143#true} assume !(0 != ~tmp~5#1); {153143#true} is VALID [2022-02-20 19:55:31,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {153143#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {153143#true} assume !(1 == ~t1_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {153143#true} is_transmit1_triggered_~__retres1~5#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {153143#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {153143#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {153143#true} is VALID [2022-02-20 19:55:31,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {153143#true} assume !(0 != ~tmp___0~2#1); {153143#true} is VALID [2022-02-20 19:55:31,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,926 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {153143#true} {153144#false} #606#return; {153144#false} is VALID [2022-02-20 19:55:31,926 INFO L272 TraceCheckUtils]: 33: Hoare triple {153144#false} call reset_delta_events2(); {153201#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:55:31,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {153201#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {153143#true} is VALID [2022-02-20 19:55:31,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {153143#true} assume !(1 == ~T1_E~0); {153143#true} is VALID [2022-02-20 19:55:31,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {153143#true} assume !(1 == ~E_M~0); {153143#true} is VALID [2022-02-20 19:55:31,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {153143#true} assume !(1 == ~E_1~0); {153143#true} is VALID [2022-02-20 19:55:31,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,926 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {153143#true} {153144#false} #608#return; {153144#false} is VALID [2022-02-20 19:55:31,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {153144#false} assume !false; {153144#false} is VALID [2022-02-20 19:55:31,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {153144#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret18#1, eval2_#t~nondet19#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet20#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~4#1;havoc eval2_~tmp~4#1; {153144#false} is VALID [2022-02-20 19:55:31,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {153144#false} assume !false; {153144#false} is VALID [2022-02-20 19:55:31,927 INFO L272 TraceCheckUtils]: 43: Hoare triple {153144#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {153143#true} is VALID [2022-02-20 19:55:31,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {153143#true} havoc ~__retres1~6; {153143#true} is VALID [2022-02-20 19:55:31,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {153143#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {153143#true} is VALID [2022-02-20 19:55:31,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {153143#true} #res := ~__retres1~6; {153143#true} is VALID [2022-02-20 19:55:31,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,927 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {153143#true} {153144#false} #610#return; {153144#false} is VALID [2022-02-20 19:55:31,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {153144#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {153144#false} is VALID [2022-02-20 19:55:31,928 INFO L290 TraceCheckUtils]: 50: Hoare triple {153144#false} assume 0 != eval2_~tmp~4#1; {153144#false} is VALID [2022-02-20 19:55:31,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {153144#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {153144#false} is VALID [2022-02-20 19:55:31,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {153144#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {153144#false} is VALID [2022-02-20 19:55:31,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {153144#false} assume 0 == ~m_pc~0; {153144#false} is VALID [2022-02-20 19:55:31,928 INFO L290 TraceCheckUtils]: 54: Hoare triple {153144#false} assume !false; {153144#false} is VALID [2022-02-20 19:55:31,928 INFO L290 TraceCheckUtils]: 55: Hoare triple {153144#false} assume -2147483648 <= master_#t~nondet17#1 && master_#t~nondet17#1 <= 2147483647;~token~0 := master_#t~nondet17#1;havoc master_#t~nondet17#1;~local~0 := ~token~0;~E_1~0 := 1; {153144#false} is VALID [2022-02-20 19:55:31,928 INFO L272 TraceCheckUtils]: 56: Hoare triple {153144#false} call immediate_notify(); {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:31,929 INFO L272 TraceCheckUtils]: 57: Hoare triple {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} call activate_threads2(); {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:55:31,929 INFO L290 TraceCheckUtils]: 58: Hoare triple {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~5#1;havoc ~tmp___0~2#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,929 INFO L290 TraceCheckUtils]: 59: Hoare triple {153143#true} assume !(1 == ~m_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,929 INFO L290 TraceCheckUtils]: 60: Hoare triple {153143#true} is_master_triggered_~__retres1~4#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {153143#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {153143#true} is VALID [2022-02-20 19:55:31,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {153143#true} #t~ret21#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647;~tmp~5#1 := #t~ret21#1;havoc #t~ret21#1; {153143#true} is VALID [2022-02-20 19:55:31,929 INFO L290 TraceCheckUtils]: 63: Hoare triple {153143#true} assume !(0 != ~tmp~5#1); {153143#true} is VALID [2022-02-20 19:55:31,930 INFO L290 TraceCheckUtils]: 64: Hoare triple {153143#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,930 INFO L290 TraceCheckUtils]: 65: Hoare triple {153143#true} assume !(1 == ~t1_pc~0); {153143#true} is VALID [2022-02-20 19:55:31,930 INFO L290 TraceCheckUtils]: 66: Hoare triple {153143#true} is_transmit1_triggered_~__retres1~5#1 := 0; {153143#true} is VALID [2022-02-20 19:55:31,930 INFO L290 TraceCheckUtils]: 67: Hoare triple {153143#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {153143#true} is VALID [2022-02-20 19:55:31,930 INFO L290 TraceCheckUtils]: 68: Hoare triple {153143#true} #t~ret22#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret22#1 && #t~ret22#1 <= 2147483647;~tmp___0~2#1 := #t~ret22#1;havoc #t~ret22#1; {153143#true} is VALID [2022-02-20 19:55:31,930 INFO L290 TraceCheckUtils]: 69: Hoare triple {153143#true} assume !(0 != ~tmp___0~2#1); {153143#true} is VALID [2022-02-20 19:55:31,930 INFO L290 TraceCheckUtils]: 70: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,930 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {153143#true} {153202#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} #588#return; {153143#true} is VALID [2022-02-20 19:55:31,930 INFO L290 TraceCheckUtils]: 72: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,931 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {153143#true} {153144#false} #612#return; {153144#false} is VALID [2022-02-20 19:55:31,931 INFO L290 TraceCheckUtils]: 74: Hoare triple {153144#false} ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; {153144#false} is VALID [2022-02-20 19:55:31,931 INFO L290 TraceCheckUtils]: 75: Hoare triple {153144#false} assume { :end_inline_master } true; {153144#false} is VALID [2022-02-20 19:55:31,931 INFO L290 TraceCheckUtils]: 76: Hoare triple {153144#false} assume !(0 == ~t1_st~0); {153144#false} is VALID [2022-02-20 19:55:31,931 INFO L290 TraceCheckUtils]: 77: Hoare triple {153144#false} assume !false; {153144#false} is VALID [2022-02-20 19:55:31,931 INFO L272 TraceCheckUtils]: 78: Hoare triple {153144#false} call eval2_#t~ret18#1 := exists_runnable_thread2(); {153143#true} is VALID [2022-02-20 19:55:31,931 INFO L290 TraceCheckUtils]: 79: Hoare triple {153143#true} havoc ~__retres1~6; {153143#true} is VALID [2022-02-20 19:55:31,931 INFO L290 TraceCheckUtils]: 80: Hoare triple {153143#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {153143#true} is VALID [2022-02-20 19:55:31,931 INFO L290 TraceCheckUtils]: 81: Hoare triple {153143#true} #res := ~__retres1~6; {153143#true} is VALID [2022-02-20 19:55:31,932 INFO L290 TraceCheckUtils]: 82: Hoare triple {153143#true} assume true; {153143#true} is VALID [2022-02-20 19:55:31,932 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {153143#true} {153144#false} #610#return; {153144#false} is VALID [2022-02-20 19:55:31,932 INFO L290 TraceCheckUtils]: 84: Hoare triple {153144#false} assume -2147483648 <= eval2_#t~ret18#1 && eval2_#t~ret18#1 <= 2147483647;eval2_~tmp~4#1 := eval2_#t~ret18#1;havoc eval2_#t~ret18#1; {153144#false} is VALID [2022-02-20 19:55:31,932 INFO L290 TraceCheckUtils]: 85: Hoare triple {153144#false} assume 0 != eval2_~tmp~4#1; {153144#false} is VALID [2022-02-20 19:55:31,932 INFO L290 TraceCheckUtils]: 86: Hoare triple {153144#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet19#1 && eval2_#t~nondet19#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet19#1;havoc eval2_#t~nondet19#1; {153144#false} is VALID [2022-02-20 19:55:31,932 INFO L290 TraceCheckUtils]: 87: Hoare triple {153144#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet17#1; {153144#false} is VALID [2022-02-20 19:55:31,932 INFO L290 TraceCheckUtils]: 88: Hoare triple {153144#false} assume !(0 == ~m_pc~0); {153144#false} is VALID [2022-02-20 19:55:31,932 INFO L290 TraceCheckUtils]: 89: Hoare triple {153144#false} assume 1 == ~m_pc~0; {153144#false} is VALID [2022-02-20 19:55:31,932 INFO L290 TraceCheckUtils]: 90: Hoare triple {153144#false} assume ~token~0 != 1 + ~local~0;assume { :begin_inline_error2 } true; {153144#false} is VALID [2022-02-20 19:55:31,933 INFO L290 TraceCheckUtils]: 91: Hoare triple {153144#false} assume !false; {153144#false} is VALID [2022-02-20 19:55:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 19:55:31,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:55:31,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172963076] [2022-02-20 19:55:31,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172963076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:55:31,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:55:31,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:55:31,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194556884] [2022-02-20 19:55:31,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:55:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2022-02-20 19:55:31,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:55:31,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:55:31,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:55:31,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:55:31,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:55:31,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:55:31,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:55:31,973 INFO L87 Difference]: Start difference. First operand 3682 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7)