./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.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_3.cil+token_ring.04.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 37139db5f2012b0b7a96ab437e26855d856636bc4064d013c0b416905ff6e54c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:37,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:37,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:37,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:37,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:37,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:37,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:37,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:37,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:37,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:37,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:37,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:37,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:37,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:37,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:37,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:37,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:37,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:37,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:37,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:37,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:37,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:37,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:37,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:37,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:37,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:37,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:37,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:37,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:37,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:37,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:37,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:37,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:37,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:37,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:37,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:37,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:37,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:37,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:37,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:37,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:37,960 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:59:37,976 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:37,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:37,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:37,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:37,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:37,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:37,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:37,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:37,978 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:37,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:37,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:37,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:37,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:37,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:37,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:37,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:37,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:37,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:37,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:37,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:37,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:37,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:37,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:37,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:37,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:37,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:37,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:37,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:37,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:37,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:37,983 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:37,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:37,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:37,984 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 -> 37139db5f2012b0b7a96ab437e26855d856636bc4064d013c0b416905ff6e54c [2022-02-20 19:59:38,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:38,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:38,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:38,171 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:38,172 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:38,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c [2022-02-20 19:59:38,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f9b58c2/c5625208917842fba3b2a347e0252ae7/FLAG998244c0c [2022-02-20 19:59:38,548 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:38,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c [2022-02-20 19:59:38,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f9b58c2/c5625208917842fba3b2a347e0252ae7/FLAG998244c0c [2022-02-20 19:59:38,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f9b58c2/c5625208917842fba3b2a347e0252ae7 [2022-02-20 19:59:38,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:38,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:38,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:38,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:38,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:38,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:38" (1/1) ... [2022-02-20 19:59:38,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38259fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:38, skipping insertion in model container [2022-02-20 19:59:38,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:38" (1/1) ... [2022-02-20 19:59:38,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:39,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:39,149 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_3.cil+token_ring.04.cil-1.c[911,924] [2022-02-20 19:59:39,196 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_3.cil+token_ring.04.cil-1.c[8416,8429] [2022-02-20 19:59:39,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:39,256 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:39,263 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_3.cil+token_ring.04.cil-1.c[911,924] [2022-02-20 19:59:39,281 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_3.cil+token_ring.04.cil-1.c[8416,8429] [2022-02-20 19:59:39,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:39,324 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:39,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39 WrapperNode [2022-02-20 19:59:39,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:39,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:39,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:39,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:39,332 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:59:39" (1/1) ... [2022-02-20 19:59:39,348 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:59:39" (1/1) ... [2022-02-20 19:59:39,383 INFO L137 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 614 [2022-02-20 19:59:39,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:39,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:39,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:39,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:39,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:39,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:39,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:39,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:39,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:39,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:39,460 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:59:39,465 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:59:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:39,489 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:39,489 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:39,489 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:39,491 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:39,491 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:39,491 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:39,492 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:39,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:39,492 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:39,579 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:39,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:40,096 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:40,096 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 19:59:40,161 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:40,191 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:40,191 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 19:59:40,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:40 BoogieIcfgContainer [2022-02-20 19:59:40,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:40,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:40,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:40,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:40,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:38" (1/3) ... [2022-02-20 19:59:40,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e179306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:40, skipping insertion in model container [2022-02-20 19:59:40,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (2/3) ... [2022-02-20 19:59:40,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e179306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:40, skipping insertion in model container [2022-02-20 19:59:40,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:40" (3/3) ... [2022-02-20 19:59:40,210 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.04.cil-1.c [2022-02-20 19:59:40,214 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:40,214 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:40,276 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:40,283 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:59:40,284 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 248 states have (on average 1.5846774193548387) internal successors, (393), 254 states have internal predecessors, (393), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-02-20 19:59:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:40,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:40,358 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:40,359 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash 864909050, now seen corresponding path program 1 times [2022-02-20 19:59:40,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:40,369 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532473032] [2022-02-20 19:59:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {342#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:40,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:40,565 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {304#(= ~q_write_ev~0 ~q_read_ev~0)} #1049#return; {304#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {344#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:40,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {345#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:40,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {345#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:40,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {304#(= ~q_write_ev~0 ~q_read_ev~0)} #1051#return; {303#false} is VALID [2022-02-20 19:59:40,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#true} havoc ~__retres1~0; {302#true} is VALID [2022-02-20 19:59:40,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume 1 == ~p_dw_pc~0; {302#true} is VALID [2022-02-20 19:59:40,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {302#true} is VALID [2022-02-20 19:59:40,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {302#true} #res := ~__retres1~0; {302#true} is VALID [2022-02-20 19:59:40,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,655 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {302#true} {302#true} #1045#return; {302#true} is VALID [2022-02-20 19:59:40,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#true} havoc ~__retres1~1; {302#true} is VALID [2022-02-20 19:59:40,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume 1 == ~c_dr_pc~0; {302#true} is VALID [2022-02-20 19:59:40,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {302#true} is VALID [2022-02-20 19:59:40,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {302#true} #res := ~__retres1~1; {302#true} is VALID [2022-02-20 19:59:40,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,660 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {302#true} {302#true} #1047#return; {302#true} is VALID [2022-02-20 19:59:40,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {302#true} is VALID [2022-02-20 19:59:40,661 INFO L272 TraceCheckUtils]: 1: Hoare triple {302#true} call #t~ret8 := is_do_write_p_triggered(); {302#true} is VALID [2022-02-20 19:59:40,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} havoc ~__retres1~0; {302#true} is VALID [2022-02-20 19:59:40,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {302#true} assume 1 == ~p_dw_pc~0; {302#true} is VALID [2022-02-20 19:59:40,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {302#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {302#true} is VALID [2022-02-20 19:59:40,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#true} #res := ~__retres1~0; {302#true} is VALID [2022-02-20 19:59:40,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,662 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {302#true} {302#true} #1045#return; {302#true} is VALID [2022-02-20 19:59:40,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {302#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {302#true} is VALID [2022-02-20 19:59:40,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {302#true} is VALID [2022-02-20 19:59:40,663 INFO L272 TraceCheckUtils]: 10: Hoare triple {302#true} call #t~ret9 := is_do_read_c_triggered(); {302#true} is VALID [2022-02-20 19:59:40,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#true} havoc ~__retres1~1; {302#true} is VALID [2022-02-20 19:59:40,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {302#true} assume 1 == ~c_dr_pc~0; {302#true} is VALID [2022-02-20 19:59:40,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {302#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {302#true} is VALID [2022-02-20 19:59:40,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {302#true} #res := ~__retres1~1; {302#true} is VALID [2022-02-20 19:59:40,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,664 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {302#true} {302#true} #1047#return; {302#true} is VALID [2022-02-20 19:59:40,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {302#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {302#true} is VALID [2022-02-20 19:59:40,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {302#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {302#true} is VALID [2022-02-20 19:59:40,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,665 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {302#true} {303#false} #1053#return; {303#false} is VALID [2022-02-20 19:59:40,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {302#true} is VALID [2022-02-20 19:59:40,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {302#true} is VALID [2022-02-20 19:59:40,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {302#true} {303#false} #1055#return; {303#false} is VALID [2022-02-20 19:59:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#true} havoc ~__retres1~2; {302#true} is VALID [2022-02-20 19:59:40,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {302#true} is VALID [2022-02-20 19:59:40,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} #res := ~__retres1~2; {302#true} is VALID [2022-02-20 19:59:40,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,677 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {302#true} {303#false} #1057#return; {303#false} is VALID [2022-02-20 19:59:40,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {302#true} is VALID [2022-02-20 19:59:40,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {302#true} is VALID [2022-02-20 19:59:40,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {304#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {304#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {304#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {304#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {342#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:40,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {342#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:40,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:40,681 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {304#(= ~q_write_ev~0 ~q_read_ev~0)} #1049#return; {304#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {304#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {304#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {304#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {304#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {304#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {304#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {304#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {304#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,683 INFO L272 TraceCheckUtils]: 12: Hoare triple {304#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:40,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {344#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:40,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {344#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {345#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:40,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {345#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {345#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:40,685 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {345#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {304#(= ~q_write_ev~0 ~q_read_ev~0)} #1051#return; {303#false} is VALID [2022-02-20 19:59:40,685 INFO L272 TraceCheckUtils]: 17: Hoare triple {303#false} call activate_threads1(); {346#(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:59:40,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {346#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {302#true} is VALID [2022-02-20 19:59:40,686 INFO L272 TraceCheckUtils]: 19: Hoare triple {302#true} call #t~ret8 := is_do_write_p_triggered(); {302#true} is VALID [2022-02-20 19:59:40,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {302#true} havoc ~__retres1~0; {302#true} is VALID [2022-02-20 19:59:40,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {302#true} assume 1 == ~p_dw_pc~0; {302#true} is VALID [2022-02-20 19:59:40,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {302#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {302#true} is VALID [2022-02-20 19:59:40,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {302#true} #res := ~__retres1~0; {302#true} is VALID [2022-02-20 19:59:40,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,687 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {302#true} {302#true} #1045#return; {302#true} is VALID [2022-02-20 19:59:40,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {302#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {302#true} is VALID [2022-02-20 19:59:40,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {302#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {302#true} is VALID [2022-02-20 19:59:40,687 INFO L272 TraceCheckUtils]: 28: Hoare triple {302#true} call #t~ret9 := is_do_read_c_triggered(); {302#true} is VALID [2022-02-20 19:59:40,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {302#true} havoc ~__retres1~1; {302#true} is VALID [2022-02-20 19:59:40,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {302#true} assume 1 == ~c_dr_pc~0; {302#true} is VALID [2022-02-20 19:59:40,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {302#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {302#true} is VALID [2022-02-20 19:59:40,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {302#true} #res := ~__retres1~1; {302#true} is VALID [2022-02-20 19:59:40,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,688 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {302#true} {302#true} #1047#return; {302#true} is VALID [2022-02-20 19:59:40,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {302#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {302#true} is VALID [2022-02-20 19:59:40,689 INFO L290 TraceCheckUtils]: 36: Hoare triple {302#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {302#true} is VALID [2022-02-20 19:59:40,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,689 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {302#true} {303#false} #1053#return; {303#false} is VALID [2022-02-20 19:59:40,689 INFO L272 TraceCheckUtils]: 39: Hoare triple {303#false} call reset_delta_events1(); {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:40,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {343#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {302#true} is VALID [2022-02-20 19:59:40,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {302#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {302#true} is VALID [2022-02-20 19:59:40,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,690 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {302#true} {303#false} #1055#return; {303#false} is VALID [2022-02-20 19:59:40,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-02-20 19:59:40,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {303#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {303#false} is VALID [2022-02-20 19:59:40,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-02-20 19:59:40,704 INFO L272 TraceCheckUtils]: 47: Hoare triple {303#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {302#true} is VALID [2022-02-20 19:59:40,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {302#true} havoc ~__retres1~2; {302#true} is VALID [2022-02-20 19:59:40,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {302#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {302#true} is VALID [2022-02-20 19:59:40,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {302#true} #res := ~__retres1~2; {302#true} is VALID [2022-02-20 19:59:40,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {302#true} assume true; {302#true} is VALID [2022-02-20 19:59:40,709 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {302#true} {303#false} #1057#return; {303#false} is VALID [2022-02-20 19:59:40,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {303#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {303#false} is VALID [2022-02-20 19:59:40,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {303#false} assume 0 != eval1_~tmp___1~0#1; {303#false} is VALID [2022-02-20 19:59:40,710 INFO L290 TraceCheckUtils]: 55: Hoare triple {303#false} assume !(0 == ~p_dw_st~0); {303#false} is VALID [2022-02-20 19:59:40,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {303#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {303#false} is VALID [2022-02-20 19:59:40,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {303#false} assume 0 != eval1_~tmp___0~2#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; {303#false} is VALID [2022-02-20 19:59:40,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {303#false} assume !(0 == ~c_dr_pc~0); {303#false} is VALID [2022-02-20 19:59:40,712 INFO L290 TraceCheckUtils]: 59: Hoare triple {303#false} assume 2 == ~c_dr_pc~0; {303#false} is VALID [2022-02-20 19:59:40,712 INFO L290 TraceCheckUtils]: 60: Hoare triple {303#false} do_read_c_~a~0#1 := ~a_t~0; {303#false} is VALID [2022-02-20 19:59:40,712 INFO L290 TraceCheckUtils]: 61: Hoare triple {303#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_req_up~0 := 1; {303#false} is VALID [2022-02-20 19:59:40,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {303#false} assume !(~p_last_write~0 == ~c_last_read~0); {303#false} is VALID [2022-02-20 19:59:40,713 INFO L272 TraceCheckUtils]: 63: Hoare triple {303#false} call error1(); {303#false} is VALID [2022-02-20 19:59:40,713 INFO L290 TraceCheckUtils]: 64: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-02-20 19:59:40,715 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:59:40,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:40,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532473032] [2022-02-20 19:59:40,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532473032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:40,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:40,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:40,718 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833854862] [2022-02-20 19:59:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:40,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:40,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:40,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:40,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:40,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:40,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:40,809 INFO L87 Difference]: Start difference. First operand has 299 states, 248 states have (on average 1.5846774193548387) internal successors, (393), 254 states have internal predecessors, (393), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:43,758 INFO L93 Difference]: Finished difference Result 764 states and 1182 transitions. [2022-02-20 19:59:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:43,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:59:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1182 transitions. [2022-02-20 19:59:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1182 transitions. [2022-02-20 19:59:43,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1182 transitions. [2022-02-20 19:59:44,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1182 edges. 1182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:44,601 INFO L225 Difference]: With dead ends: 764 [2022-02-20 19:59:44,601 INFO L226 Difference]: Without dead ends: 475 [2022-02-20 19:59:44,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:44,610 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 1058 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:44,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1083 Valid, 1639 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-02-20 19:59:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 405. [2022-02-20 19:59:44,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:44,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 405 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 340 states have internal predecessors, (493), 47 states have call successors, (47), 21 states have call predecessors, (47), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2022-02-20 19:59:44,694 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 405 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 340 states have internal predecessors, (493), 47 states have call successors, (47), 21 states have call predecessors, (47), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2022-02-20 19:59:44,695 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 405 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 340 states have internal predecessors, (493), 47 states have call successors, (47), 21 states have call predecessors, (47), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2022-02-20 19:59:44,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:44,747 INFO L93 Difference]: Finished difference Result 475 states and 704 transitions. [2022-02-20 19:59:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 704 transitions. [2022-02-20 19:59:44,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:44,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:44,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 405 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 340 states have internal predecessors, (493), 47 states have call successors, (47), 21 states have call predecessors, (47), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) Second operand 475 states. [2022-02-20 19:59:44,753 INFO L87 Difference]: Start difference. First operand has 405 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 340 states have internal predecessors, (493), 47 states have call successors, (47), 21 states have call predecessors, (47), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) Second operand 475 states. [2022-02-20 19:59:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:44,800 INFO L93 Difference]: Finished difference Result 475 states and 704 transitions. [2022-02-20 19:59:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 704 transitions. [2022-02-20 19:59:44,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:44,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:44,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:44,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 340 states have internal predecessors, (493), 47 states have call successors, (47), 21 states have call predecessors, (47), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2022-02-20 19:59:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 596 transitions. [2022-02-20 19:59:44,835 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 596 transitions. Word has length 65 [2022-02-20 19:59:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:44,836 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 596 transitions. [2022-02-20 19:59:44,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 596 transitions. [2022-02-20 19:59:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:44,838 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:44,838 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:44,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:44,838 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:44,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1163677060, now seen corresponding path program 1 times [2022-02-20 19:59:44,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:44,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536281891] [2022-02-20 19:59:44,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:44,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {2954#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {2955#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:44,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {2955#(not (= |old(~q_req_up~0)| 1))} assume true; {2955#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:44,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2955#(not (= |old(~q_req_up~0)| 1))} {2915#(= ~q_req_up~0 ~p_dw_pc~0)} #1049#return; {2919#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {2956#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {2912#true} is VALID [2022-02-20 19:59:44,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {2912#true} assume !(0 == ~q_write_ev~0); {2912#true} is VALID [2022-02-20 19:59:44,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-02-20 19:59:44,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2912#true} {2919#(not (= ~p_dw_pc~0 1))} #1051#return; {2919#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:44,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {2912#true} havoc ~__retres1~0; {2912#true} is VALID [2022-02-20 19:59:44,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {2912#true} assume 1 == ~p_dw_pc~0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,955 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} {2912#true} #1045#return; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {2912#true} havoc ~__retres1~1; {2912#true} is VALID [2022-02-20 19:59:44,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {2912#true} assume 1 == ~c_dr_pc~0; {2912#true} is VALID [2022-02-20 19:59:44,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2912#true} is VALID [2022-02-20 19:59:44,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {2912#true} #res := ~__retres1~1; {2912#true} is VALID [2022-02-20 19:59:44,960 INFO L290 TraceCheckUtils]: 4: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-02-20 19:59:44,960 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2912#true} {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} #1047#return; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {2957#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {2912#true} is VALID [2022-02-20 19:59:44,961 INFO L272 TraceCheckUtils]: 1: Hoare triple {2912#true} call #t~ret8 := is_do_write_p_triggered(); {2912#true} is VALID [2022-02-20 19:59:44,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#true} havoc ~__retres1~0; {2912#true} is VALID [2022-02-20 19:59:44,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {2912#true} assume 1 == ~p_dw_pc~0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,968 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} {2912#true} #1045#return; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,969 INFO L272 TraceCheckUtils]: 10: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2912#true} is VALID [2022-02-20 19:59:44,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {2912#true} havoc ~__retres1~1; {2912#true} is VALID [2022-02-20 19:59:44,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {2912#true} assume 1 == ~c_dr_pc~0; {2912#true} is VALID [2022-02-20 19:59:44,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {2912#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2912#true} is VALID [2022-02-20 19:59:44,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {2912#true} #res := ~__retres1~1; {2912#true} is VALID [2022-02-20 19:59:44,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-02-20 19:59:44,970 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2912#true} {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} #1047#return; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,971 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} {2919#(not (= ~p_dw_pc~0 1))} #1053#return; {2913#false} is VALID [2022-02-20 19:59:44,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {2956#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {2912#true} is VALID [2022-02-20 19:59:44,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {2912#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2912#true} is VALID [2022-02-20 19:59:44,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-02-20 19:59:44,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2912#true} {2913#false} #1055#return; {2913#false} is VALID [2022-02-20 19:59:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:44,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {2912#true} havoc ~__retres1~2; {2912#true} is VALID [2022-02-20 19:59:44,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {2912#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2912#true} is VALID [2022-02-20 19:59:44,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#true} #res := ~__retres1~2; {2912#true} is VALID [2022-02-20 19:59:44,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-02-20 19:59:44,981 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2912#true} {2913#false} #1057#return; {2913#false} is VALID [2022-02-20 19:59:44,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {2912#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {2914#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:44,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {2914#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {2914#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:44,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {2914#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {2915#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:44,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {2915#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {2915#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:44,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {2915#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {2954#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:44,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {2954#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {2955#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:44,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {2955#(not (= |old(~q_req_up~0)| 1))} assume true; {2955#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:44,985 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2955#(not (= |old(~q_req_up~0)| 1))} {2915#(= ~q_req_up~0 ~p_dw_pc~0)} #1049#return; {2919#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:44,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {2919#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {2919#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:44,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {2919#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2919#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:44,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {2919#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2919#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:44,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {2919#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {2919#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:44,986 INFO L272 TraceCheckUtils]: 12: Hoare triple {2919#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {2956#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:44,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {2956#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {2912#true} is VALID [2022-02-20 19:59:44,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {2912#true} assume !(0 == ~q_write_ev~0); {2912#true} is VALID [2022-02-20 19:59:44,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-02-20 19:59:44,987 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2912#true} {2919#(not (= ~p_dw_pc~0 1))} #1051#return; {2919#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:44,988 INFO L272 TraceCheckUtils]: 17: Hoare triple {2919#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {2957#(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:59:44,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {2957#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {2912#true} is VALID [2022-02-20 19:59:44,988 INFO L272 TraceCheckUtils]: 19: Hoare triple {2912#true} call #t~ret8 := is_do_write_p_triggered(); {2912#true} is VALID [2022-02-20 19:59:44,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {2912#true} havoc ~__retres1~0; {2912#true} is VALID [2022-02-20 19:59:44,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {2912#true} assume 1 == ~p_dw_pc~0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,990 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} {2912#true} #1045#return; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,991 INFO L272 TraceCheckUtils]: 28: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2912#true} is VALID [2022-02-20 19:59:44,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {2912#true} havoc ~__retres1~1; {2912#true} is VALID [2022-02-20 19:59:44,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {2912#true} assume 1 == ~c_dr_pc~0; {2912#true} is VALID [2022-02-20 19:59:44,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {2912#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {2912#true} is VALID [2022-02-20 19:59:44,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {2912#true} #res := ~__retres1~1; {2912#true} is VALID [2022-02-20 19:59:44,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-02-20 19:59:44,992 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2912#true} {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} #1047#return; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:44,994 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2964#(= (+ (- 1) ~p_dw_pc~0) 0)} {2919#(not (= ~p_dw_pc~0 1))} #1053#return; {2913#false} is VALID [2022-02-20 19:59:44,994 INFO L272 TraceCheckUtils]: 39: Hoare triple {2913#false} call reset_delta_events1(); {2956#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:44,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {2956#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {2912#true} is VALID [2022-02-20 19:59:44,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {2912#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2912#true} is VALID [2022-02-20 19:59:44,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-02-20 19:59:44,995 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2912#true} {2913#false} #1055#return; {2913#false} is VALID [2022-02-20 19:59:44,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {2913#false} assume !false; {2913#false} is VALID [2022-02-20 19:59:44,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {2913#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {2913#false} is VALID [2022-02-20 19:59:44,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {2913#false} assume !false; {2913#false} is VALID [2022-02-20 19:59:44,995 INFO L272 TraceCheckUtils]: 47: Hoare triple {2913#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2912#true} is VALID [2022-02-20 19:59:44,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {2912#true} havoc ~__retres1~2; {2912#true} is VALID [2022-02-20 19:59:44,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {2912#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2912#true} is VALID [2022-02-20 19:59:44,996 INFO L290 TraceCheckUtils]: 50: Hoare triple {2912#true} #res := ~__retres1~2; {2912#true} is VALID [2022-02-20 19:59:44,996 INFO L290 TraceCheckUtils]: 51: Hoare triple {2912#true} assume true; {2912#true} is VALID [2022-02-20 19:59:44,996 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2912#true} {2913#false} #1057#return; {2913#false} is VALID [2022-02-20 19:59:44,996 INFO L290 TraceCheckUtils]: 53: Hoare triple {2913#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {2913#false} is VALID [2022-02-20 19:59:44,996 INFO L290 TraceCheckUtils]: 54: Hoare triple {2913#false} assume 0 != eval1_~tmp___1~0#1; {2913#false} is VALID [2022-02-20 19:59:44,997 INFO L290 TraceCheckUtils]: 55: Hoare triple {2913#false} assume !(0 == ~p_dw_st~0); {2913#false} is VALID [2022-02-20 19:59:44,997 INFO L290 TraceCheckUtils]: 56: Hoare triple {2913#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {2913#false} is VALID [2022-02-20 19:59:44,997 INFO L290 TraceCheckUtils]: 57: Hoare triple {2913#false} assume 0 != eval1_~tmp___0~2#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; {2913#false} is VALID [2022-02-20 19:59:44,997 INFO L290 TraceCheckUtils]: 58: Hoare triple {2913#false} assume !(0 == ~c_dr_pc~0); {2913#false} is VALID [2022-02-20 19:59:44,997 INFO L290 TraceCheckUtils]: 59: Hoare triple {2913#false} assume 2 == ~c_dr_pc~0; {2913#false} is VALID [2022-02-20 19:59:44,997 INFO L290 TraceCheckUtils]: 60: Hoare triple {2913#false} do_read_c_~a~0#1 := ~a_t~0; {2913#false} is VALID [2022-02-20 19:59:44,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {2913#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_req_up~0 := 1; {2913#false} is VALID [2022-02-20 19:59:44,998 INFO L290 TraceCheckUtils]: 62: Hoare triple {2913#false} assume !(~p_last_write~0 == ~c_last_read~0); {2913#false} is VALID [2022-02-20 19:59:44,998 INFO L272 TraceCheckUtils]: 63: Hoare triple {2913#false} call error1(); {2913#false} is VALID [2022-02-20 19:59:44,998 INFO L290 TraceCheckUtils]: 64: Hoare triple {2913#false} assume !false; {2913#false} is VALID [2022-02-20 19:59:44,998 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:59:44,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:44,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536281891] [2022-02-20 19:59:44,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536281891] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:44,999 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:44,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:44,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390429527] [2022-02-20 19:59:44,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:45,001 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:59:45,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:45,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:45,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:45,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:45,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:45,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:45,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:45,042 INFO L87 Difference]: Start difference. First operand 405 states and 596 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,306 INFO L93 Difference]: Finished difference Result 1498 states and 2175 transitions. [2022-02-20 19:59:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:50,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 19:59:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1237 transitions. [2022-02-20 19:59:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1237 transitions. [2022-02-20 19:59:50,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1237 transitions. [2022-02-20 19:59:51,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1237 edges. 1237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:51,482 INFO L225 Difference]: With dead ends: 1498 [2022-02-20 19:59:51,482 INFO L226 Difference]: Without dead ends: 1273 [2022-02-20 19:59:51,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:51,484 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 2711 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2729 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:51,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2729 Valid, 2014 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 19:59:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2022-02-20 19:59:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1177. [2022-02-20 19:59:51,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:51,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1273 states. Second operand has 1177 states, 951 states have (on average 1.4111461619348056) internal successors, (1342), 971 states have internal predecessors, (1342), 130 states have call successors, (130), 81 states have call predecessors, (130), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) [2022-02-20 19:59:51,543 INFO L74 IsIncluded]: Start isIncluded. First operand 1273 states. Second operand has 1177 states, 951 states have (on average 1.4111461619348056) internal successors, (1342), 971 states have internal predecessors, (1342), 130 states have call successors, (130), 81 states have call predecessors, (130), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) [2022-02-20 19:59:51,545 INFO L87 Difference]: Start difference. First operand 1273 states. Second operand has 1177 states, 951 states have (on average 1.4111461619348056) internal successors, (1342), 971 states have internal predecessors, (1342), 130 states have call successors, (130), 81 states have call predecessors, (130), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) [2022-02-20 19:59:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,604 INFO L93 Difference]: Finished difference Result 1273 states and 1762 transitions. [2022-02-20 19:59:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1762 transitions. [2022-02-20 19:59:51,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 951 states have (on average 1.4111461619348056) internal successors, (1342), 971 states have internal predecessors, (1342), 130 states have call successors, (130), 81 states have call predecessors, (130), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) Second operand 1273 states. [2022-02-20 19:59:51,616 INFO L87 Difference]: Start difference. First operand has 1177 states, 951 states have (on average 1.4111461619348056) internal successors, (1342), 971 states have internal predecessors, (1342), 130 states have call successors, (130), 81 states have call predecessors, (130), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) Second operand 1273 states. [2022-02-20 19:59:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:51,672 INFO L93 Difference]: Finished difference Result 1273 states and 1762 transitions. [2022-02-20 19:59:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1762 transitions. [2022-02-20 19:59:51,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:51,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:51,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:51,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 951 states have (on average 1.4111461619348056) internal successors, (1342), 971 states have internal predecessors, (1342), 130 states have call successors, (130), 81 states have call predecessors, (130), 94 states have return successors, (161), 127 states have call predecessors, (161), 128 states have call successors, (161) [2022-02-20 19:59:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1633 transitions. [2022-02-20 19:59:51,757 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1633 transitions. Word has length 65 [2022-02-20 19:59:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:51,758 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 1633 transitions. [2022-02-20 19:59:51,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:59:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1633 transitions. [2022-02-20 19:59:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:51,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:51,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:51,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:51,762 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1733422016, now seen corresponding path program 1 times [2022-02-20 19:59:51,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:51,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148868239] [2022-02-20 19:59:51,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {9234#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {9194#true} is VALID [2022-02-20 19:59:51,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9194#true} {9194#true} #1049#return; {9194#true} is VALID [2022-02-20 19:59:51,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {9235#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {9194#true} is VALID [2022-02-20 19:59:51,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {9194#true} assume !(0 == ~q_write_ev~0); {9194#true} is VALID [2022-02-20 19:59:51,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9194#true} {9194#true} #1051#return; {9194#true} is VALID [2022-02-20 19:59:51,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {9194#true} havoc ~__retres1~0; {9194#true} is VALID [2022-02-20 19:59:51,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {9194#true} assume !(1 == ~p_dw_pc~0); {9194#true} is VALID [2022-02-20 19:59:51,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {9194#true} assume !(2 == ~p_dw_pc~0); {9194#true} is VALID [2022-02-20 19:59:51,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {9194#true} ~__retres1~0 := 0; {9252#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:51,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {9252#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:51,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:51,914 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {9194#true} #1045#return; {9244#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:51,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {9194#true} havoc ~__retres1~1; {9194#true} is VALID [2022-02-20 19:59:51,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {9194#true} assume 1 == ~c_dr_pc~0; {9194#true} is VALID [2022-02-20 19:59:51,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {9194#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9194#true} is VALID [2022-02-20 19:59:51,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {9194#true} #res := ~__retres1~1; {9194#true} is VALID [2022-02-20 19:59:51,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,918 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9194#true} {9195#false} #1047#return; {9195#false} is VALID [2022-02-20 19:59:51,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {9236#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {9194#true} is VALID [2022-02-20 19:59:51,919 INFO L272 TraceCheckUtils]: 1: Hoare triple {9194#true} call #t~ret8 := is_do_write_p_triggered(); {9194#true} is VALID [2022-02-20 19:59:51,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {9194#true} havoc ~__retres1~0; {9194#true} is VALID [2022-02-20 19:59:51,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {9194#true} assume !(1 == ~p_dw_pc~0); {9194#true} is VALID [2022-02-20 19:59:51,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {9194#true} assume !(2 == ~p_dw_pc~0); {9194#true} is VALID [2022-02-20 19:59:51,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {9194#true} ~__retres1~0 := 0; {9252#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:51,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {9252#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:51,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:51,928 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {9194#true} #1045#return; {9244#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:51,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {9244#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {9245#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:51,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {9245#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {9195#false} is VALID [2022-02-20 19:59:51,929 INFO L272 TraceCheckUtils]: 11: Hoare triple {9195#false} call #t~ret9 := is_do_read_c_triggered(); {9194#true} is VALID [2022-02-20 19:59:51,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {9194#true} havoc ~__retres1~1; {9194#true} is VALID [2022-02-20 19:59:51,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {9194#true} assume 1 == ~c_dr_pc~0; {9194#true} is VALID [2022-02-20 19:59:51,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {9194#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9194#true} is VALID [2022-02-20 19:59:51,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {9194#true} #res := ~__retres1~1; {9194#true} is VALID [2022-02-20 19:59:51,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,930 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9194#true} {9195#false} #1047#return; {9195#false} is VALID [2022-02-20 19:59:51,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {9195#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9195#false} is VALID [2022-02-20 19:59:51,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {9195#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9195#false} is VALID [2022-02-20 19:59:51,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {9195#false} assume true; {9195#false} is VALID [2022-02-20 19:59:51,931 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9195#false} {9194#true} #1053#return; {9195#false} is VALID [2022-02-20 19:59:51,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {9235#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {9194#true} is VALID [2022-02-20 19:59:51,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {9194#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9194#true} is VALID [2022-02-20 19:59:51,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9194#true} {9195#false} #1055#return; {9195#false} is VALID [2022-02-20 19:59:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {9194#true} havoc ~__retres1~2; {9194#true} is VALID [2022-02-20 19:59:51,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {9194#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9194#true} is VALID [2022-02-20 19:59:51,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {9194#true} #res := ~__retres1~2; {9194#true} is VALID [2022-02-20 19:59:51,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,939 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9194#true} {9195#false} #1057#return; {9195#false} is VALID [2022-02-20 19:59:51,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {9194#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {9194#true} is VALID [2022-02-20 19:59:51,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {9194#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {9194#true} is VALID [2022-02-20 19:59:51,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {9194#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {9194#true} is VALID [2022-02-20 19:59:51,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {9194#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {9194#true} is VALID [2022-02-20 19:59:51,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {9194#true} call update_channels1(); {9234#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:51,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {9234#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {9194#true} is VALID [2022-02-20 19:59:51,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,941 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9194#true} {9194#true} #1049#return; {9194#true} is VALID [2022-02-20 19:59:51,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {9194#true} assume { :begin_inline_init_threads1 } true; {9194#true} is VALID [2022-02-20 19:59:51,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {9194#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {9194#true} is VALID [2022-02-20 19:59:51,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {9194#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {9194#true} is VALID [2022-02-20 19:59:51,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {9194#true} assume { :end_inline_init_threads1 } true; {9194#true} is VALID [2022-02-20 19:59:51,942 INFO L272 TraceCheckUtils]: 12: Hoare triple {9194#true} call fire_delta_events1(); {9235#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:51,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {9235#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {9194#true} is VALID [2022-02-20 19:59:51,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {9194#true} assume !(0 == ~q_write_ev~0); {9194#true} is VALID [2022-02-20 19:59:51,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,943 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9194#true} {9194#true} #1051#return; {9194#true} is VALID [2022-02-20 19:59:51,943 INFO L272 TraceCheckUtils]: 17: Hoare triple {9194#true} call activate_threads1(); {9236#(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:59:51,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {9236#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {9194#true} is VALID [2022-02-20 19:59:51,943 INFO L272 TraceCheckUtils]: 19: Hoare triple {9194#true} call #t~ret8 := is_do_write_p_triggered(); {9194#true} is VALID [2022-02-20 19:59:51,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {9194#true} havoc ~__retres1~0; {9194#true} is VALID [2022-02-20 19:59:51,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {9194#true} assume !(1 == ~p_dw_pc~0); {9194#true} is VALID [2022-02-20 19:59:51,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {9194#true} assume !(2 == ~p_dw_pc~0); {9194#true} is VALID [2022-02-20 19:59:51,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {9194#true} ~__retres1~0 := 0; {9252#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:51,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {9252#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:51,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:51,945 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9253#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {9194#true} #1045#return; {9244#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:51,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {9244#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {9245#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:51,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {9245#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {9195#false} is VALID [2022-02-20 19:59:51,947 INFO L272 TraceCheckUtils]: 29: Hoare triple {9195#false} call #t~ret9 := is_do_read_c_triggered(); {9194#true} is VALID [2022-02-20 19:59:51,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {9194#true} havoc ~__retres1~1; {9194#true} is VALID [2022-02-20 19:59:51,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {9194#true} assume 1 == ~c_dr_pc~0; {9194#true} is VALID [2022-02-20 19:59:51,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {9194#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {9194#true} is VALID [2022-02-20 19:59:51,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {9194#true} #res := ~__retres1~1; {9194#true} is VALID [2022-02-20 19:59:51,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,947 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9194#true} {9195#false} #1047#return; {9195#false} is VALID [2022-02-20 19:59:51,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {9195#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {9195#false} is VALID [2022-02-20 19:59:51,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {9195#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {9195#false} is VALID [2022-02-20 19:59:51,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {9195#false} assume true; {9195#false} is VALID [2022-02-20 19:59:51,948 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9195#false} {9194#true} #1053#return; {9195#false} is VALID [2022-02-20 19:59:51,948 INFO L272 TraceCheckUtils]: 40: Hoare triple {9195#false} call reset_delta_events1(); {9235#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:51,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {9235#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {9194#true} is VALID [2022-02-20 19:59:51,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {9194#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {9194#true} is VALID [2022-02-20 19:59:51,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,949 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9194#true} {9195#false} #1055#return; {9195#false} is VALID [2022-02-20 19:59:51,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {9195#false} assume !false; {9195#false} is VALID [2022-02-20 19:59:51,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {9195#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {9195#false} is VALID [2022-02-20 19:59:51,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {9195#false} assume !false; {9195#false} is VALID [2022-02-20 19:59:51,949 INFO L272 TraceCheckUtils]: 48: Hoare triple {9195#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {9194#true} is VALID [2022-02-20 19:59:51,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {9194#true} havoc ~__retres1~2; {9194#true} is VALID [2022-02-20 19:59:51,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {9194#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {9194#true} is VALID [2022-02-20 19:59:51,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {9194#true} #res := ~__retres1~2; {9194#true} is VALID [2022-02-20 19:59:51,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {9194#true} assume true; {9194#true} is VALID [2022-02-20 19:59:51,950 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9194#true} {9195#false} #1057#return; {9195#false} is VALID [2022-02-20 19:59:51,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {9195#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {9195#false} is VALID [2022-02-20 19:59:51,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {9195#false} assume 0 != eval1_~tmp___1~0#1; {9195#false} is VALID [2022-02-20 19:59:51,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {9195#false} assume !(0 == ~p_dw_st~0); {9195#false} is VALID [2022-02-20 19:59:51,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {9195#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {9195#false} is VALID [2022-02-20 19:59:51,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {9195#false} assume 0 != eval1_~tmp___0~2#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; {9195#false} is VALID [2022-02-20 19:59:51,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {9195#false} assume !(0 == ~c_dr_pc~0); {9195#false} is VALID [2022-02-20 19:59:51,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {9195#false} assume 2 == ~c_dr_pc~0; {9195#false} is VALID [2022-02-20 19:59:51,951 INFO L290 TraceCheckUtils]: 61: Hoare triple {9195#false} do_read_c_~a~0#1 := ~a_t~0; {9195#false} is VALID [2022-02-20 19:59:51,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {9195#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_req_up~0 := 1; {9195#false} is VALID [2022-02-20 19:59:51,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {9195#false} assume !(~p_last_write~0 == ~c_last_read~0); {9195#false} is VALID [2022-02-20 19:59:51,952 INFO L272 TraceCheckUtils]: 64: Hoare triple {9195#false} call error1(); {9195#false} is VALID [2022-02-20 19:59:51,952 INFO L290 TraceCheckUtils]: 65: Hoare triple {9195#false} assume !false; {9195#false} is VALID [2022-02-20 19:59:51,952 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:59:51,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:51,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148868239] [2022-02-20 19:59:51,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148868239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:51,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:51,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:51,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283396699] [2022-02-20 19:59:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:59:51,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:51,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:51,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:51,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:51,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:51,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:51,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:51,992 INFO L87 Difference]: Start difference. First operand 1177 states and 1633 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:54,545 INFO L93 Difference]: Finished difference Result 2277 states and 3157 transitions. [2022-02-20 19:59:54,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:54,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:59:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 607 transitions. [2022-02-20 19:59:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 607 transitions. [2022-02-20 19:59:54,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 607 transitions. [2022-02-20 19:59:54,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:55,041 INFO L225 Difference]: With dead ends: 2277 [2022-02-20 19:59:55,041 INFO L226 Difference]: Without dead ends: 1287 [2022-02-20 19:59:55,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:55,044 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 511 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:55,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 1678 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:55,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2022-02-20 19:59:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1217. [2022-02-20 19:59:55,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:55,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1287 states. Second operand has 1217 states, 983 states have (on average 1.3957273652085453) internal successors, (1372), 1003 states have internal predecessors, (1372), 130 states have call successors, (130), 81 states have call predecessors, (130), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) [2022-02-20 19:59:55,112 INFO L74 IsIncluded]: Start isIncluded. First operand 1287 states. Second operand has 1217 states, 983 states have (on average 1.3957273652085453) internal successors, (1372), 1003 states have internal predecessors, (1372), 130 states have call successors, (130), 81 states have call predecessors, (130), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) [2022-02-20 19:59:55,114 INFO L87 Difference]: Start difference. First operand 1287 states. Second operand has 1217 states, 983 states have (on average 1.3957273652085453) internal successors, (1372), 1003 states have internal predecessors, (1372), 130 states have call successors, (130), 81 states have call predecessors, (130), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) [2022-02-20 19:59:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:55,172 INFO L93 Difference]: Finished difference Result 1287 states and 1777 transitions. [2022-02-20 19:59:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1777 transitions. [2022-02-20 19:59:55,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:55,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:55,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 1217 states, 983 states have (on average 1.3957273652085453) internal successors, (1372), 1003 states have internal predecessors, (1372), 130 states have call successors, (130), 81 states have call predecessors, (130), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) Second operand 1287 states. [2022-02-20 19:59:55,179 INFO L87 Difference]: Start difference. First operand has 1217 states, 983 states have (on average 1.3957273652085453) internal successors, (1372), 1003 states have internal predecessors, (1372), 130 states have call successors, (130), 81 states have call predecessors, (130), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) Second operand 1287 states. [2022-02-20 19:59:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:55,243 INFO L93 Difference]: Finished difference Result 1287 states and 1777 transitions. [2022-02-20 19:59:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1777 transitions. [2022-02-20 19:59:55,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:55,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:55,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:55,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 983 states have (on average 1.3957273652085453) internal successors, (1372), 1003 states have internal predecessors, (1372), 130 states have call successors, (130), 81 states have call predecessors, (130), 102 states have return successors, (169), 135 states have call predecessors, (169), 128 states have call successors, (169) [2022-02-20 19:59:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1671 transitions. [2022-02-20 19:59:55,316 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1671 transitions. Word has length 66 [2022-02-20 19:59:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:55,316 INFO L470 AbstractCegarLoop]: Abstraction has 1217 states and 1671 transitions. [2022-02-20 19:59:55,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1671 transitions. [2022-02-20 19:59:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:55,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:55,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:55,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:55,319 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 704062718, now seen corresponding path program 1 times [2022-02-20 19:59:55,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:55,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698878707] [2022-02-20 19:59:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {16576#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {16577#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:55,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {16577#(not (= |old(~q_req_up~0)| 1))} assume true; {16577#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:55,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16577#(not (= |old(~q_req_up~0)| 1))} {16536#(= ~c_dr_pc~0 ~q_req_up~0)} #1049#return; {16540#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:55,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {16578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {16533#true} is VALID [2022-02-20 19:59:55,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {16533#true} assume !(0 == ~q_write_ev~0); {16533#true} is VALID [2022-02-20 19:59:55,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {16533#true} assume true; {16533#true} is VALID [2022-02-20 19:59:55,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16533#true} {16540#(not (= ~c_dr_pc~0 1))} #1051#return; {16540#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:55,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {16533#true} havoc ~__retres1~0; {16533#true} is VALID [2022-02-20 19:59:55,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {16533#true} assume !(1 == ~p_dw_pc~0); {16533#true} is VALID [2022-02-20 19:59:55,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {16533#true} assume !(2 == ~p_dw_pc~0); {16533#true} is VALID [2022-02-20 19:59:55,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {16533#true} ~__retres1~0 := 0; {16533#true} is VALID [2022-02-20 19:59:55,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {16533#true} #res := ~__retres1~0; {16533#true} is VALID [2022-02-20 19:59:55,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {16533#true} assume true; {16533#true} is VALID [2022-02-20 19:59:55,462 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {16533#true} {16533#true} #1045#return; {16533#true} is VALID [2022-02-20 19:59:55,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {16533#true} havoc ~__retres1~1; {16533#true} is VALID [2022-02-20 19:59:55,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {16533#true} assume 1 == ~c_dr_pc~0; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,472 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} {16533#true} #1047#return; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {16579#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {16533#true} is VALID [2022-02-20 19:59:55,472 INFO L272 TraceCheckUtils]: 1: Hoare triple {16533#true} call #t~ret8 := is_do_write_p_triggered(); {16533#true} is VALID [2022-02-20 19:59:55,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {16533#true} havoc ~__retres1~0; {16533#true} is VALID [2022-02-20 19:59:55,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {16533#true} assume !(1 == ~p_dw_pc~0); {16533#true} is VALID [2022-02-20 19:59:55,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {16533#true} assume !(2 == ~p_dw_pc~0); {16533#true} is VALID [2022-02-20 19:59:55,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {16533#true} ~__retres1~0 := 0; {16533#true} is VALID [2022-02-20 19:59:55,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {16533#true} #res := ~__retres1~0; {16533#true} is VALID [2022-02-20 19:59:55,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {16533#true} assume true; {16533#true} is VALID [2022-02-20 19:59:55,474 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16533#true} {16533#true} #1045#return; {16533#true} is VALID [2022-02-20 19:59:55,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {16533#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16533#true} is VALID [2022-02-20 19:59:55,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {16533#true} assume !(0 != ~tmp~1); {16533#true} is VALID [2022-02-20 19:59:55,481 INFO L272 TraceCheckUtils]: 11: Hoare triple {16533#true} call #t~ret9 := is_do_read_c_triggered(); {16533#true} is VALID [2022-02-20 19:59:55,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {16533#true} havoc ~__retres1~1; {16533#true} is VALID [2022-02-20 19:59:55,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {16533#true} assume 1 == ~c_dr_pc~0; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,483 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} {16533#true} #1047#return; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,484 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} {16540#(not (= ~c_dr_pc~0 1))} #1053#return; {16534#false} is VALID [2022-02-20 19:59:55,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {16578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {16533#true} is VALID [2022-02-20 19:59:55,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {16533#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16533#true} is VALID [2022-02-20 19:59:55,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {16533#true} assume true; {16533#true} is VALID [2022-02-20 19:59:55,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16533#true} {16534#false} #1055#return; {16534#false} is VALID [2022-02-20 19:59:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:55,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {16533#true} havoc ~__retres1~2; {16533#true} is VALID [2022-02-20 19:59:55,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {16533#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16533#true} is VALID [2022-02-20 19:59:55,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {16533#true} #res := ~__retres1~2; {16533#true} is VALID [2022-02-20 19:59:55,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {16533#true} assume true; {16533#true} is VALID [2022-02-20 19:59:55,492 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16533#true} {16534#false} #1057#return; {16534#false} is VALID [2022-02-20 19:59:55,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {16533#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {16535#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:55,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {16535#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {16535#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:55,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {16535#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {16536#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:55,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {16536#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {16536#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:59:55,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {16536#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {16576#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:59:55,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {16576#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {16577#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:55,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {16577#(not (= |old(~q_req_up~0)| 1))} assume true; {16577#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:55,495 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16577#(not (= |old(~q_req_up~0)| 1))} {16536#(= ~c_dr_pc~0 ~q_req_up~0)} #1049#return; {16540#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:55,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {16540#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {16540#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:55,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {16540#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {16540#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:55,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {16540#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {16540#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:55,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {16540#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {16540#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:55,497 INFO L272 TraceCheckUtils]: 12: Hoare triple {16540#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {16578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:55,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {16578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {16533#true} is VALID [2022-02-20 19:59:55,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {16533#true} assume !(0 == ~q_write_ev~0); {16533#true} is VALID [2022-02-20 19:59:55,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {16533#true} assume true; {16533#true} is VALID [2022-02-20 19:59:55,497 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16533#true} {16540#(not (= ~c_dr_pc~0 1))} #1051#return; {16540#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:59:55,498 INFO L272 TraceCheckUtils]: 17: Hoare triple {16540#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {16579#(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:59:55,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {16579#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {16533#true} is VALID [2022-02-20 19:59:55,498 INFO L272 TraceCheckUtils]: 19: Hoare triple {16533#true} call #t~ret8 := is_do_write_p_triggered(); {16533#true} is VALID [2022-02-20 19:59:55,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {16533#true} havoc ~__retres1~0; {16533#true} is VALID [2022-02-20 19:59:55,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {16533#true} assume !(1 == ~p_dw_pc~0); {16533#true} is VALID [2022-02-20 19:59:55,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {16533#true} assume !(2 == ~p_dw_pc~0); {16533#true} is VALID [2022-02-20 19:59:55,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {16533#true} ~__retres1~0 := 0; {16533#true} is VALID [2022-02-20 19:59:55,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {16533#true} #res := ~__retres1~0; {16533#true} is VALID [2022-02-20 19:59:55,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {16533#true} assume true; {16533#true} is VALID [2022-02-20 19:59:55,499 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16533#true} {16533#true} #1045#return; {16533#true} is VALID [2022-02-20 19:59:55,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {16533#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16533#true} is VALID [2022-02-20 19:59:55,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {16533#true} assume !(0 != ~tmp~1); {16533#true} is VALID [2022-02-20 19:59:55,499 INFO L272 TraceCheckUtils]: 29: Hoare triple {16533#true} call #t~ret9 := is_do_read_c_triggered(); {16533#true} is VALID [2022-02-20 19:59:55,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {16533#true} havoc ~__retres1~1; {16533#true} is VALID [2022-02-20 19:59:55,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {16533#true} assume 1 == ~c_dr_pc~0; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,501 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} {16533#true} #1047#return; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:59:55,502 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16593#(= (+ (- 1) ~c_dr_pc~0) 0)} {16540#(not (= ~c_dr_pc~0 1))} #1053#return; {16534#false} is VALID [2022-02-20 19:59:55,502 INFO L272 TraceCheckUtils]: 40: Hoare triple {16534#false} call reset_delta_events1(); {16578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:55,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {16578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {16533#true} is VALID [2022-02-20 19:59:55,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {16533#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16533#true} is VALID [2022-02-20 19:59:55,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {16533#true} assume true; {16533#true} is VALID [2022-02-20 19:59:55,503 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16533#true} {16534#false} #1055#return; {16534#false} is VALID [2022-02-20 19:59:55,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {16534#false} assume !false; {16534#false} is VALID [2022-02-20 19:59:55,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {16534#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {16534#false} is VALID [2022-02-20 19:59:55,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {16534#false} assume !false; {16534#false} is VALID [2022-02-20 19:59:55,503 INFO L272 TraceCheckUtils]: 48: Hoare triple {16534#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {16533#true} is VALID [2022-02-20 19:59:55,504 INFO L290 TraceCheckUtils]: 49: Hoare triple {16533#true} havoc ~__retres1~2; {16533#true} is VALID [2022-02-20 19:59:55,504 INFO L290 TraceCheckUtils]: 50: Hoare triple {16533#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16533#true} is VALID [2022-02-20 19:59:55,504 INFO L290 TraceCheckUtils]: 51: Hoare triple {16533#true} #res := ~__retres1~2; {16533#true} is VALID [2022-02-20 19:59:55,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {16533#true} assume true; {16533#true} is VALID [2022-02-20 19:59:55,504 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16533#true} {16534#false} #1057#return; {16534#false} is VALID [2022-02-20 19:59:55,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {16534#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {16534#false} is VALID [2022-02-20 19:59:55,504 INFO L290 TraceCheckUtils]: 55: Hoare triple {16534#false} assume 0 != eval1_~tmp___1~0#1; {16534#false} is VALID [2022-02-20 19:59:55,504 INFO L290 TraceCheckUtils]: 56: Hoare triple {16534#false} assume !(0 == ~p_dw_st~0); {16534#false} is VALID [2022-02-20 19:59:55,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {16534#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {16534#false} is VALID [2022-02-20 19:59:55,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {16534#false} assume 0 != eval1_~tmp___0~2#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; {16534#false} is VALID [2022-02-20 19:59:55,505 INFO L290 TraceCheckUtils]: 59: Hoare triple {16534#false} assume !(0 == ~c_dr_pc~0); {16534#false} is VALID [2022-02-20 19:59:55,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {16534#false} assume 2 == ~c_dr_pc~0; {16534#false} is VALID [2022-02-20 19:59:55,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {16534#false} do_read_c_~a~0#1 := ~a_t~0; {16534#false} is VALID [2022-02-20 19:59:55,505 INFO L290 TraceCheckUtils]: 62: Hoare triple {16534#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_req_up~0 := 1; {16534#false} is VALID [2022-02-20 19:59:55,505 INFO L290 TraceCheckUtils]: 63: Hoare triple {16534#false} assume !(~p_last_write~0 == ~c_last_read~0); {16534#false} is VALID [2022-02-20 19:59:55,505 INFO L272 TraceCheckUtils]: 64: Hoare triple {16534#false} call error1(); {16534#false} is VALID [2022-02-20 19:59:55,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {16534#false} assume !false; {16534#false} is VALID [2022-02-20 19:59:55,506 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:59:55,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:55,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698878707] [2022-02-20 19:59:55,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698878707] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:55,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:55,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:55,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959461614] [2022-02-20 19:59:55,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:55,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 19:59:55,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:55,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:59:55,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:55,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:55,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:55,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:55,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:55,546 INFO L87 Difference]: Start difference. First operand 1217 states and 1671 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,918 INFO L93 Difference]: Finished difference Result 3887 states and 5372 transitions. [2022-02-20 20:00:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:00,919 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:00:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1227 transitions. [2022-02-20 20:00:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1227 transitions. [2022-02-20 20:00:00,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1227 transitions. [2022-02-20 20:00:01,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1227 edges. 1227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:01,972 INFO L225 Difference]: With dead ends: 3887 [2022-02-20 20:00:01,973 INFO L226 Difference]: Without dead ends: 1607 [2022-02-20 20:00:01,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:01,977 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 2896 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2914 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:01,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2914 Valid, 1912 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 20:00:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2022-02-20 20:00:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1483. [2022-02-20 20:00:02,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:02,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1607 states. Second operand has 1483 states, 1173 states have (on average 1.3529411764705883) internal successors, (1587), 1197 states have internal predecessors, (1587), 170 states have call successors, (170), 109 states have call predecessors, (170), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) [2022-02-20 20:00:02,056 INFO L74 IsIncluded]: Start isIncluded. First operand 1607 states. Second operand has 1483 states, 1173 states have (on average 1.3529411764705883) internal successors, (1587), 1197 states have internal predecessors, (1587), 170 states have call successors, (170), 109 states have call predecessors, (170), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) [2022-02-20 20:00:02,058 INFO L87 Difference]: Start difference. First operand 1607 states. Second operand has 1483 states, 1173 states have (on average 1.3529411764705883) internal successors, (1587), 1197 states have internal predecessors, (1587), 170 states have call successors, (170), 109 states have call predecessors, (170), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) [2022-02-20 20:00:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:02,159 INFO L93 Difference]: Finished difference Result 1607 states and 2145 transitions. [2022-02-20 20:00:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2145 transitions. [2022-02-20 20:00:02,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:02,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:02,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 1483 states, 1173 states have (on average 1.3529411764705883) internal successors, (1587), 1197 states have internal predecessors, (1587), 170 states have call successors, (170), 109 states have call predecessors, (170), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) Second operand 1607 states. [2022-02-20 20:00:02,168 INFO L87 Difference]: Start difference. First operand has 1483 states, 1173 states have (on average 1.3529411764705883) internal successors, (1587), 1197 states have internal predecessors, (1587), 170 states have call successors, (170), 109 states have call predecessors, (170), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) Second operand 1607 states. [2022-02-20 20:00:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:02,270 INFO L93 Difference]: Finished difference Result 1607 states and 2145 transitions. [2022-02-20 20:00:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2145 transitions. [2022-02-20 20:00:02,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:02,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:02,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:02,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1173 states have (on average 1.3529411764705883) internal successors, (1587), 1197 states have internal predecessors, (1587), 170 states have call successors, (170), 109 states have call predecessors, (170), 138 states have return successors, (221), 179 states have call predecessors, (221), 168 states have call successors, (221) [2022-02-20 20:00:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1978 transitions. [2022-02-20 20:00:02,391 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1978 transitions. Word has length 66 [2022-02-20 20:00:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:02,391 INFO L470 AbstractCegarLoop]: Abstraction has 1483 states and 1978 transitions. [2022-02-20 20:00:02,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:00:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1978 transitions. [2022-02-20 20:00:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:02,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:02,394 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:02,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:00:02,394 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:02,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1975322897, now seen corresponding path program 1 times [2022-02-20 20:00:02,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:02,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378338497] [2022-02-20 20:00:02,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:02,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {27137#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {27091#true} is VALID [2022-02-20 20:00:02,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27091#true} {27091#true} #1049#return; {27091#true} is VALID [2022-02-20 20:00:02,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {27138#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {27091#true} is VALID [2022-02-20 20:00:02,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {27091#true} assume !(0 == ~q_write_ev~0); {27091#true} is VALID [2022-02-20 20:00:02,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27091#true} {27091#true} #1051#return; {27091#true} is VALID [2022-02-20 20:00:02,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {27091#true} havoc ~__retres1~0; {27091#true} is VALID [2022-02-20 20:00:02,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {27091#true} assume !(1 == ~p_dw_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {27091#true} assume !(2 == ~p_dw_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {27091#true} ~__retres1~0 := 0; {27091#true} is VALID [2022-02-20 20:00:02,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {27091#true} #res := ~__retres1~0; {27091#true} is VALID [2022-02-20 20:00:02,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,500 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27091#true} {27091#true} #1045#return; {27091#true} is VALID [2022-02-20 20:00:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {27091#true} havoc ~__retres1~1; {27091#true} is VALID [2022-02-20 20:00:02,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {27091#true} assume !(1 == ~c_dr_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {27091#true} assume !(2 == ~c_dr_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {27091#true} ~__retres1~1 := 0; {27156#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:02,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {27156#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:02,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:02,535 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {27091#true} #1047#return; {27154#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:02,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {27139#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {27091#true} is VALID [2022-02-20 20:00:02,536 INFO L272 TraceCheckUtils]: 1: Hoare triple {27091#true} call #t~ret8 := is_do_write_p_triggered(); {27091#true} is VALID [2022-02-20 20:00:02,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {27091#true} havoc ~__retres1~0; {27091#true} is VALID [2022-02-20 20:00:02,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {27091#true} assume !(1 == ~p_dw_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {27091#true} assume !(2 == ~p_dw_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {27091#true} ~__retres1~0 := 0; {27091#true} is VALID [2022-02-20 20:00:02,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {27091#true} #res := ~__retres1~0; {27091#true} is VALID [2022-02-20 20:00:02,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,537 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27091#true} {27091#true} #1045#return; {27091#true} is VALID [2022-02-20 20:00:02,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {27091#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27091#true} is VALID [2022-02-20 20:00:02,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {27091#true} assume !(0 != ~tmp~1); {27091#true} is VALID [2022-02-20 20:00:02,537 INFO L272 TraceCheckUtils]: 11: Hoare triple {27091#true} call #t~ret9 := is_do_read_c_triggered(); {27091#true} is VALID [2022-02-20 20:00:02,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {27091#true} havoc ~__retres1~1; {27091#true} is VALID [2022-02-20 20:00:02,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {27091#true} assume !(1 == ~c_dr_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {27091#true} assume !(2 == ~c_dr_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {27091#true} ~__retres1~1 := 0; {27156#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:02,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {27156#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:02,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:02,540 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {27091#true} #1047#return; {27154#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:02,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {27154#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27155#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:02,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {27155#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27092#false} is VALID [2022-02-20 20:00:02,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {27092#false} assume true; {27092#false} is VALID [2022-02-20 20:00:02,543 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27092#false} {27091#true} #1053#return; {27092#false} is VALID [2022-02-20 20:00:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {27138#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {27091#true} is VALID [2022-02-20 20:00:02,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {27091#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27091#true} is VALID [2022-02-20 20:00:02,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27091#true} {27092#false} #1055#return; {27092#false} is VALID [2022-02-20 20:00:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {27091#true} havoc ~__retres1~2; {27091#true} is VALID [2022-02-20 20:00:02,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {27091#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27091#true} is VALID [2022-02-20 20:00:02,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {27091#true} #res := ~__retres1~2; {27091#true} is VALID [2022-02-20 20:00:02,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,570 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27091#true} {27092#false} #1057#return; {27092#false} is VALID [2022-02-20 20:00:02,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:02,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {27091#true} havoc ~__retres1~2; {27091#true} is VALID [2022-02-20 20:00:02,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {27091#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27091#true} is VALID [2022-02-20 20:00:02,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {27091#true} #res := ~__retres1~2; {27091#true} is VALID [2022-02-20 20:00:02,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,574 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27091#true} {27092#false} #1057#return; {27092#false} is VALID [2022-02-20 20:00:02,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {27091#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {27091#true} is VALID [2022-02-20 20:00:02,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {27091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {27091#true} is VALID [2022-02-20 20:00:02,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {27091#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {27091#true} is VALID [2022-02-20 20:00:02,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {27091#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {27091#true} is VALID [2022-02-20 20:00:02,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {27091#true} call update_channels1(); {27137#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:02,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {27137#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {27091#true} is VALID [2022-02-20 20:00:02,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,575 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27091#true} {27091#true} #1049#return; {27091#true} is VALID [2022-02-20 20:00:02,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {27091#true} assume { :begin_inline_init_threads1 } true; {27091#true} is VALID [2022-02-20 20:00:02,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {27091#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {27091#true} is VALID [2022-02-20 20:00:02,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {27091#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {27091#true} is VALID [2022-02-20 20:00:02,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {27091#true} assume { :end_inline_init_threads1 } true; {27091#true} is VALID [2022-02-20 20:00:02,576 INFO L272 TraceCheckUtils]: 12: Hoare triple {27091#true} call fire_delta_events1(); {27138#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:02,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {27138#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {27091#true} is VALID [2022-02-20 20:00:02,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {27091#true} assume !(0 == ~q_write_ev~0); {27091#true} is VALID [2022-02-20 20:00:02,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,577 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27091#true} {27091#true} #1051#return; {27091#true} is VALID [2022-02-20 20:00:02,578 INFO L272 TraceCheckUtils]: 17: Hoare triple {27091#true} call activate_threads1(); {27139#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:02,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {27139#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {27091#true} is VALID [2022-02-20 20:00:02,578 INFO L272 TraceCheckUtils]: 19: Hoare triple {27091#true} call #t~ret8 := is_do_write_p_triggered(); {27091#true} is VALID [2022-02-20 20:00:02,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {27091#true} havoc ~__retres1~0; {27091#true} is VALID [2022-02-20 20:00:02,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {27091#true} assume !(1 == ~p_dw_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {27091#true} assume !(2 == ~p_dw_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {27091#true} ~__retres1~0 := 0; {27091#true} is VALID [2022-02-20 20:00:02,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {27091#true} #res := ~__retres1~0; {27091#true} is VALID [2022-02-20 20:00:02,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,579 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27091#true} {27091#true} #1045#return; {27091#true} is VALID [2022-02-20 20:00:02,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {27091#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27091#true} is VALID [2022-02-20 20:00:02,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {27091#true} assume !(0 != ~tmp~1); {27091#true} is VALID [2022-02-20 20:00:02,579 INFO L272 TraceCheckUtils]: 29: Hoare triple {27091#true} call #t~ret9 := is_do_read_c_triggered(); {27091#true} is VALID [2022-02-20 20:00:02,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {27091#true} havoc ~__retres1~1; {27091#true} is VALID [2022-02-20 20:00:02,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {27091#true} assume !(1 == ~c_dr_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {27091#true} assume !(2 == ~c_dr_pc~0); {27091#true} is VALID [2022-02-20 20:00:02,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {27091#true} ~__retres1~1 := 0; {27156#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:00:02,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {27156#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:02,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:00:02,581 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27157#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {27091#true} #1047#return; {27154#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:00:02,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {27154#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27155#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:00:02,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {27155#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27092#false} is VALID [2022-02-20 20:00:02,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {27092#false} assume true; {27092#false} is VALID [2022-02-20 20:00:02,582 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {27092#false} {27091#true} #1053#return; {27092#false} is VALID [2022-02-20 20:00:02,582 INFO L272 TraceCheckUtils]: 41: Hoare triple {27092#false} call reset_delta_events1(); {27138#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:02,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {27138#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {27091#true} is VALID [2022-02-20 20:00:02,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {27091#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27091#true} is VALID [2022-02-20 20:00:02,583 INFO L290 TraceCheckUtils]: 44: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,583 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27091#true} {27092#false} #1055#return; {27092#false} is VALID [2022-02-20 20:00:02,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {27092#false} assume !false; {27092#false} is VALID [2022-02-20 20:00:02,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {27092#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {27092#false} is VALID [2022-02-20 20:00:02,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {27092#false} assume !false; {27092#false} is VALID [2022-02-20 20:00:02,583 INFO L272 TraceCheckUtils]: 49: Hoare triple {27092#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27091#true} is VALID [2022-02-20 20:00:02,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {27091#true} havoc ~__retres1~2; {27091#true} is VALID [2022-02-20 20:00:02,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {27091#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27091#true} is VALID [2022-02-20 20:00:02,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {27091#true} #res := ~__retres1~2; {27091#true} is VALID [2022-02-20 20:00:02,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,584 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {27091#true} {27092#false} #1057#return; {27092#false} is VALID [2022-02-20 20:00:02,584 INFO L290 TraceCheckUtils]: 55: Hoare triple {27092#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {27092#false} is VALID [2022-02-20 20:00:02,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {27092#false} assume 0 != eval1_~tmp___1~0#1; {27092#false} is VALID [2022-02-20 20:00:02,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {27092#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {27092#false} is VALID [2022-02-20 20:00:02,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {27092#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {27092#false} is VALID [2022-02-20 20:00:02,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {27092#false} assume 0 == ~p_dw_pc~0; {27092#false} is VALID [2022-02-20 20:00:02,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {27092#false} assume !false; {27092#false} is VALID [2022-02-20 20:00:02,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {27092#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {27092#false} is VALID [2022-02-20 20:00:02,585 INFO L290 TraceCheckUtils]: 62: Hoare triple {27092#false} assume { :end_inline_do_write_p } true; {27092#false} is VALID [2022-02-20 20:00:02,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {27092#false} assume !(0 == ~c_dr_st~0); {27092#false} is VALID [2022-02-20 20:00:02,585 INFO L290 TraceCheckUtils]: 64: Hoare triple {27092#false} assume !false; {27092#false} is VALID [2022-02-20 20:00:02,585 INFO L272 TraceCheckUtils]: 65: Hoare triple {27092#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27091#true} is VALID [2022-02-20 20:00:02,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {27091#true} havoc ~__retres1~2; {27091#true} is VALID [2022-02-20 20:00:02,586 INFO L290 TraceCheckUtils]: 67: Hoare triple {27091#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27091#true} is VALID [2022-02-20 20:00:02,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {27091#true} #res := ~__retres1~2; {27091#true} is VALID [2022-02-20 20:00:02,586 INFO L290 TraceCheckUtils]: 69: Hoare triple {27091#true} assume true; {27091#true} is VALID [2022-02-20 20:00:02,587 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {27091#true} {27092#false} #1057#return; {27092#false} is VALID [2022-02-20 20:00:02,587 INFO L290 TraceCheckUtils]: 71: Hoare triple {27092#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {27092#false} is VALID [2022-02-20 20:00:02,587 INFO L290 TraceCheckUtils]: 72: Hoare triple {27092#false} assume 0 != eval1_~tmp___1~0#1; {27092#false} is VALID [2022-02-20 20:00:02,587 INFO L290 TraceCheckUtils]: 73: Hoare triple {27092#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {27092#false} is VALID [2022-02-20 20:00:02,587 INFO L290 TraceCheckUtils]: 74: Hoare triple {27092#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {27092#false} is VALID [2022-02-20 20:00:02,587 INFO L290 TraceCheckUtils]: 75: Hoare triple {27092#false} assume !(0 == ~p_dw_pc~0); {27092#false} is VALID [2022-02-20 20:00:02,587 INFO L290 TraceCheckUtils]: 76: Hoare triple {27092#false} assume 1 == ~p_dw_pc~0; {27092#false} is VALID [2022-02-20 20:00:02,587 INFO L290 TraceCheckUtils]: 77: Hoare triple {27092#false} assume !(0 == ~q_free~0); {27092#false} is VALID [2022-02-20 20:00:02,588 INFO L290 TraceCheckUtils]: 78: Hoare triple {27092#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_req_up~0 := 1; {27092#false} is VALID [2022-02-20 20:00:02,588 INFO L290 TraceCheckUtils]: 79: Hoare triple {27092#false} assume !false; {27092#false} is VALID [2022-02-20 20:00:02,588 INFO L290 TraceCheckUtils]: 80: Hoare triple {27092#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {27092#false} is VALID [2022-02-20 20:00:02,588 INFO L290 TraceCheckUtils]: 81: Hoare triple {27092#false} assume { :end_inline_do_write_p } true; {27092#false} is VALID [2022-02-20 20:00:02,588 INFO L290 TraceCheckUtils]: 82: Hoare triple {27092#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {27092#false} is VALID [2022-02-20 20:00:02,588 INFO L290 TraceCheckUtils]: 83: Hoare triple {27092#false} assume 0 != eval1_~tmp___0~2#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; {27092#false} is VALID [2022-02-20 20:00:02,588 INFO L290 TraceCheckUtils]: 84: Hoare triple {27092#false} assume !(0 == ~c_dr_pc~0); {27092#false} is VALID [2022-02-20 20:00:02,588 INFO L290 TraceCheckUtils]: 85: Hoare triple {27092#false} assume 2 == ~c_dr_pc~0; {27092#false} is VALID [2022-02-20 20:00:02,589 INFO L290 TraceCheckUtils]: 86: Hoare triple {27092#false} do_read_c_~a~0#1 := ~a_t~0; {27092#false} is VALID [2022-02-20 20:00:02,589 INFO L290 TraceCheckUtils]: 87: Hoare triple {27092#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_req_up~0 := 1; {27092#false} is VALID [2022-02-20 20:00:02,589 INFO L290 TraceCheckUtils]: 88: Hoare triple {27092#false} assume !(~p_last_write~0 == ~c_last_read~0); {27092#false} is VALID [2022-02-20 20:00:02,589 INFO L272 TraceCheckUtils]: 89: Hoare triple {27092#false} call error1(); {27092#false} is VALID [2022-02-20 20:00:02,589 INFO L290 TraceCheckUtils]: 90: Hoare triple {27092#false} assume !false; {27092#false} is VALID [2022-02-20 20:00:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:00:02,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:02,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378338497] [2022-02-20 20:00:02,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378338497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:02,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:02,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:02,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155181672] [2022-02-20 20:00:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:02,592 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:00:02,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:02,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:02,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:02,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:02,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:02,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:02,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:02,640 INFO L87 Difference]: Start difference. First operand 1483 states and 1978 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:05,010 INFO L93 Difference]: Finished difference Result 2925 states and 3915 transitions. [2022-02-20 20:00:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:05,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:00:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 592 transitions. [2022-02-20 20:00:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 592 transitions. [2022-02-20 20:00:05,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 592 transitions. [2022-02-20 20:00:05,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:05,532 INFO L225 Difference]: With dead ends: 2925 [2022-02-20 20:00:05,532 INFO L226 Difference]: Without dead ends: 1629 [2022-02-20 20:00:05,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:05,538 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 499 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:05,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 1631 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 20:00:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-02-20 20:00:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1523. [2022-02-20 20:00:05,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:05,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1629 states. Second operand has 1523 states, 1205 states have (on average 1.3385892116182572) internal successors, (1613), 1229 states have internal predecessors, (1613), 170 states have call successors, (170), 109 states have call predecessors, (170), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) [2022-02-20 20:00:05,618 INFO L74 IsIncluded]: Start isIncluded. First operand 1629 states. Second operand has 1523 states, 1205 states have (on average 1.3385892116182572) internal successors, (1613), 1229 states have internal predecessors, (1613), 170 states have call successors, (170), 109 states have call predecessors, (170), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) [2022-02-20 20:00:05,619 INFO L87 Difference]: Start difference. First operand 1629 states. Second operand has 1523 states, 1205 states have (on average 1.3385892116182572) internal successors, (1613), 1229 states have internal predecessors, (1613), 170 states have call successors, (170), 109 states have call predecessors, (170), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) [2022-02-20 20:00:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:05,709 INFO L93 Difference]: Finished difference Result 1629 states and 2166 transitions. [2022-02-20 20:00:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2166 transitions. [2022-02-20 20:00:05,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:05,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:05,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 1523 states, 1205 states have (on average 1.3385892116182572) internal successors, (1613), 1229 states have internal predecessors, (1613), 170 states have call successors, (170), 109 states have call predecessors, (170), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) Second operand 1629 states. [2022-02-20 20:00:05,716 INFO L87 Difference]: Start difference. First operand has 1523 states, 1205 states have (on average 1.3385892116182572) internal successors, (1613), 1229 states have internal predecessors, (1613), 170 states have call successors, (170), 109 states have call predecessors, (170), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) Second operand 1629 states. [2022-02-20 20:00:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:05,802 INFO L93 Difference]: Finished difference Result 1629 states and 2166 transitions. [2022-02-20 20:00:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2166 transitions. [2022-02-20 20:00:05,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:05,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:05,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:05,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1205 states have (on average 1.3385892116182572) internal successors, (1613), 1229 states have internal predecessors, (1613), 170 states have call successors, (170), 109 states have call predecessors, (170), 146 states have return successors, (229), 187 states have call predecessors, (229), 168 states have call successors, (229) [2022-02-20 20:00:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2012 transitions. [2022-02-20 20:00:05,998 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 2012 transitions. Word has length 91 [2022-02-20 20:00:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:05,999 INFO L470 AbstractCegarLoop]: Abstraction has 1523 states and 2012 transitions. [2022-02-20 20:00:06,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2012 transitions. [2022-02-20 20:00:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:06,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:06,004 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:06,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:00:06,005 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1531422223, now seen corresponding path program 1 times [2022-02-20 20:00:06,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:06,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806320397] [2022-02-20 20:00:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {36431#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {36386#(= ~q_read_ev~0 2)} #1049#return; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {36433#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(0 == ~q_write_ev~0); {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {36386#(= ~q_read_ev~0 2)} #1051#return; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {36384#true} havoc ~__retres1~0; {36384#true} is VALID [2022-02-20 20:00:06,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {36384#true} assume !(1 == ~p_dw_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {36384#true} assume !(2 == ~p_dw_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {36384#true} ~__retres1~0 := 0; {36384#true} is VALID [2022-02-20 20:00:06,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {36384#true} #res := ~__retres1~0; {36384#true} is VALID [2022-02-20 20:00:06,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,100 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36384#true} {36384#true} #1045#return; {36384#true} is VALID [2022-02-20 20:00:06,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {36384#true} havoc ~__retres1~1; {36384#true} is VALID [2022-02-20 20:00:06,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {36384#true} assume !(1 == ~c_dr_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {36384#true} assume !(2 == ~c_dr_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {36384#true} ~__retres1~1 := 0; {36384#true} is VALID [2022-02-20 20:00:06,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {36384#true} #res := ~__retres1~1; {36384#true} is VALID [2022-02-20 20:00:06,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,124 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36384#true} {36384#true} #1047#return; {36384#true} is VALID [2022-02-20 20:00:06,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {36434#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {36384#true} is VALID [2022-02-20 20:00:06,124 INFO L272 TraceCheckUtils]: 1: Hoare triple {36384#true} call #t~ret8 := is_do_write_p_triggered(); {36384#true} is VALID [2022-02-20 20:00:06,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {36384#true} havoc ~__retres1~0; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {36384#true} assume !(1 == ~p_dw_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {36384#true} assume !(2 == ~p_dw_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {36384#true} ~__retres1~0 := 0; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {36384#true} #res := ~__retres1~0; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {36384#true} {36384#true} #1045#return; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {36384#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {36384#true} assume !(0 != ~tmp~1); {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L272 TraceCheckUtils]: 11: Hoare triple {36384#true} call #t~ret9 := is_do_read_c_triggered(); {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {36384#true} havoc ~__retres1~1; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {36384#true} assume !(1 == ~c_dr_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {36384#true} assume !(2 == ~c_dr_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {36384#true} ~__retres1~1 := 0; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {36384#true} #res := ~__retres1~1; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,125 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {36384#true} {36384#true} #1047#return; {36384#true} is VALID [2022-02-20 20:00:06,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {36384#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {36384#true} is VALID [2022-02-20 20:00:06,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {36384#true} assume !(0 != ~tmp___0~1); {36384#true} is VALID [2022-02-20 20:00:06,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,126 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {36384#true} {36386#(= ~q_read_ev~0 2)} #1053#return; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {36433#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {36449#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:06,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {36449#(= |old(~q_read_ev~0)| 1)} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {36449#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:06,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {36449#(= |old(~q_read_ev~0)| 1)} assume true; {36449#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:06,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36449#(= |old(~q_read_ev~0)| 1)} {36386#(= ~q_read_ev~0 2)} #1055#return; {36385#false} is VALID [2022-02-20 20:00:06,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {36384#true} havoc ~__retres1~2; {36384#true} is VALID [2022-02-20 20:00:06,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {36384#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36384#true} is VALID [2022-02-20 20:00:06,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {36384#true} #res := ~__retres1~2; {36384#true} is VALID [2022-02-20 20:00:06,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,144 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {36384#true} {36385#false} #1057#return; {36385#false} is VALID [2022-02-20 20:00:06,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:06,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {36384#true} havoc ~__retres1~2; {36384#true} is VALID [2022-02-20 20:00:06,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {36384#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36384#true} is VALID [2022-02-20 20:00:06,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {36384#true} #res := ~__retres1~2; {36384#true} is VALID [2022-02-20 20:00:06,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,147 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {36384#true} {36385#false} #1057#return; {36385#false} is VALID [2022-02-20 20:00:06,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {36384#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {36384#true} is VALID [2022-02-20 20:00:06,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {36384#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {36384#true} is VALID [2022-02-20 20:00:06,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {36384#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {36386#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {36386#(= ~q_read_ev~0 2)} call update_channels1(); {36431#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:06,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {36431#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,149 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {36386#(= ~q_read_ev~0 2)} #1049#return; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {36386#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {36386#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {36386#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {36386#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,151 INFO L272 TraceCheckUtils]: 12: Hoare triple {36386#(= ~q_read_ev~0 2)} call fire_delta_events1(); {36433#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:06,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {36433#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(0 == ~q_write_ev~0); {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:06,152 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36432#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {36386#(= ~q_read_ev~0 2)} #1051#return; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,153 INFO L272 TraceCheckUtils]: 17: Hoare triple {36386#(= ~q_read_ev~0 2)} call activate_threads1(); {36434#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:06,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {36434#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {36384#true} is VALID [2022-02-20 20:00:06,153 INFO L272 TraceCheckUtils]: 19: Hoare triple {36384#true} call #t~ret8 := is_do_write_p_triggered(); {36384#true} is VALID [2022-02-20 20:00:06,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {36384#true} havoc ~__retres1~0; {36384#true} is VALID [2022-02-20 20:00:06,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {36384#true} assume !(1 == ~p_dw_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {36384#true} assume !(2 == ~p_dw_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {36384#true} ~__retres1~0 := 0; {36384#true} is VALID [2022-02-20 20:00:06,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {36384#true} #res := ~__retres1~0; {36384#true} is VALID [2022-02-20 20:00:06,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36384#true} {36384#true} #1045#return; {36384#true} is VALID [2022-02-20 20:00:06,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {36384#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {36384#true} is VALID [2022-02-20 20:00:06,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {36384#true} assume !(0 != ~tmp~1); {36384#true} is VALID [2022-02-20 20:00:06,154 INFO L272 TraceCheckUtils]: 29: Hoare triple {36384#true} call #t~ret9 := is_do_read_c_triggered(); {36384#true} is VALID [2022-02-20 20:00:06,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {36384#true} havoc ~__retres1~1; {36384#true} is VALID [2022-02-20 20:00:06,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {36384#true} assume !(1 == ~c_dr_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {36384#true} assume !(2 == ~c_dr_pc~0); {36384#true} is VALID [2022-02-20 20:00:06,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {36384#true} ~__retres1~1 := 0; {36384#true} is VALID [2022-02-20 20:00:06,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {36384#true} #res := ~__retres1~1; {36384#true} is VALID [2022-02-20 20:00:06,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,155 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {36384#true} {36384#true} #1047#return; {36384#true} is VALID [2022-02-20 20:00:06,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {36384#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {36384#true} is VALID [2022-02-20 20:00:06,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {36384#true} assume !(0 != ~tmp___0~1); {36384#true} is VALID [2022-02-20 20:00:06,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,156 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {36384#true} {36386#(= ~q_read_ev~0 2)} #1053#return; {36386#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:06,156 INFO L272 TraceCheckUtils]: 41: Hoare triple {36386#(= ~q_read_ev~0 2)} call reset_delta_events1(); {36433#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:06,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {36433#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {36449#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:06,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {36449#(= |old(~q_read_ev~0)| 1)} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {36449#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:06,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {36449#(= |old(~q_read_ev~0)| 1)} assume true; {36449#(= |old(~q_read_ev~0)| 1)} is VALID [2022-02-20 20:00:06,157 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {36449#(= |old(~q_read_ev~0)| 1)} {36386#(= ~q_read_ev~0 2)} #1055#return; {36385#false} is VALID [2022-02-20 20:00:06,157 INFO L290 TraceCheckUtils]: 46: Hoare triple {36385#false} assume !false; {36385#false} is VALID [2022-02-20 20:00:06,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {36385#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {36385#false} is VALID [2022-02-20 20:00:06,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {36385#false} assume !false; {36385#false} is VALID [2022-02-20 20:00:06,158 INFO L272 TraceCheckUtils]: 49: Hoare triple {36385#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {36384#true} is VALID [2022-02-20 20:00:06,158 INFO L290 TraceCheckUtils]: 50: Hoare triple {36384#true} havoc ~__retres1~2; {36384#true} is VALID [2022-02-20 20:00:06,158 INFO L290 TraceCheckUtils]: 51: Hoare triple {36384#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36384#true} is VALID [2022-02-20 20:00:06,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {36384#true} #res := ~__retres1~2; {36384#true} is VALID [2022-02-20 20:00:06,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,158 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {36384#true} {36385#false} #1057#return; {36385#false} is VALID [2022-02-20 20:00:06,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {36385#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {36385#false} is VALID [2022-02-20 20:00:06,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {36385#false} assume 0 != eval1_~tmp___1~0#1; {36385#false} is VALID [2022-02-20 20:00:06,159 INFO L290 TraceCheckUtils]: 57: Hoare triple {36385#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {36385#false} is VALID [2022-02-20 20:00:06,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {36385#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {36385#false} is VALID [2022-02-20 20:00:06,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {36385#false} assume 0 == ~p_dw_pc~0; {36385#false} is VALID [2022-02-20 20:00:06,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {36385#false} assume !false; {36385#false} is VALID [2022-02-20 20:00:06,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {36385#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {36385#false} is VALID [2022-02-20 20:00:06,159 INFO L290 TraceCheckUtils]: 62: Hoare triple {36385#false} assume { :end_inline_do_write_p } true; {36385#false} is VALID [2022-02-20 20:00:06,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {36385#false} assume !(0 == ~c_dr_st~0); {36385#false} is VALID [2022-02-20 20:00:06,160 INFO L290 TraceCheckUtils]: 64: Hoare triple {36385#false} assume !false; {36385#false} is VALID [2022-02-20 20:00:06,160 INFO L272 TraceCheckUtils]: 65: Hoare triple {36385#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {36384#true} is VALID [2022-02-20 20:00:06,160 INFO L290 TraceCheckUtils]: 66: Hoare triple {36384#true} havoc ~__retres1~2; {36384#true} is VALID [2022-02-20 20:00:06,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {36384#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36384#true} is VALID [2022-02-20 20:00:06,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {36384#true} #res := ~__retres1~2; {36384#true} is VALID [2022-02-20 20:00:06,160 INFO L290 TraceCheckUtils]: 69: Hoare triple {36384#true} assume true; {36384#true} is VALID [2022-02-20 20:00:06,160 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {36384#true} {36385#false} #1057#return; {36385#false} is VALID [2022-02-20 20:00:06,160 INFO L290 TraceCheckUtils]: 71: Hoare triple {36385#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {36385#false} is VALID [2022-02-20 20:00:06,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {36385#false} assume 0 != eval1_~tmp___1~0#1; {36385#false} is VALID [2022-02-20 20:00:06,161 INFO L290 TraceCheckUtils]: 73: Hoare triple {36385#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {36385#false} is VALID [2022-02-20 20:00:06,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {36385#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {36385#false} is VALID [2022-02-20 20:00:06,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {36385#false} assume !(0 == ~p_dw_pc~0); {36385#false} is VALID [2022-02-20 20:00:06,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {36385#false} assume 1 == ~p_dw_pc~0; {36385#false} is VALID [2022-02-20 20:00:06,161 INFO L290 TraceCheckUtils]: 77: Hoare triple {36385#false} assume !(0 == ~q_free~0); {36385#false} is VALID [2022-02-20 20:00:06,161 INFO L290 TraceCheckUtils]: 78: Hoare triple {36385#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_req_up~0 := 1; {36385#false} is VALID [2022-02-20 20:00:06,161 INFO L290 TraceCheckUtils]: 79: Hoare triple {36385#false} assume !false; {36385#false} is VALID [2022-02-20 20:00:06,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {36385#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {36385#false} is VALID [2022-02-20 20:00:06,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {36385#false} assume { :end_inline_do_write_p } true; {36385#false} is VALID [2022-02-20 20:00:06,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {36385#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {36385#false} is VALID [2022-02-20 20:00:06,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {36385#false} assume 0 != eval1_~tmp___0~2#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; {36385#false} is VALID [2022-02-20 20:00:06,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {36385#false} assume !(0 == ~c_dr_pc~0); {36385#false} is VALID [2022-02-20 20:00:06,162 INFO L290 TraceCheckUtils]: 85: Hoare triple {36385#false} assume 2 == ~c_dr_pc~0; {36385#false} is VALID [2022-02-20 20:00:06,162 INFO L290 TraceCheckUtils]: 86: Hoare triple {36385#false} do_read_c_~a~0#1 := ~a_t~0; {36385#false} is VALID [2022-02-20 20:00:06,162 INFO L290 TraceCheckUtils]: 87: Hoare triple {36385#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_req_up~0 := 1; {36385#false} is VALID [2022-02-20 20:00:06,163 INFO L290 TraceCheckUtils]: 88: Hoare triple {36385#false} assume !(~p_last_write~0 == ~c_last_read~0); {36385#false} is VALID [2022-02-20 20:00:06,163 INFO L272 TraceCheckUtils]: 89: Hoare triple {36385#false} call error1(); {36385#false} is VALID [2022-02-20 20:00:06,163 INFO L290 TraceCheckUtils]: 90: Hoare triple {36385#false} assume !false; {36385#false} is VALID [2022-02-20 20:00:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:00:06,163 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:06,163 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806320397] [2022-02-20 20:00:06,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806320397] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:06,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:06,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:06,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113369082] [2022-02-20 20:00:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:06,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:06,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:06,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:06,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:06,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:06,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:06,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:06,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:06,214 INFO L87 Difference]: Start difference. First operand 1523 states and 2012 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:08,699 INFO L93 Difference]: Finished difference Result 3315 states and 4378 transitions. [2022-02-20 20:00:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 20:00:08,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 776 transitions. [2022-02-20 20:00:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 776 transitions. [2022-02-20 20:00:08,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 776 transitions. [2022-02-20 20:00:09,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 776 edges. 776 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:09,447 INFO L225 Difference]: With dead ends: 3315 [2022-02-20 20:00:09,448 INFO L226 Difference]: Without dead ends: 2053 [2022-02-20 20:00:09,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-20 20:00:09,452 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 577 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:09,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 1361 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 20:00:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2022-02-20 20:00:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1877. [2022-02-20 20:00:09,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:09,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2053 states. Second operand has 1877 states, 1487 states have (on average 1.3113651647612643) internal successors, (1950), 1512 states have internal predecessors, (1950), 210 states have call successors, (210), 139 states have call predecessors, (210), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) [2022-02-20 20:00:09,575 INFO L74 IsIncluded]: Start isIncluded. First operand 2053 states. Second operand has 1877 states, 1487 states have (on average 1.3113651647612643) internal successors, (1950), 1512 states have internal predecessors, (1950), 210 states have call successors, (210), 139 states have call predecessors, (210), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) [2022-02-20 20:00:09,576 INFO L87 Difference]: Start difference. First operand 2053 states. Second operand has 1877 states, 1487 states have (on average 1.3113651647612643) internal successors, (1950), 1512 states have internal predecessors, (1950), 210 states have call successors, (210), 139 states have call predecessors, (210), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) [2022-02-20 20:00:09,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:09,708 INFO L93 Difference]: Finished difference Result 2053 states and 2663 transitions. [2022-02-20 20:00:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2663 transitions. [2022-02-20 20:00:09,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:09,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:09,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 1877 states, 1487 states have (on average 1.3113651647612643) internal successors, (1950), 1512 states have internal predecessors, (1950), 210 states have call successors, (210), 139 states have call predecessors, (210), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) Second operand 2053 states. [2022-02-20 20:00:09,715 INFO L87 Difference]: Start difference. First operand has 1877 states, 1487 states have (on average 1.3113651647612643) internal successors, (1950), 1512 states have internal predecessors, (1950), 210 states have call successors, (210), 139 states have call predecessors, (210), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) Second operand 2053 states. [2022-02-20 20:00:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:09,850 INFO L93 Difference]: Finished difference Result 2053 states and 2663 transitions. [2022-02-20 20:00:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2663 transitions. [2022-02-20 20:00:09,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:09,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:09,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:09,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1487 states have (on average 1.3113651647612643) internal successors, (1950), 1512 states have internal predecessors, (1950), 210 states have call successors, (210), 139 states have call predecessors, (210), 178 states have return successors, (270), 228 states have call predecessors, (270), 208 states have call successors, (270) [2022-02-20 20:00:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2430 transitions. [2022-02-20 20:00:10,023 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2430 transitions. Word has length 91 [2022-02-20 20:00:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:10,024 INFO L470 AbstractCegarLoop]: Abstraction has 1877 states and 2430 transitions. [2022-02-20 20:00:10,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:10,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2430 transitions. [2022-02-20 20:00:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:10,026 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:10,026 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:10,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:00:10,026 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:10,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1546940941, now seen corresponding path program 1 times [2022-02-20 20:00:10,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:10,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571816735] [2022-02-20 20:00:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {47577#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {47532#(= ~q_write_ev~0 ~q_read_ev~0)} #1049#return; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {47532#(= ~q_write_ev~0 ~q_read_ev~0)} #1051#return; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {47530#true} havoc ~__retres1~0; {47530#true} is VALID [2022-02-20 20:00:10,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {47530#true} assume !(1 == ~p_dw_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {47530#true} assume !(2 == ~p_dw_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {47530#true} ~__retres1~0 := 0; {47530#true} is VALID [2022-02-20 20:00:10,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {47530#true} #res := ~__retres1~0; {47530#true} is VALID [2022-02-20 20:00:10,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,105 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {47530#true} {47530#true} #1045#return; {47530#true} is VALID [2022-02-20 20:00:10,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {47530#true} havoc ~__retres1~1; {47530#true} is VALID [2022-02-20 20:00:10,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {47530#true} assume !(1 == ~c_dr_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {47530#true} assume !(2 == ~c_dr_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {47530#true} ~__retres1~1 := 0; {47530#true} is VALID [2022-02-20 20:00:10,110 INFO L290 TraceCheckUtils]: 4: Hoare triple {47530#true} #res := ~__retres1~1; {47530#true} is VALID [2022-02-20 20:00:10,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,110 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {47530#true} {47530#true} #1047#return; {47530#true} is VALID [2022-02-20 20:00:10,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {47579#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {47530#true} is VALID [2022-02-20 20:00:10,111 INFO L272 TraceCheckUtils]: 1: Hoare triple {47530#true} call #t~ret8 := is_do_write_p_triggered(); {47530#true} is VALID [2022-02-20 20:00:10,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {47530#true} havoc ~__retres1~0; {47530#true} is VALID [2022-02-20 20:00:10,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {47530#true} assume !(1 == ~p_dw_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {47530#true} assume !(2 == ~p_dw_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {47530#true} ~__retres1~0 := 0; {47530#true} is VALID [2022-02-20 20:00:10,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {47530#true} #res := ~__retres1~0; {47530#true} is VALID [2022-02-20 20:00:10,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,112 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {47530#true} {47530#true} #1045#return; {47530#true} is VALID [2022-02-20 20:00:10,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {47530#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {47530#true} is VALID [2022-02-20 20:00:10,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {47530#true} assume !(0 != ~tmp~1); {47530#true} is VALID [2022-02-20 20:00:10,112 INFO L272 TraceCheckUtils]: 11: Hoare triple {47530#true} call #t~ret9 := is_do_read_c_triggered(); {47530#true} is VALID [2022-02-20 20:00:10,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {47530#true} havoc ~__retres1~1; {47530#true} is VALID [2022-02-20 20:00:10,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {47530#true} assume !(1 == ~c_dr_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {47530#true} assume !(2 == ~c_dr_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {47530#true} ~__retres1~1 := 0; {47530#true} is VALID [2022-02-20 20:00:10,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {47530#true} #res := ~__retres1~1; {47530#true} is VALID [2022-02-20 20:00:10,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,119 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {47530#true} {47530#true} #1047#return; {47530#true} is VALID [2022-02-20 20:00:10,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {47530#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {47530#true} is VALID [2022-02-20 20:00:10,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {47530#true} assume !(0 != ~tmp___0~1); {47530#true} is VALID [2022-02-20 20:00:10,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,120 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {47530#true} {47532#(= ~q_write_ev~0 ~q_read_ev~0)} #1053#return; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {47594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:10,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {47594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {47595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:10,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {47595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {47595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:10,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {47532#(= ~q_write_ev~0 ~q_read_ev~0)} #1055#return; {47531#false} is VALID [2022-02-20 20:00:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {47530#true} havoc ~__retres1~2; {47530#true} is VALID [2022-02-20 20:00:10,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {47530#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47530#true} is VALID [2022-02-20 20:00:10,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {47530#true} #res := ~__retres1~2; {47530#true} is VALID [2022-02-20 20:00:10,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,144 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47530#true} {47531#false} #1057#return; {47531#false} is VALID [2022-02-20 20:00:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:10,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {47530#true} havoc ~__retres1~2; {47530#true} is VALID [2022-02-20 20:00:10,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {47530#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47530#true} is VALID [2022-02-20 20:00:10,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {47530#true} #res := ~__retres1~2; {47530#true} is VALID [2022-02-20 20:00:10,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,147 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {47530#true} {47531#false} #1057#return; {47531#false} is VALID [2022-02-20 20:00:10,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {47530#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {47530#true} is VALID [2022-02-20 20:00:10,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {47530#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {47530#true} is VALID [2022-02-20 20:00:10,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {47530#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {47532#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {47532#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {47577#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:10,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {47577#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,150 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {47532#(= ~q_write_ev~0 ~q_read_ev~0)} #1049#return; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {47532#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {47532#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {47532#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {47532#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,151 INFO L272 TraceCheckUtils]: 12: Hoare triple {47532#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,153 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {47532#(= ~q_write_ev~0 ~q_read_ev~0)} #1051#return; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,153 INFO L272 TraceCheckUtils]: 17: Hoare triple {47532#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {47579#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:10,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {47579#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {47530#true} is VALID [2022-02-20 20:00:10,154 INFO L272 TraceCheckUtils]: 19: Hoare triple {47530#true} call #t~ret8 := is_do_write_p_triggered(); {47530#true} is VALID [2022-02-20 20:00:10,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {47530#true} havoc ~__retres1~0; {47530#true} is VALID [2022-02-20 20:00:10,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {47530#true} assume !(1 == ~p_dw_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {47530#true} assume !(2 == ~p_dw_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {47530#true} ~__retres1~0 := 0; {47530#true} is VALID [2022-02-20 20:00:10,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {47530#true} #res := ~__retres1~0; {47530#true} is VALID [2022-02-20 20:00:10,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,154 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {47530#true} {47530#true} #1045#return; {47530#true} is VALID [2022-02-20 20:00:10,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {47530#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {47530#true} is VALID [2022-02-20 20:00:10,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {47530#true} assume !(0 != ~tmp~1); {47530#true} is VALID [2022-02-20 20:00:10,155 INFO L272 TraceCheckUtils]: 29: Hoare triple {47530#true} call #t~ret9 := is_do_read_c_triggered(); {47530#true} is VALID [2022-02-20 20:00:10,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {47530#true} havoc ~__retres1~1; {47530#true} is VALID [2022-02-20 20:00:10,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {47530#true} assume !(1 == ~c_dr_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {47530#true} assume !(2 == ~c_dr_pc~0); {47530#true} is VALID [2022-02-20 20:00:10,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {47530#true} ~__retres1~1 := 0; {47530#true} is VALID [2022-02-20 20:00:10,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {47530#true} #res := ~__retres1~1; {47530#true} is VALID [2022-02-20 20:00:10,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,156 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {47530#true} {47530#true} #1047#return; {47530#true} is VALID [2022-02-20 20:00:10,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {47530#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {47530#true} is VALID [2022-02-20 20:00:10,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {47530#true} assume !(0 != ~tmp___0~1); {47530#true} is VALID [2022-02-20 20:00:10,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,156 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {47530#true} {47532#(= ~q_write_ev~0 ~q_read_ev~0)} #1053#return; {47532#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:10,157 INFO L272 TraceCheckUtils]: 41: Hoare triple {47532#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:10,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {47578#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {47594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:00:10,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {47594#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {47595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:10,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {47595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {47595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:10,158 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {47595#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {47532#(= ~q_write_ev~0 ~q_read_ev~0)} #1055#return; {47531#false} is VALID [2022-02-20 20:00:10,158 INFO L290 TraceCheckUtils]: 46: Hoare triple {47531#false} assume !false; {47531#false} is VALID [2022-02-20 20:00:10,158 INFO L290 TraceCheckUtils]: 47: Hoare triple {47531#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {47531#false} is VALID [2022-02-20 20:00:10,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {47531#false} assume !false; {47531#false} is VALID [2022-02-20 20:00:10,159 INFO L272 TraceCheckUtils]: 49: Hoare triple {47531#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {47530#true} is VALID [2022-02-20 20:00:10,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {47530#true} havoc ~__retres1~2; {47530#true} is VALID [2022-02-20 20:00:10,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {47530#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47530#true} is VALID [2022-02-20 20:00:10,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {47530#true} #res := ~__retres1~2; {47530#true} is VALID [2022-02-20 20:00:10,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,159 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {47530#true} {47531#false} #1057#return; {47531#false} is VALID [2022-02-20 20:00:10,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {47531#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {47531#false} is VALID [2022-02-20 20:00:10,159 INFO L290 TraceCheckUtils]: 56: Hoare triple {47531#false} assume 0 != eval1_~tmp___1~0#1; {47531#false} is VALID [2022-02-20 20:00:10,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {47531#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {47531#false} is VALID [2022-02-20 20:00:10,160 INFO L290 TraceCheckUtils]: 58: Hoare triple {47531#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {47531#false} is VALID [2022-02-20 20:00:10,160 INFO L290 TraceCheckUtils]: 59: Hoare triple {47531#false} assume 0 == ~p_dw_pc~0; {47531#false} is VALID [2022-02-20 20:00:10,160 INFO L290 TraceCheckUtils]: 60: Hoare triple {47531#false} assume !false; {47531#false} is VALID [2022-02-20 20:00:10,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {47531#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {47531#false} is VALID [2022-02-20 20:00:10,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {47531#false} assume { :end_inline_do_write_p } true; {47531#false} is VALID [2022-02-20 20:00:10,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {47531#false} assume !(0 == ~c_dr_st~0); {47531#false} is VALID [2022-02-20 20:00:10,160 INFO L290 TraceCheckUtils]: 64: Hoare triple {47531#false} assume !false; {47531#false} is VALID [2022-02-20 20:00:10,161 INFO L272 TraceCheckUtils]: 65: Hoare triple {47531#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {47530#true} is VALID [2022-02-20 20:00:10,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {47530#true} havoc ~__retres1~2; {47530#true} is VALID [2022-02-20 20:00:10,161 INFO L290 TraceCheckUtils]: 67: Hoare triple {47530#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {47530#true} is VALID [2022-02-20 20:00:10,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {47530#true} #res := ~__retres1~2; {47530#true} is VALID [2022-02-20 20:00:10,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {47530#true} assume true; {47530#true} is VALID [2022-02-20 20:00:10,161 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {47530#true} {47531#false} #1057#return; {47531#false} is VALID [2022-02-20 20:00:10,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {47531#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {47531#false} is VALID [2022-02-20 20:00:10,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {47531#false} assume 0 != eval1_~tmp___1~0#1; {47531#false} is VALID [2022-02-20 20:00:10,162 INFO L290 TraceCheckUtils]: 73: Hoare triple {47531#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {47531#false} is VALID [2022-02-20 20:00:10,162 INFO L290 TraceCheckUtils]: 74: Hoare triple {47531#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {47531#false} is VALID [2022-02-20 20:00:10,162 INFO L290 TraceCheckUtils]: 75: Hoare triple {47531#false} assume !(0 == ~p_dw_pc~0); {47531#false} is VALID [2022-02-20 20:00:10,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {47531#false} assume 1 == ~p_dw_pc~0; {47531#false} is VALID [2022-02-20 20:00:10,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {47531#false} assume !(0 == ~q_free~0); {47531#false} is VALID [2022-02-20 20:00:10,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {47531#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_req_up~0 := 1; {47531#false} is VALID [2022-02-20 20:00:10,162 INFO L290 TraceCheckUtils]: 79: Hoare triple {47531#false} assume !false; {47531#false} is VALID [2022-02-20 20:00:10,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {47531#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {47531#false} is VALID [2022-02-20 20:00:10,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {47531#false} assume { :end_inline_do_write_p } true; {47531#false} is VALID [2022-02-20 20:00:10,163 INFO L290 TraceCheckUtils]: 82: Hoare triple {47531#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {47531#false} is VALID [2022-02-20 20:00:10,163 INFO L290 TraceCheckUtils]: 83: Hoare triple {47531#false} assume 0 != eval1_~tmp___0~2#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; {47531#false} is VALID [2022-02-20 20:00:10,163 INFO L290 TraceCheckUtils]: 84: Hoare triple {47531#false} assume !(0 == ~c_dr_pc~0); {47531#false} is VALID [2022-02-20 20:00:10,163 INFO L290 TraceCheckUtils]: 85: Hoare triple {47531#false} assume 2 == ~c_dr_pc~0; {47531#false} is VALID [2022-02-20 20:00:10,163 INFO L290 TraceCheckUtils]: 86: Hoare triple {47531#false} do_read_c_~a~0#1 := ~a_t~0; {47531#false} is VALID [2022-02-20 20:00:10,163 INFO L290 TraceCheckUtils]: 87: Hoare triple {47531#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_req_up~0 := 1; {47531#false} is VALID [2022-02-20 20:00:10,163 INFO L290 TraceCheckUtils]: 88: Hoare triple {47531#false} assume !(~p_last_write~0 == ~c_last_read~0); {47531#false} is VALID [2022-02-20 20:00:10,163 INFO L272 TraceCheckUtils]: 89: Hoare triple {47531#false} call error1(); {47531#false} is VALID [2022-02-20 20:00:10,164 INFO L290 TraceCheckUtils]: 90: Hoare triple {47531#false} assume !false; {47531#false} is VALID [2022-02-20 20:00:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:00:10,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:10,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571816735] [2022-02-20 20:00:10,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571816735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:10,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:10,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:10,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146547385] [2022-02-20 20:00:10,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:10,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:10,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:10,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:10,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:10,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:10,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:10,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:10,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:10,214 INFO L87 Difference]: Start difference. First operand 1877 states and 2430 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:12,830 INFO L93 Difference]: Finished difference Result 3404 states and 4394 transitions. [2022-02-20 20:00:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:00:12,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 783 transitions. [2022-02-20 20:00:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 783 transitions. [2022-02-20 20:00:12,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 783 transitions. [2022-02-20 20:00:13,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 783 edges. 783 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:13,405 INFO L225 Difference]: With dead ends: 3404 [2022-02-20 20:00:13,405 INFO L226 Difference]: Without dead ends: 1951 [2022-02-20 20:00:13,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-02-20 20:00:13,410 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 835 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:13,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 1506 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 20:00:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2022-02-20 20:00:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1656. [2022-02-20 20:00:13,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:13,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1951 states. Second operand has 1656 states, 1319 states have (on average 1.3131159969673996) internal successors, (1732), 1339 states have internal predecessors, (1732), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:13,582 INFO L74 IsIncluded]: Start isIncluded. First operand 1951 states. Second operand has 1656 states, 1319 states have (on average 1.3131159969673996) internal successors, (1732), 1339 states have internal predecessors, (1732), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:13,584 INFO L87 Difference]: Start difference. First operand 1951 states. Second operand has 1656 states, 1319 states have (on average 1.3131159969673996) internal successors, (1732), 1339 states have internal predecessors, (1732), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:13,742 INFO L93 Difference]: Finished difference Result 1951 states and 2517 transitions. [2022-02-20 20:00:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2517 transitions. [2022-02-20 20:00:13,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:13,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:13,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 1656 states, 1319 states have (on average 1.3131159969673996) internal successors, (1732), 1339 states have internal predecessors, (1732), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) Second operand 1951 states. [2022-02-20 20:00:13,751 INFO L87 Difference]: Start difference. First operand has 1656 states, 1319 states have (on average 1.3131159969673996) internal successors, (1732), 1339 states have internal predecessors, (1732), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) Second operand 1951 states. [2022-02-20 20:00:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:13,898 INFO L93 Difference]: Finished difference Result 1951 states and 2517 transitions. [2022-02-20 20:00:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2517 transitions. [2022-02-20 20:00:13,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:13,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:13,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:13,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1319 states have (on average 1.3131159969673996) internal successors, (1732), 1339 states have internal predecessors, (1732), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2144 transitions. [2022-02-20 20:00:14,060 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2144 transitions. Word has length 91 [2022-02-20 20:00:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:14,060 INFO L470 AbstractCegarLoop]: Abstraction has 1656 states and 2144 transitions. [2022-02-20 20:00:14,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2144 transitions. [2022-02-20 20:00:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:14,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:14,062 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:14,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:00:14,062 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:14,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash 392221105, now seen corresponding path program 1 times [2022-02-20 20:00:14,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:14,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065315265] [2022-02-20 20:00:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {58326#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {58279#true} is VALID [2022-02-20 20:00:14,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58279#true} {58279#true} #1049#return; {58279#true} is VALID [2022-02-20 20:00:14,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {58327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {58279#true} is VALID [2022-02-20 20:00:14,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {58279#true} assume !(0 == ~q_write_ev~0); {58279#true} is VALID [2022-02-20 20:00:14,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58279#true} {58284#(= ~c_dr_st~0 0)} #1051#return; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {58279#true} havoc ~__retres1~0; {58279#true} is VALID [2022-02-20 20:00:14,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {58279#true} assume !(1 == ~p_dw_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {58279#true} assume !(2 == ~p_dw_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {58279#true} ~__retres1~0 := 0; {58279#true} is VALID [2022-02-20 20:00:14,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {58279#true} #res := ~__retres1~0; {58279#true} is VALID [2022-02-20 20:00:14,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,145 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {58279#true} {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1045#return; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {58279#true} havoc ~__retres1~1; {58279#true} is VALID [2022-02-20 20:00:14,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {58279#true} assume !(1 == ~c_dr_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {58279#true} assume !(2 == ~c_dr_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {58279#true} ~__retres1~1 := 0; {58279#true} is VALID [2022-02-20 20:00:14,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {58279#true} #res := ~__retres1~1; {58279#true} is VALID [2022-02-20 20:00:14,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,150 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {58279#true} {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1047#return; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {58328#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,151 INFO L272 TraceCheckUtils]: 1: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {58279#true} is VALID [2022-02-20 20:00:14,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {58279#true} havoc ~__retres1~0; {58279#true} is VALID [2022-02-20 20:00:14,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {58279#true} assume !(1 == ~p_dw_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {58279#true} assume !(2 == ~p_dw_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {58279#true} ~__retres1~0 := 0; {58279#true} is VALID [2022-02-20 20:00:14,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {58279#true} #res := ~__retres1~0; {58279#true} is VALID [2022-02-20 20:00:14,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,152 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {58279#true} {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1045#return; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,153 INFO L272 TraceCheckUtils]: 11: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {58279#true} is VALID [2022-02-20 20:00:14,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {58279#true} havoc ~__retres1~1; {58279#true} is VALID [2022-02-20 20:00:14,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {58279#true} assume !(1 == ~c_dr_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {58279#true} assume !(2 == ~c_dr_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {58279#true} ~__retres1~1 := 0; {58279#true} is VALID [2022-02-20 20:00:14,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {58279#true} #res := ~__retres1~1; {58279#true} is VALID [2022-02-20 20:00:14,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,154 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {58279#true} {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1047#return; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,156 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {58284#(= ~c_dr_st~0 0)} #1053#return; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {58327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {58279#true} is VALID [2022-02-20 20:00:14,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {58279#true} assume !(1 == ~q_write_ev~0); {58279#true} is VALID [2022-02-20 20:00:14,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58279#true} {58284#(= ~c_dr_st~0 0)} #1055#return; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {58279#true} havoc ~__retres1~2; {58279#true} is VALID [2022-02-20 20:00:14,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {58279#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {58279#true} is VALID [2022-02-20 20:00:14,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {58279#true} #res := ~__retres1~2; {58279#true} is VALID [2022-02-20 20:00:14,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,164 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {58279#true} {58284#(= ~c_dr_st~0 0)} #1057#return; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:14,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {58279#true} havoc ~__retres1~2; {58279#true} is VALID [2022-02-20 20:00:14,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {58279#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {58279#true} is VALID [2022-02-20 20:00:14,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {58279#true} #res := ~__retres1~2; {58279#true} is VALID [2022-02-20 20:00:14,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,169 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {58279#true} {58280#false} #1057#return; {58280#false} is VALID [2022-02-20 20:00:14,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {58279#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {58279#true} is VALID [2022-02-20 20:00:14,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {58279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {58279#true} is VALID [2022-02-20 20:00:14,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {58279#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {58279#true} is VALID [2022-02-20 20:00:14,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {58279#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {58279#true} is VALID [2022-02-20 20:00:14,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {58279#true} call update_channels1(); {58326#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:14,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {58326#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {58279#true} is VALID [2022-02-20 20:00:14,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,170 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {58279#true} {58279#true} #1049#return; {58279#true} is VALID [2022-02-20 20:00:14,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {58279#true} assume { :begin_inline_init_threads1 } true; {58279#true} is VALID [2022-02-20 20:00:14,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {58279#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {58279#true} is VALID [2022-02-20 20:00:14,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {58279#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {58284#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,172 INFO L272 TraceCheckUtils]: 12: Hoare triple {58284#(= ~c_dr_st~0 0)} call fire_delta_events1(); {58327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:14,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {58327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {58279#true} is VALID [2022-02-20 20:00:14,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {58279#true} assume !(0 == ~q_write_ev~0); {58279#true} is VALID [2022-02-20 20:00:14,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,173 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {58279#true} {58284#(= ~c_dr_st~0 0)} #1051#return; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,173 INFO L272 TraceCheckUtils]: 17: Hoare triple {58284#(= ~c_dr_st~0 0)} call activate_threads1(); {58328#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:14,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {58328#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,174 INFO L272 TraceCheckUtils]: 19: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {58279#true} is VALID [2022-02-20 20:00:14,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {58279#true} havoc ~__retres1~0; {58279#true} is VALID [2022-02-20 20:00:14,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {58279#true} assume !(1 == ~p_dw_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {58279#true} assume !(2 == ~p_dw_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {58279#true} ~__retres1~0 := 0; {58279#true} is VALID [2022-02-20 20:00:14,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {58279#true} #res := ~__retres1~0; {58279#true} is VALID [2022-02-20 20:00:14,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,175 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {58279#true} {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1045#return; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,176 INFO L272 TraceCheckUtils]: 29: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {58279#true} is VALID [2022-02-20 20:00:14,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {58279#true} havoc ~__retres1~1; {58279#true} is VALID [2022-02-20 20:00:14,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {58279#true} assume !(1 == ~c_dr_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {58279#true} assume !(2 == ~c_dr_pc~0); {58279#true} is VALID [2022-02-20 20:00:14,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {58279#true} ~__retres1~1 := 0; {58279#true} is VALID [2022-02-20 20:00:14,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {58279#true} #res := ~__retres1~1; {58279#true} is VALID [2022-02-20 20:00:14,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,178 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {58279#true} {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1047#return; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:00:14,179 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {58329#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {58284#(= ~c_dr_st~0 0)} #1053#return; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,180 INFO L272 TraceCheckUtils]: 41: Hoare triple {58284#(= ~c_dr_st~0 0)} call reset_delta_events1(); {58327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:14,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {58327#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {58279#true} is VALID [2022-02-20 20:00:14,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {58279#true} assume !(1 == ~q_write_ev~0); {58279#true} is VALID [2022-02-20 20:00:14,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,180 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {58279#true} {58284#(= ~c_dr_st~0 0)} #1055#return; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {58284#(= ~c_dr_st~0 0)} assume !false; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {58284#(= ~c_dr_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {58284#(= ~c_dr_st~0 0)} assume !false; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,182 INFO L272 TraceCheckUtils]: 49: Hoare triple {58284#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {58279#true} is VALID [2022-02-20 20:00:14,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {58279#true} havoc ~__retres1~2; {58279#true} is VALID [2022-02-20 20:00:14,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {58279#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {58279#true} is VALID [2022-02-20 20:00:14,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {58279#true} #res := ~__retres1~2; {58279#true} is VALID [2022-02-20 20:00:14,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,183 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {58279#true} {58284#(= ~c_dr_st~0 0)} #1057#return; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {58284#(= ~c_dr_st~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {58284#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {58284#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {58284#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {58284#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {58284#(= ~c_dr_st~0 0)} assume !false; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {58284#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {58284#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {58284#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:00:14,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {58284#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {58280#false} is VALID [2022-02-20 20:00:14,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {58280#false} assume !false; {58280#false} is VALID [2022-02-20 20:00:14,186 INFO L272 TraceCheckUtils]: 65: Hoare triple {58280#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {58279#true} is VALID [2022-02-20 20:00:14,186 INFO L290 TraceCheckUtils]: 66: Hoare triple {58279#true} havoc ~__retres1~2; {58279#true} is VALID [2022-02-20 20:00:14,186 INFO L290 TraceCheckUtils]: 67: Hoare triple {58279#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {58279#true} is VALID [2022-02-20 20:00:14,186 INFO L290 TraceCheckUtils]: 68: Hoare triple {58279#true} #res := ~__retres1~2; {58279#true} is VALID [2022-02-20 20:00:14,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {58279#true} assume true; {58279#true} is VALID [2022-02-20 20:00:14,187 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {58279#true} {58280#false} #1057#return; {58280#false} is VALID [2022-02-20 20:00:14,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {58280#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {58280#false} is VALID [2022-02-20 20:00:14,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {58280#false} assume 0 != eval1_~tmp___1~0#1; {58280#false} is VALID [2022-02-20 20:00:14,187 INFO L290 TraceCheckUtils]: 73: Hoare triple {58280#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {58280#false} is VALID [2022-02-20 20:00:14,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {58280#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {58280#false} is VALID [2022-02-20 20:00:14,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {58280#false} assume !(0 == ~p_dw_pc~0); {58280#false} is VALID [2022-02-20 20:00:14,188 INFO L290 TraceCheckUtils]: 76: Hoare triple {58280#false} assume 1 == ~p_dw_pc~0; {58280#false} is VALID [2022-02-20 20:00:14,188 INFO L290 TraceCheckUtils]: 77: Hoare triple {58280#false} assume !(0 == ~q_free~0); {58280#false} is VALID [2022-02-20 20:00:14,188 INFO L290 TraceCheckUtils]: 78: Hoare triple {58280#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_req_up~0 := 1; {58280#false} is VALID [2022-02-20 20:00:14,188 INFO L290 TraceCheckUtils]: 79: Hoare triple {58280#false} assume !false; {58280#false} is VALID [2022-02-20 20:00:14,188 INFO L290 TraceCheckUtils]: 80: Hoare triple {58280#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {58280#false} is VALID [2022-02-20 20:00:14,188 INFO L290 TraceCheckUtils]: 81: Hoare triple {58280#false} assume { :end_inline_do_write_p } true; {58280#false} is VALID [2022-02-20 20:00:14,188 INFO L290 TraceCheckUtils]: 82: Hoare triple {58280#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {58280#false} is VALID [2022-02-20 20:00:14,188 INFO L290 TraceCheckUtils]: 83: Hoare triple {58280#false} assume 0 != eval1_~tmp___0~2#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; {58280#false} is VALID [2022-02-20 20:00:14,189 INFO L290 TraceCheckUtils]: 84: Hoare triple {58280#false} assume !(0 == ~c_dr_pc~0); {58280#false} is VALID [2022-02-20 20:00:14,189 INFO L290 TraceCheckUtils]: 85: Hoare triple {58280#false} assume 2 == ~c_dr_pc~0; {58280#false} is VALID [2022-02-20 20:00:14,189 INFO L290 TraceCheckUtils]: 86: Hoare triple {58280#false} do_read_c_~a~0#1 := ~a_t~0; {58280#false} is VALID [2022-02-20 20:00:14,189 INFO L290 TraceCheckUtils]: 87: Hoare triple {58280#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_req_up~0 := 1; {58280#false} is VALID [2022-02-20 20:00:14,189 INFO L290 TraceCheckUtils]: 88: Hoare triple {58280#false} assume !(~p_last_write~0 == ~c_last_read~0); {58280#false} is VALID [2022-02-20 20:00:14,189 INFO L272 TraceCheckUtils]: 89: Hoare triple {58280#false} call error1(); {58280#false} is VALID [2022-02-20 20:00:14,189 INFO L290 TraceCheckUtils]: 90: Hoare triple {58280#false} assume !false; {58280#false} is VALID [2022-02-20 20:00:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:00:14,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:14,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065315265] [2022-02-20 20:00:14,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065315265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:14,190 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:14,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:14,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419309372] [2022-02-20 20:00:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:14,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:00:14,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:14,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:14,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:14,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:14,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:14,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:14,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:14,251 INFO L87 Difference]: Start difference. First operand 1656 states and 2144 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:17,182 INFO L93 Difference]: Finished difference Result 4808 states and 6256 transitions. [2022-02-20 20:00:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:00:17,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:00:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 732 transitions. [2022-02-20 20:00:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 732 transitions. [2022-02-20 20:00:17,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 732 transitions. [2022-02-20 20:00:17,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 732 edges. 732 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:18,357 INFO L225 Difference]: With dead ends: 4808 [2022-02-20 20:00:18,357 INFO L226 Difference]: Without dead ends: 3339 [2022-02-20 20:00:18,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 20:00:18,389 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 756 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:18,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 1233 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:00:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-02-20 20:00:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3125. [2022-02-20 20:00:18,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:18,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 3125 states, 2468 states have (on average 1.280388978930308) internal successors, (3160), 2517 states have internal predecessors, (3160), 343 states have call successors, (343), 233 states have call predecessors, (343), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) [2022-02-20 20:00:18,736 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 3125 states, 2468 states have (on average 1.280388978930308) internal successors, (3160), 2517 states have internal predecessors, (3160), 343 states have call successors, (343), 233 states have call predecessors, (343), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) [2022-02-20 20:00:18,740 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 3125 states, 2468 states have (on average 1.280388978930308) internal successors, (3160), 2517 states have internal predecessors, (3160), 343 states have call successors, (343), 233 states have call predecessors, (343), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) [2022-02-20 20:00:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,197 INFO L93 Difference]: Finished difference Result 3339 states and 4312 transitions. [2022-02-20 20:00:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4312 transitions. [2022-02-20 20:00:19,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:19,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:19,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 3125 states, 2468 states have (on average 1.280388978930308) internal successors, (3160), 2517 states have internal predecessors, (3160), 343 states have call successors, (343), 233 states have call predecessors, (343), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) Second operand 3339 states. [2022-02-20 20:00:19,209 INFO L87 Difference]: Start difference. First operand has 3125 states, 2468 states have (on average 1.280388978930308) internal successors, (3160), 2517 states have internal predecessors, (3160), 343 states have call successors, (343), 233 states have call predecessors, (343), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) Second operand 3339 states. [2022-02-20 20:00:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:19,627 INFO L93 Difference]: Finished difference Result 3339 states and 4312 transitions. [2022-02-20 20:00:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4312 transitions. [2022-02-20 20:00:19,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:19,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:19,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:19,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2468 states have (on average 1.280388978930308) internal successors, (3160), 2517 states have internal predecessors, (3160), 343 states have call successors, (343), 233 states have call predecessors, (343), 312 states have return successors, (513), 377 states have call predecessors, (513), 341 states have call successors, (513) [2022-02-20 20:00:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4016 transitions. [2022-02-20 20:00:20,183 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4016 transitions. Word has length 91 [2022-02-20 20:00:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:20,183 INFO L470 AbstractCegarLoop]: Abstraction has 3125 states and 4016 transitions. [2022-02-20 20:00:20,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:00:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4016 transitions. [2022-02-20 20:00:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:00:20,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:20,188 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:20,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:00:20,188 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:20,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash -665616973, now seen corresponding path program 1 times [2022-02-20 20:00:20,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:20,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531003989] [2022-02-20 20:00:20,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:20,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {75720#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {75673#true} is VALID [2022-02-20 20:00:20,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75673#true} {75675#(= 1 ~c_dr_i~0)} #1049#return; {75675#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:20,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {75721#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {75673#true} is VALID [2022-02-20 20:00:20,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {75673#true} assume !(0 == ~q_write_ev~0); {75673#true} is VALID [2022-02-20 20:00:20,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75673#true} {75674#false} #1051#return; {75674#false} is VALID [2022-02-20 20:00:20,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {75673#true} havoc ~__retres1~0; {75673#true} is VALID [2022-02-20 20:00:20,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {75673#true} assume !(1 == ~p_dw_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {75673#true} assume !(2 == ~p_dw_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {75673#true} ~__retres1~0 := 0; {75673#true} is VALID [2022-02-20 20:00:20,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {75673#true} #res := ~__retres1~0; {75673#true} is VALID [2022-02-20 20:00:20,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,284 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {75673#true} {75673#true} #1045#return; {75673#true} is VALID [2022-02-20 20:00:20,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {75673#true} havoc ~__retres1~1; {75673#true} is VALID [2022-02-20 20:00:20,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {75673#true} assume !(1 == ~c_dr_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {75673#true} assume !(2 == ~c_dr_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {75673#true} ~__retres1~1 := 0; {75673#true} is VALID [2022-02-20 20:00:20,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {75673#true} #res := ~__retres1~1; {75673#true} is VALID [2022-02-20 20:00:20,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,287 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {75673#true} {75673#true} #1047#return; {75673#true} is VALID [2022-02-20 20:00:20,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {75722#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {75673#true} is VALID [2022-02-20 20:00:20,287 INFO L272 TraceCheckUtils]: 1: Hoare triple {75673#true} call #t~ret8 := is_do_write_p_triggered(); {75673#true} is VALID [2022-02-20 20:00:20,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {75673#true} havoc ~__retres1~0; {75673#true} is VALID [2022-02-20 20:00:20,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {75673#true} assume !(1 == ~p_dw_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {75673#true} assume !(2 == ~p_dw_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {75673#true} ~__retres1~0 := 0; {75673#true} is VALID [2022-02-20 20:00:20,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {75673#true} #res := ~__retres1~0; {75673#true} is VALID [2022-02-20 20:00:20,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,288 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {75673#true} {75673#true} #1045#return; {75673#true} is VALID [2022-02-20 20:00:20,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {75673#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {75673#true} is VALID [2022-02-20 20:00:20,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {75673#true} assume !(0 != ~tmp~1); {75673#true} is VALID [2022-02-20 20:00:20,288 INFO L272 TraceCheckUtils]: 11: Hoare triple {75673#true} call #t~ret9 := is_do_read_c_triggered(); {75673#true} is VALID [2022-02-20 20:00:20,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {75673#true} havoc ~__retres1~1; {75673#true} is VALID [2022-02-20 20:00:20,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {75673#true} assume !(1 == ~c_dr_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {75673#true} assume !(2 == ~c_dr_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {75673#true} ~__retres1~1 := 0; {75673#true} is VALID [2022-02-20 20:00:20,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {75673#true} #res := ~__retres1~1; {75673#true} is VALID [2022-02-20 20:00:20,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,289 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {75673#true} {75673#true} #1047#return; {75673#true} is VALID [2022-02-20 20:00:20,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {75673#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {75673#true} is VALID [2022-02-20 20:00:20,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {75673#true} assume !(0 != ~tmp___0~1); {75673#true} is VALID [2022-02-20 20:00:20,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,290 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {75673#true} {75674#false} #1053#return; {75674#false} is VALID [2022-02-20 20:00:20,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {75721#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {75673#true} is VALID [2022-02-20 20:00:20,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {75673#true} assume !(1 == ~q_write_ev~0); {75673#true} is VALID [2022-02-20 20:00:20,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75673#true} {75674#false} #1055#return; {75674#false} is VALID [2022-02-20 20:00:20,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {75673#true} havoc ~__retres1~2; {75673#true} is VALID [2022-02-20 20:00:20,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {75673#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75673#true} is VALID [2022-02-20 20:00:20,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {75673#true} #res := ~__retres1~2; {75673#true} is VALID [2022-02-20 20:00:20,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,297 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75673#true} {75674#false} #1057#return; {75674#false} is VALID [2022-02-20 20:00:20,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:00:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:20,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {75673#true} havoc ~__retres1~2; {75673#true} is VALID [2022-02-20 20:00:20,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {75673#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75673#true} is VALID [2022-02-20 20:00:20,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {75673#true} #res := ~__retres1~2; {75673#true} is VALID [2022-02-20 20:00:20,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,301 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {75673#true} {75674#false} #1057#return; {75674#false} is VALID [2022-02-20 20:00:20,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {75673#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {75673#true} is VALID [2022-02-20 20:00:20,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {75673#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {75673#true} is VALID [2022-02-20 20:00:20,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {75673#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {75675#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:20,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {75675#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {75675#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:20,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {75675#(= 1 ~c_dr_i~0)} call update_channels1(); {75720#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:20,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {75720#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {75673#true} is VALID [2022-02-20 20:00:20,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,303 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {75673#true} {75675#(= 1 ~c_dr_i~0)} #1049#return; {75675#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:20,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {75675#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {75675#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:20,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {75675#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {75675#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:00:20,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {75675#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {75674#false} is VALID [2022-02-20 20:00:20,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {75674#false} assume { :end_inline_init_threads1 } true; {75674#false} is VALID [2022-02-20 20:00:20,304 INFO L272 TraceCheckUtils]: 12: Hoare triple {75674#false} call fire_delta_events1(); {75721#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:20,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {75721#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {75673#true} is VALID [2022-02-20 20:00:20,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {75673#true} assume !(0 == ~q_write_ev~0); {75673#true} is VALID [2022-02-20 20:00:20,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,305 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {75673#true} {75674#false} #1051#return; {75674#false} is VALID [2022-02-20 20:00:20,305 INFO L272 TraceCheckUtils]: 17: Hoare triple {75674#false} call activate_threads1(); {75722#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:20,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {75722#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {75673#true} is VALID [2022-02-20 20:00:20,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {75673#true} call #t~ret8 := is_do_write_p_triggered(); {75673#true} is VALID [2022-02-20 20:00:20,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {75673#true} havoc ~__retres1~0; {75673#true} is VALID [2022-02-20 20:00:20,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {75673#true} assume !(1 == ~p_dw_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {75673#true} assume !(2 == ~p_dw_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {75673#true} ~__retres1~0 := 0; {75673#true} is VALID [2022-02-20 20:00:20,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {75673#true} #res := ~__retres1~0; {75673#true} is VALID [2022-02-20 20:00:20,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,306 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75673#true} {75673#true} #1045#return; {75673#true} is VALID [2022-02-20 20:00:20,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {75673#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {75673#true} is VALID [2022-02-20 20:00:20,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {75673#true} assume !(0 != ~tmp~1); {75673#true} is VALID [2022-02-20 20:00:20,306 INFO L272 TraceCheckUtils]: 29: Hoare triple {75673#true} call #t~ret9 := is_do_read_c_triggered(); {75673#true} is VALID [2022-02-20 20:00:20,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {75673#true} havoc ~__retres1~1; {75673#true} is VALID [2022-02-20 20:00:20,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {75673#true} assume !(1 == ~c_dr_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {75673#true} assume !(2 == ~c_dr_pc~0); {75673#true} is VALID [2022-02-20 20:00:20,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {75673#true} ~__retres1~1 := 0; {75673#true} is VALID [2022-02-20 20:00:20,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {75673#true} #res := ~__retres1~1; {75673#true} is VALID [2022-02-20 20:00:20,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,307 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75673#true} {75673#true} #1047#return; {75673#true} is VALID [2022-02-20 20:00:20,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {75673#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {75673#true} is VALID [2022-02-20 20:00:20,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {75673#true} assume !(0 != ~tmp___0~1); {75673#true} is VALID [2022-02-20 20:00:20,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,308 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {75673#true} {75674#false} #1053#return; {75674#false} is VALID [2022-02-20 20:00:20,308 INFO L272 TraceCheckUtils]: 41: Hoare triple {75674#false} call reset_delta_events1(); {75721#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:20,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {75721#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {75673#true} is VALID [2022-02-20 20:00:20,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {75673#true} assume !(1 == ~q_write_ev~0); {75673#true} is VALID [2022-02-20 20:00:20,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,308 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {75673#true} {75674#false} #1055#return; {75674#false} is VALID [2022-02-20 20:00:20,308 INFO L290 TraceCheckUtils]: 46: Hoare triple {75674#false} assume !false; {75674#false} is VALID [2022-02-20 20:00:20,308 INFO L290 TraceCheckUtils]: 47: Hoare triple {75674#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {75674#false} is VALID [2022-02-20 20:00:20,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {75674#false} assume !false; {75674#false} is VALID [2022-02-20 20:00:20,309 INFO L272 TraceCheckUtils]: 49: Hoare triple {75674#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {75673#true} is VALID [2022-02-20 20:00:20,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {75673#true} havoc ~__retres1~2; {75673#true} is VALID [2022-02-20 20:00:20,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {75673#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75673#true} is VALID [2022-02-20 20:00:20,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {75673#true} #res := ~__retres1~2; {75673#true} is VALID [2022-02-20 20:00:20,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,309 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {75673#true} {75674#false} #1057#return; {75674#false} is VALID [2022-02-20 20:00:20,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {75674#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {75674#false} is VALID [2022-02-20 20:00:20,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {75674#false} assume 0 != eval1_~tmp___1~0#1; {75674#false} is VALID [2022-02-20 20:00:20,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {75674#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {75674#false} is VALID [2022-02-20 20:00:20,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {75674#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {75674#false} is VALID [2022-02-20 20:00:20,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {75674#false} assume 0 == ~p_dw_pc~0; {75674#false} is VALID [2022-02-20 20:00:20,310 INFO L290 TraceCheckUtils]: 60: Hoare triple {75674#false} assume !false; {75674#false} is VALID [2022-02-20 20:00:20,310 INFO L290 TraceCheckUtils]: 61: Hoare triple {75674#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {75674#false} is VALID [2022-02-20 20:00:20,310 INFO L290 TraceCheckUtils]: 62: Hoare triple {75674#false} assume { :end_inline_do_write_p } true; {75674#false} is VALID [2022-02-20 20:00:20,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {75674#false} assume !(0 == ~c_dr_st~0); {75674#false} is VALID [2022-02-20 20:00:20,311 INFO L290 TraceCheckUtils]: 64: Hoare triple {75674#false} assume !false; {75674#false} is VALID [2022-02-20 20:00:20,311 INFO L272 TraceCheckUtils]: 65: Hoare triple {75674#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {75673#true} is VALID [2022-02-20 20:00:20,311 INFO L290 TraceCheckUtils]: 66: Hoare triple {75673#true} havoc ~__retres1~2; {75673#true} is VALID [2022-02-20 20:00:20,311 INFO L290 TraceCheckUtils]: 67: Hoare triple {75673#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {75673#true} is VALID [2022-02-20 20:00:20,311 INFO L290 TraceCheckUtils]: 68: Hoare triple {75673#true} #res := ~__retres1~2; {75673#true} is VALID [2022-02-20 20:00:20,311 INFO L290 TraceCheckUtils]: 69: Hoare triple {75673#true} assume true; {75673#true} is VALID [2022-02-20 20:00:20,311 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {75673#true} {75674#false} #1057#return; {75674#false} is VALID [2022-02-20 20:00:20,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {75674#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {75674#false} is VALID [2022-02-20 20:00:20,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {75674#false} assume 0 != eval1_~tmp___1~0#1; {75674#false} is VALID [2022-02-20 20:00:20,312 INFO L290 TraceCheckUtils]: 73: Hoare triple {75674#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {75674#false} is VALID [2022-02-20 20:00:20,312 INFO L290 TraceCheckUtils]: 74: Hoare triple {75674#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {75674#false} is VALID [2022-02-20 20:00:20,312 INFO L290 TraceCheckUtils]: 75: Hoare triple {75674#false} assume !(0 == ~p_dw_pc~0); {75674#false} is VALID [2022-02-20 20:00:20,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {75674#false} assume 1 == ~p_dw_pc~0; {75674#false} is VALID [2022-02-20 20:00:20,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {75674#false} assume !(0 == ~q_free~0); {75674#false} is VALID [2022-02-20 20:00:20,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {75674#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_req_up~0 := 1; {75674#false} is VALID [2022-02-20 20:00:20,312 INFO L290 TraceCheckUtils]: 79: Hoare triple {75674#false} assume !false; {75674#false} is VALID [2022-02-20 20:00:20,312 INFO L290 TraceCheckUtils]: 80: Hoare triple {75674#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {75674#false} is VALID [2022-02-20 20:00:20,313 INFO L290 TraceCheckUtils]: 81: Hoare triple {75674#false} assume { :end_inline_do_write_p } true; {75674#false} is VALID [2022-02-20 20:00:20,313 INFO L290 TraceCheckUtils]: 82: Hoare triple {75674#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {75674#false} is VALID [2022-02-20 20:00:20,313 INFO L290 TraceCheckUtils]: 83: Hoare triple {75674#false} assume 0 != eval1_~tmp___0~2#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; {75674#false} is VALID [2022-02-20 20:00:20,313 INFO L290 TraceCheckUtils]: 84: Hoare triple {75674#false} assume !(0 == ~c_dr_pc~0); {75674#false} is VALID [2022-02-20 20:00:20,313 INFO L290 TraceCheckUtils]: 85: Hoare triple {75674#false} assume 2 == ~c_dr_pc~0; {75674#false} is VALID [2022-02-20 20:00:20,313 INFO L290 TraceCheckUtils]: 86: Hoare triple {75674#false} do_read_c_~a~0#1 := ~a_t~0; {75674#false} is VALID [2022-02-20 20:00:20,313 INFO L290 TraceCheckUtils]: 87: Hoare triple {75674#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_req_up~0 := 1; {75674#false} is VALID [2022-02-20 20:00:20,313 INFO L290 TraceCheckUtils]: 88: Hoare triple {75674#false} assume !(~p_last_write~0 == ~c_last_read~0); {75674#false} is VALID [2022-02-20 20:00:20,313 INFO L272 TraceCheckUtils]: 89: Hoare triple {75674#false} call error1(); {75674#false} is VALID [2022-02-20 20:00:20,314 INFO L290 TraceCheckUtils]: 90: Hoare triple {75674#false} assume !false; {75674#false} is VALID [2022-02-20 20:00:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:00:20,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:20,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531003989] [2022-02-20 20:00:20,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531003989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:20,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:20,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:20,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392397497] [2022-02-20 20:00:20,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:20,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:20,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:20,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:20,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:20,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:20,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:20,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:20,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:20,363 INFO L87 Difference]: Start difference. First operand 3125 states and 4016 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:22,710 INFO L93 Difference]: Finished difference Result 4709 states and 6000 transitions. [2022-02-20 20:00:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:00:22,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:00:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 577 transitions. [2022-02-20 20:00:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 577 transitions. [2022-02-20 20:00:22,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 577 transitions. [2022-02-20 20:00:23,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:23,257 INFO L225 Difference]: With dead ends: 4709 [2022-02-20 20:00:23,257 INFO L226 Difference]: Without dead ends: 1771 [2022-02-20 20:00:23,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:23,269 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 456 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:23,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 1072 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 20:00:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-02-20 20:00:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1656. [2022-02-20 20:00:23,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:23,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1771 states. Second operand has 1656 states, 1319 states have (on average 1.2850644427596665) internal successors, (1695), 1339 states have internal predecessors, (1695), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:23,426 INFO L74 IsIncluded]: Start isIncluded. First operand 1771 states. Second operand has 1656 states, 1319 states have (on average 1.2850644427596665) internal successors, (1695), 1339 states have internal predecessors, (1695), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:23,441 INFO L87 Difference]: Start difference. First operand 1771 states. Second operand has 1656 states, 1319 states have (on average 1.2850644427596665) internal successors, (1695), 1339 states have internal predecessors, (1695), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:23,647 INFO L93 Difference]: Finished difference Result 1771 states and 2267 transitions. [2022-02-20 20:00:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2267 transitions. [2022-02-20 20:00:23,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:23,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:23,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 1656 states, 1319 states have (on average 1.2850644427596665) internal successors, (1695), 1339 states have internal predecessors, (1695), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) Second operand 1771 states. [2022-02-20 20:00:23,668 INFO L87 Difference]: Start difference. First operand has 1656 states, 1319 states have (on average 1.2850644427596665) internal successors, (1695), 1339 states have internal predecessors, (1695), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) Second operand 1771 states. [2022-02-20 20:00:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:23,873 INFO L93 Difference]: Finished difference Result 1771 states and 2267 transitions. [2022-02-20 20:00:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2267 transitions. [2022-02-20 20:00:23,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:23,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:23,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:23,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1319 states have (on average 1.2850644427596665) internal successors, (1695), 1339 states have internal predecessors, (1695), 182 states have call successors, (182), 120 states have call predecessors, (182), 153 states have return successors, (230), 198 states have call predecessors, (230), 180 states have call successors, (230) [2022-02-20 20:00:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2107 transitions. [2022-02-20 20:00:24,153 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2107 transitions. Word has length 91 [2022-02-20 20:00:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:24,154 INFO L470 AbstractCegarLoop]: Abstraction has 1656 states and 2107 transitions. [2022-02-20 20:00:24,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2107 transitions. [2022-02-20 20:00:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:00:24,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:24,155 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:24,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:00:24,155 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:24,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1134197990, now seen corresponding path program 1 times [2022-02-20 20:00:24,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:24,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146997110] [2022-02-20 20:00:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {87883#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {87884#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {87884#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {87884#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87884#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {87837#(= ~q_read_ev~0 2)} #1049#return; {87837#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:24,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {87885#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {87835#true} is VALID [2022-02-20 20:00:24,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {87835#true} assume !(0 == ~q_write_ev~0); {87835#true} is VALID [2022-02-20 20:00:24,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87835#true} {87837#(= ~q_read_ev~0 2)} #1051#return; {87835#true} is VALID [2022-02-20 20:00:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {87835#true} havoc ~__retres1~0; {87835#true} is VALID [2022-02-20 20:00:24,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {87835#true} assume !(1 == ~p_dw_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {87835#true} assume !(2 == ~p_dw_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {87835#true} ~__retres1~0 := 0; {87835#true} is VALID [2022-02-20 20:00:24,273 INFO L290 TraceCheckUtils]: 4: Hoare triple {87835#true} #res := ~__retres1~0; {87835#true} is VALID [2022-02-20 20:00:24,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,273 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {87835#true} {87835#true} #1045#return; {87835#true} is VALID [2022-02-20 20:00:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {87835#true} havoc ~__retres1~1; {87835#true} is VALID [2022-02-20 20:00:24,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {87835#true} assume !(1 == ~c_dr_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {87835#true} assume !(2 == ~c_dr_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {87835#true} ~__retres1~1 := 0; {87835#true} is VALID [2022-02-20 20:00:24,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {87835#true} #res := ~__retres1~1; {87835#true} is VALID [2022-02-20 20:00:24,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,277 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {87835#true} {87835#true} #1047#return; {87835#true} is VALID [2022-02-20 20:00:24,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {87886#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {87835#true} is VALID [2022-02-20 20:00:24,277 INFO L272 TraceCheckUtils]: 1: Hoare triple {87835#true} call #t~ret8 := is_do_write_p_triggered(); {87835#true} is VALID [2022-02-20 20:00:24,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {87835#true} havoc ~__retres1~0; {87835#true} is VALID [2022-02-20 20:00:24,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {87835#true} assume !(1 == ~p_dw_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {87835#true} assume !(2 == ~p_dw_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {87835#true} ~__retres1~0 := 0; {87835#true} is VALID [2022-02-20 20:00:24,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {87835#true} #res := ~__retres1~0; {87835#true} is VALID [2022-02-20 20:00:24,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,278 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {87835#true} {87835#true} #1045#return; {87835#true} is VALID [2022-02-20 20:00:24,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {87835#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {87835#true} is VALID [2022-02-20 20:00:24,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {87835#true} assume !(0 != ~tmp~1); {87835#true} is VALID [2022-02-20 20:00:24,278 INFO L272 TraceCheckUtils]: 11: Hoare triple {87835#true} call #t~ret9 := is_do_read_c_triggered(); {87835#true} is VALID [2022-02-20 20:00:24,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {87835#true} havoc ~__retres1~1; {87835#true} is VALID [2022-02-20 20:00:24,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {87835#true} assume !(1 == ~c_dr_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {87835#true} assume !(2 == ~c_dr_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {87835#true} ~__retres1~1 := 0; {87835#true} is VALID [2022-02-20 20:00:24,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {87835#true} #res := ~__retres1~1; {87835#true} is VALID [2022-02-20 20:00:24,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,279 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {87835#true} {87835#true} #1047#return; {87835#true} is VALID [2022-02-20 20:00:24,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {87835#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {87835#true} is VALID [2022-02-20 20:00:24,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {87835#true} assume !(0 != ~tmp___0~1); {87835#true} is VALID [2022-02-20 20:00:24,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,279 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {87835#true} {87835#true} #1053#return; {87835#true} is VALID [2022-02-20 20:00:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:00:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {87885#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {87835#true} is VALID [2022-02-20 20:00:24,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {87835#true} assume !(1 == ~q_write_ev~0); {87835#true} is VALID [2022-02-20 20:00:24,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87835#true} {87835#true} #1055#return; {87835#true} is VALID [2022-02-20 20:00:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:00:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {87835#true} havoc ~__retres1~2; {87835#true} is VALID [2022-02-20 20:00:24,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {87835#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {87835#true} is VALID [2022-02-20 20:00:24,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {87835#true} #res := ~__retres1~2; {87835#true} is VALID [2022-02-20 20:00:24,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,285 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {87835#true} {87835#true} #1057#return; {87835#true} is VALID [2022-02-20 20:00:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:00:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:24,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {87835#true} havoc ~__retres1~2; {87835#true} is VALID [2022-02-20 20:00:24,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {87835#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {87901#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:24,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {87901#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {87901#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:24,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {87901#(= ~p_dw_st~0 0)} assume true; {87901#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:24,311 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {87901#(= ~p_dw_st~0 0)} {87877#(not (= ~p_dw_st~0 0))} #1057#return; {87836#false} is VALID [2022-02-20 20:00:24,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {87835#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {87835#true} is VALID [2022-02-20 20:00:24,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {87835#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {87835#true} is VALID [2022-02-20 20:00:24,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {87835#true} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#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;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; {87837#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:24,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {87837#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {87837#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:24,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {87837#(= ~q_read_ev~0 2)} call update_channels1(); {87883#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:24,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {87883#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {87884#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {87884#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {87884#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:24,314 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {87884#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {87837#(= ~q_read_ev~0 2)} #1049#return; {87837#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:24,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {87837#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {87837#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:24,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {87837#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {87837#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:24,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {87837#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {87837#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:24,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {87837#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {87837#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:24,316 INFO L272 TraceCheckUtils]: 12: Hoare triple {87837#(= ~q_read_ev~0 2)} call fire_delta_events1(); {87885#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:24,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {87885#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {87835#true} is VALID [2022-02-20 20:00:24,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {87835#true} assume !(0 == ~q_write_ev~0); {87835#true} is VALID [2022-02-20 20:00:24,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,316 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {87835#true} {87837#(= ~q_read_ev~0 2)} #1051#return; {87835#true} is VALID [2022-02-20 20:00:24,316 INFO L272 TraceCheckUtils]: 17: Hoare triple {87835#true} call activate_threads1(); {87886#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:24,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {87886#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {87835#true} is VALID [2022-02-20 20:00:24,317 INFO L272 TraceCheckUtils]: 19: Hoare triple {87835#true} call #t~ret8 := is_do_write_p_triggered(); {87835#true} is VALID [2022-02-20 20:00:24,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {87835#true} havoc ~__retres1~0; {87835#true} is VALID [2022-02-20 20:00:24,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {87835#true} assume !(1 == ~p_dw_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {87835#true} assume !(2 == ~p_dw_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {87835#true} ~__retres1~0 := 0; {87835#true} is VALID [2022-02-20 20:00:24,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {87835#true} #res := ~__retres1~0; {87835#true} is VALID [2022-02-20 20:00:24,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,317 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {87835#true} {87835#true} #1045#return; {87835#true} is VALID [2022-02-20 20:00:24,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {87835#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {87835#true} is VALID [2022-02-20 20:00:24,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {87835#true} assume !(0 != ~tmp~1); {87835#true} is VALID [2022-02-20 20:00:24,318 INFO L272 TraceCheckUtils]: 29: Hoare triple {87835#true} call #t~ret9 := is_do_read_c_triggered(); {87835#true} is VALID [2022-02-20 20:00:24,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {87835#true} havoc ~__retres1~1; {87835#true} is VALID [2022-02-20 20:00:24,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {87835#true} assume !(1 == ~c_dr_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,318 INFO L290 TraceCheckUtils]: 32: Hoare triple {87835#true} assume !(2 == ~c_dr_pc~0); {87835#true} is VALID [2022-02-20 20:00:24,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {87835#true} ~__retres1~1 := 0; {87835#true} is VALID [2022-02-20 20:00:24,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {87835#true} #res := ~__retres1~1; {87835#true} is VALID [2022-02-20 20:00:24,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,319 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {87835#true} {87835#true} #1047#return; {87835#true} is VALID [2022-02-20 20:00:24,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {87835#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {87835#true} is VALID [2022-02-20 20:00:24,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {87835#true} assume !(0 != ~tmp___0~1); {87835#true} is VALID [2022-02-20 20:00:24,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,319 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {87835#true} {87835#true} #1053#return; {87835#true} is VALID [2022-02-20 20:00:24,320 INFO L272 TraceCheckUtils]: 41: Hoare triple {87835#true} call reset_delta_events1(); {87885#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:24,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {87885#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {87835#true} is VALID [2022-02-20 20:00:24,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {87835#true} assume !(1 == ~q_write_ev~0); {87835#true} is VALID [2022-02-20 20:00:24,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,320 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {87835#true} {87835#true} #1055#return; {87835#true} is VALID [2022-02-20 20:00:24,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {87835#true} assume !false; {87835#true} is VALID [2022-02-20 20:00:24,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {87835#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {87835#true} is VALID [2022-02-20 20:00:24,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {87835#true} assume !false; {87835#true} is VALID [2022-02-20 20:00:24,320 INFO L272 TraceCheckUtils]: 49: Hoare triple {87835#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {87835#true} is VALID [2022-02-20 20:00:24,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {87835#true} havoc ~__retres1~2; {87835#true} is VALID [2022-02-20 20:00:24,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {87835#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {87835#true} is VALID [2022-02-20 20:00:24,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {87835#true} #res := ~__retres1~2; {87835#true} is VALID [2022-02-20 20:00:24,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {87835#true} assume true; {87835#true} is VALID [2022-02-20 20:00:24,321 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {87835#true} {87835#true} #1057#return; {87835#true} is VALID [2022-02-20 20:00:24,321 INFO L290 TraceCheckUtils]: 55: Hoare triple {87835#true} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {87835#true} is VALID [2022-02-20 20:00:24,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {87835#true} assume 0 != eval1_~tmp___1~0#1; {87835#true} is VALID [2022-02-20 20:00:24,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {87835#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {87835#true} is VALID [2022-02-20 20:00:24,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {87835#true} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {87835#true} is VALID [2022-02-20 20:00:24,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {87835#true} assume 0 == ~p_dw_pc~0; {87835#true} is VALID [2022-02-20 20:00:24,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {87835#true} assume !false; {87835#true} is VALID [2022-02-20 20:00:24,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {87835#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {87877#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:24,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {87877#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {87877#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:24,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {87877#(not (= ~p_dw_st~0 0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {87877#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:24,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {87877#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {87877#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:24,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {87877#(not (= ~p_dw_st~0 0))} assume !false; {87877#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:00:24,323 INFO L272 TraceCheckUtils]: 66: Hoare triple {87877#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {87835#true} is VALID [2022-02-20 20:00:24,324 INFO L290 TraceCheckUtils]: 67: Hoare triple {87835#true} havoc ~__retres1~2; {87835#true} is VALID [2022-02-20 20:00:24,324 INFO L290 TraceCheckUtils]: 68: Hoare triple {87835#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {87901#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:24,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {87901#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {87901#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:24,324 INFO L290 TraceCheckUtils]: 70: Hoare triple {87901#(= ~p_dw_st~0 0)} assume true; {87901#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:00:24,325 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {87901#(= ~p_dw_st~0 0)} {87877#(not (= ~p_dw_st~0 0))} #1057#return; {87836#false} is VALID [2022-02-20 20:00:24,325 INFO L290 TraceCheckUtils]: 72: Hoare triple {87836#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {87836#false} is VALID [2022-02-20 20:00:24,325 INFO L290 TraceCheckUtils]: 73: Hoare triple {87836#false} assume 0 != eval1_~tmp___1~0#1; {87836#false} is VALID [2022-02-20 20:00:24,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {87836#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {87836#false} is VALID [2022-02-20 20:00:24,325 INFO L290 TraceCheckUtils]: 75: Hoare triple {87836#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {87836#false} is VALID [2022-02-20 20:00:24,325 INFO L290 TraceCheckUtils]: 76: Hoare triple {87836#false} assume !(0 == ~p_dw_pc~0); {87836#false} is VALID [2022-02-20 20:00:24,325 INFO L290 TraceCheckUtils]: 77: Hoare triple {87836#false} assume 1 == ~p_dw_pc~0; {87836#false} is VALID [2022-02-20 20:00:24,326 INFO L290 TraceCheckUtils]: 78: Hoare triple {87836#false} assume !(0 == ~q_free~0); {87836#false} is VALID [2022-02-20 20:00:24,326 INFO L290 TraceCheckUtils]: 79: Hoare triple {87836#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_req_up~0 := 1; {87836#false} is VALID [2022-02-20 20:00:24,326 INFO L290 TraceCheckUtils]: 80: Hoare triple {87836#false} assume !false; {87836#false} is VALID [2022-02-20 20:00:24,326 INFO L290 TraceCheckUtils]: 81: Hoare triple {87836#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {87836#false} is VALID [2022-02-20 20:00:24,326 INFO L290 TraceCheckUtils]: 82: Hoare triple {87836#false} assume { :end_inline_do_write_p } true; {87836#false} is VALID [2022-02-20 20:00:24,326 INFO L290 TraceCheckUtils]: 83: Hoare triple {87836#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {87836#false} is VALID [2022-02-20 20:00:24,326 INFO L290 TraceCheckUtils]: 84: Hoare triple {87836#false} assume 0 != eval1_~tmp___0~2#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; {87836#false} is VALID [2022-02-20 20:00:24,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {87836#false} assume !(0 == ~c_dr_pc~0); {87836#false} is VALID [2022-02-20 20:00:24,327 INFO L290 TraceCheckUtils]: 86: Hoare triple {87836#false} assume 2 == ~c_dr_pc~0; {87836#false} is VALID [2022-02-20 20:00:24,327 INFO L290 TraceCheckUtils]: 87: Hoare triple {87836#false} do_read_c_~a~0#1 := ~a_t~0; {87836#false} is VALID [2022-02-20 20:00:24,327 INFO L290 TraceCheckUtils]: 88: Hoare triple {87836#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_req_up~0 := 1; {87836#false} is VALID [2022-02-20 20:00:24,327 INFO L290 TraceCheckUtils]: 89: Hoare triple {87836#false} assume !(~p_last_write~0 == ~c_last_read~0); {87836#false} is VALID [2022-02-20 20:00:24,327 INFO L272 TraceCheckUtils]: 90: Hoare triple {87836#false} call error1(); {87836#false} is VALID [2022-02-20 20:00:24,327 INFO L290 TraceCheckUtils]: 91: Hoare triple {87836#false} assume !false; {87836#false} is VALID [2022-02-20 20:00:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:00:24,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:24,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146997110] [2022-02-20 20:00:24,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146997110] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:24,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:24,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:24,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642497543] [2022-02-20 20:00:24,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:00:24,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:24,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:24,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:24,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:24,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:24,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:24,415 INFO L87 Difference]: Start difference. First operand 1656 states and 2107 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:29,595 INFO L93 Difference]: Finished difference Result 4074 states and 5190 transitions. [2022-02-20 20:00:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 20:00:29,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:00:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1017 transitions. [2022-02-20 20:00:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1017 transitions. [2022-02-20 20:00:29,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 1017 transitions. [2022-02-20 20:00:30,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1017 edges. 1017 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:30,583 INFO L225 Difference]: With dead ends: 4074 [2022-02-20 20:00:30,583 INFO L226 Difference]: Without dead ends: 2454 [2022-02-20 20:00:30,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-02-20 20:00:30,586 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 1998 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:30,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2035 Valid, 1368 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:00:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2022-02-20 20:00:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2277. [2022-02-20 20:00:30,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:30,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2454 states. Second operand has 2277 states, 1786 states have (on average 1.2525195968645018) internal successors, (2237), 1814 states have internal predecessors, (2237), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:30,739 INFO L74 IsIncluded]: Start isIncluded. First operand 2454 states. Second operand has 2277 states, 1786 states have (on average 1.2525195968645018) internal successors, (2237), 1814 states have internal predecessors, (2237), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:30,740 INFO L87 Difference]: Start difference. First operand 2454 states. Second operand has 2277 states, 1786 states have (on average 1.2525195968645018) internal successors, (2237), 1814 states have internal predecessors, (2237), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:30,929 INFO L93 Difference]: Finished difference Result 2454 states and 3062 transitions. [2022-02-20 20:00:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 3062 transitions. [2022-02-20 20:00:30,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:30,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:30,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 2277 states, 1786 states have (on average 1.2525195968645018) internal successors, (2237), 1814 states have internal predecessors, (2237), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) Second operand 2454 states. [2022-02-20 20:00:30,948 INFO L87 Difference]: Start difference. First operand has 2277 states, 1786 states have (on average 1.2525195968645018) internal successors, (2237), 1814 states have internal predecessors, (2237), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) Second operand 2454 states. [2022-02-20 20:00:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:31,130 INFO L93 Difference]: Finished difference Result 2454 states and 3062 transitions. [2022-02-20 20:00:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 3062 transitions. [2022-02-20 20:00:31,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:31,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:31,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:31,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 1786 states have (on average 1.2525195968645018) internal successors, (2237), 1814 states have internal predecessors, (2237), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 2857 transitions. [2022-02-20 20:00:31,405 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 2857 transitions. Word has length 92 [2022-02-20 20:00:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:31,405 INFO L470 AbstractCegarLoop]: Abstraction has 2277 states and 2857 transitions. [2022-02-20 20:00:31,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:00:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2857 transitions. [2022-02-20 20:00:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 20:00:31,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:31,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:31,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:00:31,407 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1197403432, now seen corresponding path program 1 times [2022-02-20 20:00:31,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:31,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117142997] [2022-02-20 20:00:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:31,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,427 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {101364#true} {101366#(= ~t4_i~0 1)} #1077#return; {101366#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:31,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 20:00:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {101430#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {101364#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {101364#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {101364#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,441 INFO L290 TraceCheckUtils]: 4: Hoare triple {101364#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {101364#true} assume !(0 == ~E_M~0); {101364#true} is VALID [2022-02-20 20:00:31,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {101364#true} assume 0 == ~E_1~0;~E_1~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {101364#true} assume 0 == ~E_2~0;~E_2~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {101364#true} assume 0 == ~E_3~0;~E_3~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {101364#true} assume 0 == ~E_4~0;~E_4~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,442 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {101364#true} {101365#false} #1079#return; {101365#false} is VALID [2022-02-20 20:00:31,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 20:00:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {101431#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#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; {101364#true} is VALID [2022-02-20 20:00:31,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {101364#true} assume !(1 == ~m_pc~0); {101364#true} is VALID [2022-02-20 20:00:31,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {101364#true} is_master_triggered_~__retres1~4#1 := 0; {101364#true} is VALID [2022-02-20 20:00:31,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {101364#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {101364#true} is VALID [2022-02-20 20:00:31,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {101364#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {101364#true} is VALID [2022-02-20 20:00:31,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {101364#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {101364#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; {101364#true} is VALID [2022-02-20 20:00:31,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {101364#true} assume 1 == ~t1_pc~0; {101364#true} is VALID [2022-02-20 20:00:31,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {101364#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {101364#true} is VALID [2022-02-20 20:00:31,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {101364#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {101364#true} is VALID [2022-02-20 20:00:31,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {101364#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {101364#true} is VALID [2022-02-20 20:00:31,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {101364#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {101364#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {101364#true} is VALID [2022-02-20 20:00:31,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {101364#true} assume !(1 == ~t2_pc~0); {101364#true} is VALID [2022-02-20 20:00:31,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {101364#true} is_transmit2_triggered_~__retres1~6#1 := 0; {101364#true} is VALID [2022-02-20 20:00:31,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {101364#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {101364#true} is VALID [2022-02-20 20:00:31,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {101364#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {101364#true} is VALID [2022-02-20 20:00:31,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {101364#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {101364#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {101364#true} is VALID [2022-02-20 20:00:31,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {101364#true} assume 1 == ~t3_pc~0; {101364#true} is VALID [2022-02-20 20:00:31,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {101364#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {101364#true} is VALID [2022-02-20 20:00:31,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {101364#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {101364#true} is VALID [2022-02-20 20:00:31,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {101364#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {101364#true} is VALID [2022-02-20 20:00:31,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {101364#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {101364#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {101364#true} is VALID [2022-02-20 20:00:31,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {101364#true} assume 1 == ~t4_pc~0; {101364#true} is VALID [2022-02-20 20:00:31,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {101364#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {101364#true} is VALID [2022-02-20 20:00:31,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {101364#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {101364#true} is VALID [2022-02-20 20:00:31,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {101364#true} #t~ret31#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___3~0#1 := #t~ret31#1;havoc #t~ret31#1; {101364#true} is VALID [2022-02-20 20:00:31,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {101364#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,460 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {101364#true} {101365#false} #1081#return; {101365#false} is VALID [2022-02-20 20:00:31,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 20:00:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {101430#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {101364#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {101364#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {101364#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {101364#true} assume !(1 == ~T4_E~0); {101364#true} is VALID [2022-02-20 20:00:31,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {101364#true} assume 1 == ~E_M~0;~E_M~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {101364#true} assume 1 == ~E_1~0;~E_1~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {101364#true} assume 1 == ~E_2~0;~E_2~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {101364#true} assume 1 == ~E_3~0;~E_3~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {101364#true} assume 1 == ~E_4~0;~E_4~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,465 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {101364#true} {101365#false} #1083#return; {101365#false} is VALID [2022-02-20 20:00:31,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 20:00:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:31,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {101364#true} havoc ~__retres1~9; {101364#true} is VALID [2022-02-20 20:00:31,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {101364#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {101364#true} is VALID [2022-02-20 20:00:31,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {101364#true} #res := ~__retres1~9; {101364#true} is VALID [2022-02-20 20:00:31,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,468 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {101364#true} {101365#false} #1085#return; {101365#false} is VALID [2022-02-20 20:00:31,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {101364#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {101364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {101364#true} is VALID [2022-02-20 20:00:31,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {101364#true} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~10#1;havoc main2_~__retres1~10#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; {101366#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:31,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {101366#(= ~t4_i~0 1)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret33#1, start_simulation2_#t~ret34#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {101366#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:31,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {101366#(= ~t4_i~0 1)} call update_channels2(); {101364#true} is VALID [2022-02-20 20:00:31,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,469 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {101364#true} {101366#(= ~t4_i~0 1)} #1077#return; {101366#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:31,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {101366#(= ~t4_i~0 1)} assume { :begin_inline_init_threads2 } true; {101366#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:31,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {101366#(= ~t4_i~0 1)} assume 1 == ~m_i~0;~m_st~0 := 0; {101366#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:31,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {101366#(= ~t4_i~0 1)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {101366#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:31,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {101366#(= ~t4_i~0 1)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {101366#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:31,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {101366#(= ~t4_i~0 1)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {101366#(= ~t4_i~0 1)} is VALID [2022-02-20 20:00:31,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {101366#(= ~t4_i~0 1)} assume !(1 == ~t4_i~0);~t4_st~0 := 2; {101365#false} is VALID [2022-02-20 20:00:31,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {101365#false} assume { :end_inline_init_threads2 } true; {101365#false} is VALID [2022-02-20 20:00:31,471 INFO L272 TraceCheckUtils]: 14: Hoare triple {101365#false} call fire_delta_events2(); {101430#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:31,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {101430#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {101364#true} assume 0 == ~T1_E~0;~T1_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {101364#true} assume 0 == ~T2_E~0;~T2_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {101364#true} assume 0 == ~T3_E~0;~T3_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {101364#true} assume 0 == ~T4_E~0;~T4_E~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {101364#true} assume !(0 == ~E_M~0); {101364#true} is VALID [2022-02-20 20:00:31,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {101364#true} assume 0 == ~E_1~0;~E_1~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {101364#true} assume 0 == ~E_2~0;~E_2~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {101364#true} assume 0 == ~E_3~0;~E_3~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {101364#true} assume 0 == ~E_4~0;~E_4~0 := 1; {101364#true} is VALID [2022-02-20 20:00:31,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,473 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {101364#true} {101365#false} #1079#return; {101365#false} is VALID [2022-02-20 20:00:31,473 INFO L272 TraceCheckUtils]: 27: Hoare triple {101365#false} call activate_threads2(); {101431#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:31,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {101431#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#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; {101364#true} is VALID [2022-02-20 20:00:31,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {101364#true} assume !(1 == ~m_pc~0); {101364#true} is VALID [2022-02-20 20:00:31,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {101364#true} is_master_triggered_~__retres1~4#1 := 0; {101364#true} is VALID [2022-02-20 20:00:31,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {101364#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {101364#true} is VALID [2022-02-20 20:00:31,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {101364#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {101364#true} is VALID [2022-02-20 20:00:31,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {101364#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {101364#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; {101364#true} is VALID [2022-02-20 20:00:31,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {101364#true} assume 1 == ~t1_pc~0; {101364#true} is VALID [2022-02-20 20:00:31,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {101364#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {101364#true} is VALID [2022-02-20 20:00:31,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {101364#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {101364#true} is VALID [2022-02-20 20:00:31,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {101364#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {101364#true} is VALID [2022-02-20 20:00:31,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {101364#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {101364#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {101364#true} is VALID [2022-02-20 20:00:31,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {101364#true} assume !(1 == ~t2_pc~0); {101364#true} is VALID [2022-02-20 20:00:31,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {101364#true} is_transmit2_triggered_~__retres1~6#1 := 0; {101364#true} is VALID [2022-02-20 20:00:31,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {101364#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {101364#true} is VALID [2022-02-20 20:00:31,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {101364#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {101364#true} is VALID [2022-02-20 20:00:31,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {101364#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {101364#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {101364#true} is VALID [2022-02-20 20:00:31,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {101364#true} assume 1 == ~t3_pc~0; {101364#true} is VALID [2022-02-20 20:00:31,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {101364#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {101364#true} is VALID [2022-02-20 20:00:31,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {101364#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {101364#true} is VALID [2022-02-20 20:00:31,476 INFO L290 TraceCheckUtils]: 50: Hoare triple {101364#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {101364#true} is VALID [2022-02-20 20:00:31,476 INFO L290 TraceCheckUtils]: 51: Hoare triple {101364#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {101364#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {101364#true} is VALID [2022-02-20 20:00:31,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {101364#true} assume 1 == ~t4_pc~0; {101364#true} is VALID [2022-02-20 20:00:31,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {101364#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {101364#true} is VALID [2022-02-20 20:00:31,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {101364#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {101364#true} is VALID [2022-02-20 20:00:31,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {101364#true} #t~ret31#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___3~0#1 := #t~ret31#1;havoc #t~ret31#1; {101364#true} is VALID [2022-02-20 20:00:31,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {101364#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {101364#true} is VALID [2022-02-20 20:00:31,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,477 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {101364#true} {101365#false} #1081#return; {101365#false} is VALID [2022-02-20 20:00:31,477 INFO L272 TraceCheckUtils]: 60: Hoare triple {101365#false} call reset_delta_events2(); {101430#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:31,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {101430#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {101364#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {101364#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {101364#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,477 INFO L290 TraceCheckUtils]: 65: Hoare triple {101364#true} assume !(1 == ~T4_E~0); {101364#true} is VALID [2022-02-20 20:00:31,477 INFO L290 TraceCheckUtils]: 66: Hoare triple {101364#true} assume 1 == ~E_M~0;~E_M~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,477 INFO L290 TraceCheckUtils]: 67: Hoare triple {101364#true} assume 1 == ~E_1~0;~E_1~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {101364#true} assume 1 == ~E_2~0;~E_2~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {101364#true} assume 1 == ~E_3~0;~E_3~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,478 INFO L290 TraceCheckUtils]: 70: Hoare triple {101364#true} assume 1 == ~E_4~0;~E_4~0 := 2; {101364#true} is VALID [2022-02-20 20:00:31,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,478 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {101364#true} {101365#false} #1083#return; {101365#false} is VALID [2022-02-20 20:00:31,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {101365#false} assume !false; {101365#false} is VALID [2022-02-20 20:00:31,478 INFO L290 TraceCheckUtils]: 74: Hoare triple {101365#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_5~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {101365#false} is VALID [2022-02-20 20:00:31,478 INFO L290 TraceCheckUtils]: 75: Hoare triple {101365#false} assume !false; {101365#false} is VALID [2022-02-20 20:00:31,479 INFO L272 TraceCheckUtils]: 76: Hoare triple {101365#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {101364#true} is VALID [2022-02-20 20:00:31,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {101364#true} havoc ~__retres1~9; {101364#true} is VALID [2022-02-20 20:00:31,479 INFO L290 TraceCheckUtils]: 78: Hoare triple {101364#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {101364#true} is VALID [2022-02-20 20:00:31,479 INFO L290 TraceCheckUtils]: 79: Hoare triple {101364#true} #res := ~__retres1~9; {101364#true} is VALID [2022-02-20 20:00:31,479 INFO L290 TraceCheckUtils]: 80: Hoare triple {101364#true} assume true; {101364#true} is VALID [2022-02-20 20:00:31,479 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {101364#true} {101365#false} #1085#return; {101365#false} is VALID [2022-02-20 20:00:31,479 INFO L290 TraceCheckUtils]: 82: Hoare triple {101365#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {101365#false} is VALID [2022-02-20 20:00:31,479 INFO L290 TraceCheckUtils]: 83: Hoare triple {101365#false} assume 0 != eval2_~tmp~5#1; {101365#false} is VALID [2022-02-20 20:00:31,480 INFO L290 TraceCheckUtils]: 84: Hoare triple {101365#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {101365#false} is VALID [2022-02-20 20:00:31,480 INFO L290 TraceCheckUtils]: 85: Hoare triple {101365#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {101365#false} is VALID [2022-02-20 20:00:31,480 INFO L290 TraceCheckUtils]: 86: Hoare triple {101365#false} assume !(0 == ~m_pc~0); {101365#false} is VALID [2022-02-20 20:00:31,480 INFO L290 TraceCheckUtils]: 87: Hoare triple {101365#false} assume 1 == ~m_pc~0; {101365#false} is VALID [2022-02-20 20:00:31,480 INFO L290 TraceCheckUtils]: 88: Hoare triple {101365#false} assume ~token~0 != 4 + ~local~0;assume { :begin_inline_error2 } true; {101365#false} is VALID [2022-02-20 20:00:31,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {101365#false} assume !false; {101365#false} is VALID [2022-02-20 20:00:31,480 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 20:00:31,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:31,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117142997] [2022-02-20 20:00:31,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117142997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:31,481 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:31,481 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:00:31,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183317735] [2022-02-20 20:00:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:31,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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 90 [2022-02-20 20:00:31,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:31,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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 20:00:31,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:31,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:00:31,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:31,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:00:31,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:00:31,534 INFO L87 Difference]: Start difference. First operand 2277 states and 2857 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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 20:00:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:33,280 INFO L93 Difference]: Finished difference Result 2498 states and 3201 transitions. [2022-02-20 20:00:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:00:33,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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 90 [2022-02-20 20:00:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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 20:00:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2022-02-20 20:00:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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 20:00:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2022-02-20 20:00:33,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 756 transitions. [2022-02-20 20:00:33,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 756 edges. 756 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:34,171 INFO L225 Difference]: With dead ends: 2498 [2022-02-20 20:00:34,171 INFO L226 Difference]: Without dead ends: 2331 [2022-02-20 20:00:34,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:34,172 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 536 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:34,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 806 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:00:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2022-02-20 20:00:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2277. [2022-02-20 20:00:34,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:34,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2331 states. Second operand has 2277 states, 1786 states have (on average 1.2519596864501679) internal successors, (2236), 1814 states have internal predecessors, (2236), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:34,424 INFO L74 IsIncluded]: Start isIncluded. First operand 2331 states. Second operand has 2277 states, 1786 states have (on average 1.2519596864501679) internal successors, (2236), 1814 states have internal predecessors, (2236), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:34,425 INFO L87 Difference]: Start difference. First operand 2331 states. Second operand has 2277 states, 1786 states have (on average 1.2519596864501679) internal successors, (2236), 1814 states have internal predecessors, (2236), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:34,612 INFO L93 Difference]: Finished difference Result 2331 states and 2949 transitions. [2022-02-20 20:00:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2949 transitions. [2022-02-20 20:00:34,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:34,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:34,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 2277 states, 1786 states have (on average 1.2519596864501679) internal successors, (2236), 1814 states have internal predecessors, (2236), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) Second operand 2331 states. [2022-02-20 20:00:34,619 INFO L87 Difference]: Start difference. First operand has 2277 states, 1786 states have (on average 1.2519596864501679) internal successors, (2236), 1814 states have internal predecessors, (2236), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) Second operand 2331 states. [2022-02-20 20:00:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:34,786 INFO L93 Difference]: Finished difference Result 2331 states and 2949 transitions. [2022-02-20 20:00:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2949 transitions. [2022-02-20 20:00:34,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:34,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:34,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:34,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 1786 states have (on average 1.2519596864501679) internal successors, (2236), 1814 states have internal predecessors, (2236), 259 states have call successors, (259), 168 states have call predecessors, (259), 230 states have return successors, (361), 296 states have call predecessors, (361), 257 states have call successors, (361) [2022-02-20 20:00:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 2856 transitions. [2022-02-20 20:00:35,063 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 2856 transitions. Word has length 90 [2022-02-20 20:00:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:35,064 INFO L470 AbstractCegarLoop]: Abstraction has 2277 states and 2856 transitions. [2022-02-20 20:00:35,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 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 20:00:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 2856 transitions. [2022-02-20 20:00:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 20:00:35,065 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:35,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:35,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 20:00:35,066 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash 358369770, now seen corresponding path program 1 times [2022-02-20 20:00:35,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:35,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509829919] [2022-02-20 20:00:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:35,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {112498#true} assume true; {112498#true} is VALID [2022-02-20 20:00:35,093 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {112498#true} {112500#(= ~M_E~0 2)} #1077#return; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 20:00:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {112564#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~T4_E~0;~T4_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume true; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,131 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {112565#(= |old(~M_E~0)| 0)} {112500#(= ~M_E~0 2)} #1079#return; {112499#false} is VALID [2022-02-20 20:00:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 20:00:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {112566#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#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; {112498#true} is VALID [2022-02-20 20:00:35,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {112498#true} assume !(1 == ~m_pc~0); {112498#true} is VALID [2022-02-20 20:00:35,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {112498#true} is_master_triggered_~__retres1~4#1 := 0; {112498#true} is VALID [2022-02-20 20:00:35,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {112498#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {112498#true} is VALID [2022-02-20 20:00:35,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {112498#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {112498#true} is VALID [2022-02-20 20:00:35,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {112498#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {112498#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; {112498#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {112498#true} assume 1 == ~t1_pc~0; {112498#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {112498#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {112498#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {112498#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {112498#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {112498#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {112498#true} is VALID [2022-02-20 20:00:35,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {112498#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {112498#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {112498#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {112498#true} assume !(1 == ~t2_pc~0); {112498#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {112498#true} is_transmit2_triggered_~__retres1~6#1 := 0; {112498#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {112498#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {112498#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 16: Hoare triple {112498#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {112498#true} is VALID [2022-02-20 20:00:35,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {112498#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {112498#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {112498#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {112498#true} assume 1 == ~t3_pc~0; {112498#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {112498#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {112498#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {112498#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {112498#true} is VALID [2022-02-20 20:00:35,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {112498#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {112498#true} is VALID [2022-02-20 20:00:35,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {112498#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {112498#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {112498#true} is VALID [2022-02-20 20:00:35,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {112498#true} assume 1 == ~t4_pc~0; {112498#true} is VALID [2022-02-20 20:00:35,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {112498#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {112498#true} is VALID [2022-02-20 20:00:35,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {112498#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {112498#true} is VALID [2022-02-20 20:00:35,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {112498#true} #t~ret31#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___3~0#1 := #t~ret31#1;havoc #t~ret31#1; {112498#true} is VALID [2022-02-20 20:00:35,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {112498#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {112498#true} assume true; {112498#true} is VALID [2022-02-20 20:00:35,168 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {112498#true} {112499#false} #1081#return; {112499#false} is VALID [2022-02-20 20:00:35,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 20:00:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {112564#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {112498#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {112498#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {112498#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {112498#true} assume !(1 == ~T4_E~0); {112498#true} is VALID [2022-02-20 20:00:35,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {112498#true} assume 1 == ~E_M~0;~E_M~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {112498#true} assume 1 == ~E_1~0;~E_1~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {112498#true} assume 1 == ~E_2~0;~E_2~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {112498#true} assume 1 == ~E_3~0;~E_3~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {112498#true} assume 1 == ~E_4~0;~E_4~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {112498#true} assume true; {112498#true} is VALID [2022-02-20 20:00:35,175 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {112498#true} {112499#false} #1083#return; {112499#false} is VALID [2022-02-20 20:00:35,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 20:00:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:35,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {112498#true} havoc ~__retres1~9; {112498#true} is VALID [2022-02-20 20:00:35,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {112498#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {112498#true} is VALID [2022-02-20 20:00:35,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {112498#true} #res := ~__retres1~9; {112498#true} is VALID [2022-02-20 20:00:35,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {112498#true} assume true; {112498#true} is VALID [2022-02-20 20:00:35,181 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {112498#true} {112499#false} #1085#return; {112499#false} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {112498#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {112500#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {112500#(= ~M_E~0 2)} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~10#1;havoc main2_~__retres1~10#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {112500#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret33#1, start_simulation2_#t~ret34#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {112500#(= ~M_E~0 2)} call update_channels2(); {112498#true} is VALID [2022-02-20 20:00:35,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {112498#true} assume true; {112498#true} is VALID [2022-02-20 20:00:35,190 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {112498#true} {112500#(= ~M_E~0 2)} #1077#return; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {112500#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {112500#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {112500#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {112500#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {112500#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {112500#(= ~M_E~0 2)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {112500#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {112500#(= ~M_E~0 2)} is VALID [2022-02-20 20:00:35,194 INFO L272 TraceCheckUtils]: 14: Hoare triple {112500#(= ~M_E~0 2)} call fire_delta_events2(); {112564#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:35,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {112564#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~T4_E~0;~T4_E~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume !(0 == ~E_M~0); {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~E_2~0;~E_2~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume 0 == ~E_4~0;~E_4~0 := 1; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {112565#(= |old(~M_E~0)| 0)} assume true; {112565#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 20:00:35,198 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {112565#(= |old(~M_E~0)| 0)} {112500#(= ~M_E~0 2)} #1079#return; {112499#false} is VALID [2022-02-20 20:00:35,198 INFO L272 TraceCheckUtils]: 27: Hoare triple {112499#false} call activate_threads2(); {112566#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:35,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {112566#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#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; {112498#true} is VALID [2022-02-20 20:00:35,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {112498#true} assume !(1 == ~m_pc~0); {112498#true} is VALID [2022-02-20 20:00:35,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {112498#true} is_master_triggered_~__retres1~4#1 := 0; {112498#true} is VALID [2022-02-20 20:00:35,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {112498#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {112498#true} is VALID [2022-02-20 20:00:35,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {112498#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {112498#true} is VALID [2022-02-20 20:00:35,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {112498#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {112498#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; {112498#true} is VALID [2022-02-20 20:00:35,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {112498#true} assume 1 == ~t1_pc~0; {112498#true} is VALID [2022-02-20 20:00:35,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {112498#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {112498#true} is VALID [2022-02-20 20:00:35,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {112498#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {112498#true} is VALID [2022-02-20 20:00:35,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {112498#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {112498#true} is VALID [2022-02-20 20:00:35,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {112498#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {112498#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {112498#true} is VALID [2022-02-20 20:00:35,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {112498#true} assume !(1 == ~t2_pc~0); {112498#true} is VALID [2022-02-20 20:00:35,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {112498#true} is_transmit2_triggered_~__retres1~6#1 := 0; {112498#true} is VALID [2022-02-20 20:00:35,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {112498#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {112498#true} is VALID [2022-02-20 20:00:35,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {112498#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {112498#true} is VALID [2022-02-20 20:00:35,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {112498#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {112498#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {112498#true} is VALID [2022-02-20 20:00:35,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {112498#true} assume 1 == ~t3_pc~0; {112498#true} is VALID [2022-02-20 20:00:35,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {112498#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {112498#true} is VALID [2022-02-20 20:00:35,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {112498#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {112498#true} is VALID [2022-02-20 20:00:35,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {112498#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {112498#true} is VALID [2022-02-20 20:00:35,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {112498#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {112498#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {112498#true} is VALID [2022-02-20 20:00:35,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {112498#true} assume 1 == ~t4_pc~0; {112498#true} is VALID [2022-02-20 20:00:35,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {112498#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {112498#true} is VALID [2022-02-20 20:00:35,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {112498#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {112498#true} is VALID [2022-02-20 20:00:35,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {112498#true} #t~ret31#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___3~0#1 := #t~ret31#1;havoc #t~ret31#1; {112498#true} is VALID [2022-02-20 20:00:35,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {112498#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {112498#true} is VALID [2022-02-20 20:00:35,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {112498#true} assume true; {112498#true} is VALID [2022-02-20 20:00:35,217 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {112498#true} {112499#false} #1081#return; {112499#false} is VALID [2022-02-20 20:00:35,217 INFO L272 TraceCheckUtils]: 60: Hoare triple {112499#false} call reset_delta_events2(); {112564#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:35,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {112564#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {112498#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,218 INFO L290 TraceCheckUtils]: 63: Hoare triple {112498#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,218 INFO L290 TraceCheckUtils]: 64: Hoare triple {112498#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,218 INFO L290 TraceCheckUtils]: 65: Hoare triple {112498#true} assume !(1 == ~T4_E~0); {112498#true} is VALID [2022-02-20 20:00:35,218 INFO L290 TraceCheckUtils]: 66: Hoare triple {112498#true} assume 1 == ~E_M~0;~E_M~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {112498#true} assume 1 == ~E_1~0;~E_1~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,218 INFO L290 TraceCheckUtils]: 68: Hoare triple {112498#true} assume 1 == ~E_2~0;~E_2~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,218 INFO L290 TraceCheckUtils]: 69: Hoare triple {112498#true} assume 1 == ~E_3~0;~E_3~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,219 INFO L290 TraceCheckUtils]: 70: Hoare triple {112498#true} assume 1 == ~E_4~0;~E_4~0 := 2; {112498#true} is VALID [2022-02-20 20:00:35,219 INFO L290 TraceCheckUtils]: 71: Hoare triple {112498#true} assume true; {112498#true} is VALID [2022-02-20 20:00:35,219 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {112498#true} {112499#false} #1083#return; {112499#false} is VALID [2022-02-20 20:00:35,219 INFO L290 TraceCheckUtils]: 73: Hoare triple {112499#false} assume !false; {112499#false} is VALID [2022-02-20 20:00:35,219 INFO L290 TraceCheckUtils]: 74: Hoare triple {112499#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_5~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {112499#false} is VALID [2022-02-20 20:00:35,219 INFO L290 TraceCheckUtils]: 75: Hoare triple {112499#false} assume !false; {112499#false} is VALID [2022-02-20 20:00:35,219 INFO L272 TraceCheckUtils]: 76: Hoare triple {112499#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {112498#true} is VALID [2022-02-20 20:00:35,219 INFO L290 TraceCheckUtils]: 77: Hoare triple {112498#true} havoc ~__retres1~9; {112498#true} is VALID [2022-02-20 20:00:35,220 INFO L290 TraceCheckUtils]: 78: Hoare triple {112498#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {112498#true} is VALID [2022-02-20 20:00:35,220 INFO L290 TraceCheckUtils]: 79: Hoare triple {112498#true} #res := ~__retres1~9; {112498#true} is VALID [2022-02-20 20:00:35,220 INFO L290 TraceCheckUtils]: 80: Hoare triple {112498#true} assume true; {112498#true} is VALID [2022-02-20 20:00:35,220 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {112498#true} {112499#false} #1085#return; {112499#false} is VALID [2022-02-20 20:00:35,220 INFO L290 TraceCheckUtils]: 82: Hoare triple {112499#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {112499#false} is VALID [2022-02-20 20:00:35,220 INFO L290 TraceCheckUtils]: 83: Hoare triple {112499#false} assume 0 != eval2_~tmp~5#1; {112499#false} is VALID [2022-02-20 20:00:35,220 INFO L290 TraceCheckUtils]: 84: Hoare triple {112499#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {112499#false} is VALID [2022-02-20 20:00:35,221 INFO L290 TraceCheckUtils]: 85: Hoare triple {112499#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {112499#false} is VALID [2022-02-20 20:00:35,221 INFO L290 TraceCheckUtils]: 86: Hoare triple {112499#false} assume !(0 == ~m_pc~0); {112499#false} is VALID [2022-02-20 20:00:35,221 INFO L290 TraceCheckUtils]: 87: Hoare triple {112499#false} assume 1 == ~m_pc~0; {112499#false} is VALID [2022-02-20 20:00:35,221 INFO L290 TraceCheckUtils]: 88: Hoare triple {112499#false} assume ~token~0 != 4 + ~local~0;assume { :begin_inline_error2 } true; {112499#false} is VALID [2022-02-20 20:00:35,221 INFO L290 TraceCheckUtils]: 89: Hoare triple {112499#false} assume !false; {112499#false} is VALID [2022-02-20 20:00:35,222 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 20:00:35,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:35,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509829919] [2022-02-20 20:00:35,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509829919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:35,222 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:35,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:00:35,222 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590850814] [2022-02-20 20:00:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:35,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 90 [2022-02-20 20:00:35,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:35,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 20:00:35,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:35,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:00:35,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:35,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:00:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:00:35,296 INFO L87 Difference]: Start difference. First operand 2277 states and 2856 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 20:00:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:38,308 INFO L93 Difference]: Finished difference Result 2717 states and 3543 transitions. [2022-02-20 20:00:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:00:38,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 90 [2022-02-20 20:00:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 20:00:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1098 transitions. [2022-02-20 20:00:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 20:00:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1098 transitions. [2022-02-20 20:00:38,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1098 transitions. [2022-02-20 20:00:38,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1098 edges. 1098 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:39,223 INFO L225 Difference]: With dead ends: 2717 [2022-02-20 20:00:39,224 INFO L226 Difference]: Without dead ends: 2552 [2022-02-20 20:00:39,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:00:39,225 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 871 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:39,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [894 Valid, 1059 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2022-02-20 20:00:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2445. [2022-02-20 20:00:39,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:39,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2552 states. Second operand has 2445 states, 1934 states have (on average 1.2740434332988624) internal successors, (2464), 1963 states have internal predecessors, (2464), 272 states have call successors, (272), 174 states have call predecessors, (272), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) [2022-02-20 20:00:39,479 INFO L74 IsIncluded]: Start isIncluded. First operand 2552 states. Second operand has 2445 states, 1934 states have (on average 1.2740434332988624) internal successors, (2464), 1963 states have internal predecessors, (2464), 272 states have call successors, (272), 174 states have call predecessors, (272), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) [2022-02-20 20:00:39,487 INFO L87 Difference]: Start difference. First operand 2552 states. Second operand has 2445 states, 1934 states have (on average 1.2740434332988624) internal successors, (2464), 1963 states have internal predecessors, (2464), 272 states have call successors, (272), 174 states have call predecessors, (272), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) [2022-02-20 20:00:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:39,688 INFO L93 Difference]: Finished difference Result 2552 states and 3289 transitions. [2022-02-20 20:00:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3289 transitions. [2022-02-20 20:00:39,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:39,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:39,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 2445 states, 1934 states have (on average 1.2740434332988624) internal successors, (2464), 1963 states have internal predecessors, (2464), 272 states have call successors, (272), 174 states have call predecessors, (272), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) Second operand 2552 states. [2022-02-20 20:00:39,695 INFO L87 Difference]: Start difference. First operand has 2445 states, 1934 states have (on average 1.2740434332988624) internal successors, (2464), 1963 states have internal predecessors, (2464), 272 states have call successors, (272), 174 states have call predecessors, (272), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) Second operand 2552 states. [2022-02-20 20:00:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:39,915 INFO L93 Difference]: Finished difference Result 2552 states and 3289 transitions. [2022-02-20 20:00:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3289 transitions. [2022-02-20 20:00:39,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:39,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:39,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:39,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 1934 states have (on average 1.2740434332988624) internal successors, (2464), 1963 states have internal predecessors, (2464), 272 states have call successors, (272), 174 states have call predecessors, (272), 237 states have return successors, (377), 309 states have call predecessors, (377), 270 states have call successors, (377) [2022-02-20 20:00:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3113 transitions. [2022-02-20 20:00:40,257 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3113 transitions. Word has length 90 [2022-02-20 20:00:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:40,257 INFO L470 AbstractCegarLoop]: Abstraction has 2445 states and 3113 transitions. [2022-02-20 20:00:40,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 20:00:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3113 transitions. [2022-02-20 20:00:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-02-20 20:00:40,258 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:40,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:00:40,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 20:00:40,259 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash -816289682, now seen corresponding path program 1 times [2022-02-20 20:00:40,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:40,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948234226] [2022-02-20 20:00:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {124571#true} assume true; {124571#true} is VALID [2022-02-20 20:00:40,287 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {124571#true} {124573#(= ~T1_E~0 ~M_E~0)} #1077#return; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 20:00:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {124637#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {124638#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:40,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {124638#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T4_E~0;~T4_E~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,318 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {124573#(= ~T1_E~0 ~M_E~0)} #1079#return; {124572#false} is VALID [2022-02-20 20:00:40,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 20:00:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {124640#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#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; {124571#true} is VALID [2022-02-20 20:00:40,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {124571#true} assume !(1 == ~m_pc~0); {124571#true} is VALID [2022-02-20 20:00:40,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {124571#true} is_master_triggered_~__retres1~4#1 := 0; {124571#true} is VALID [2022-02-20 20:00:40,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {124571#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {124571#true} is VALID [2022-02-20 20:00:40,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {124571#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {124571#true} is VALID [2022-02-20 20:00:40,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {124571#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {124571#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; {124571#true} is VALID [2022-02-20 20:00:40,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {124571#true} assume 1 == ~t1_pc~0; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {124571#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {124571#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {124571#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {124571#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {124571#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {124571#true} assume !(1 == ~t2_pc~0); {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {124571#true} is_transmit2_triggered_~__retres1~6#1 := 0; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {124571#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {124571#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {124571#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {124571#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {124571#true} assume 1 == ~t3_pc~0; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {124571#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {124571#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {124571#true} is VALID [2022-02-20 20:00:40,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {124571#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {124571#true} is VALID [2022-02-20 20:00:40,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {124571#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {124571#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {124571#true} is VALID [2022-02-20 20:00:40,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {124571#true} assume 1 == ~t4_pc~0; {124571#true} is VALID [2022-02-20 20:00:40,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {124571#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {124571#true} is VALID [2022-02-20 20:00:40,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {124571#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {124571#true} is VALID [2022-02-20 20:00:40,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {124571#true} #t~ret31#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___3~0#1 := #t~ret31#1;havoc #t~ret31#1; {124571#true} is VALID [2022-02-20 20:00:40,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {124571#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {124571#true} assume true; {124571#true} is VALID [2022-02-20 20:00:40,336 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {124571#true} {124572#false} #1081#return; {124572#false} is VALID [2022-02-20 20:00:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 20:00:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {124637#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {124571#true} is VALID [2022-02-20 20:00:40,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {124571#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {124571#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {124571#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {124571#true} assume !(1 == ~T4_E~0); {124571#true} is VALID [2022-02-20 20:00:40,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {124571#true} assume 1 == ~E_M~0;~E_M~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {124571#true} assume 1 == ~E_1~0;~E_1~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {124571#true} assume 1 == ~E_2~0;~E_2~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {124571#true} assume 1 == ~E_3~0;~E_3~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {124571#true} assume 1 == ~E_4~0;~E_4~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {124571#true} assume true; {124571#true} is VALID [2022-02-20 20:00:40,342 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {124571#true} {124572#false} #1083#return; {124572#false} is VALID [2022-02-20 20:00:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 20:00:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:40,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {124571#true} havoc ~__retres1~9; {124571#true} is VALID [2022-02-20 20:00:40,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {124571#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {124571#true} is VALID [2022-02-20 20:00:40,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {124571#true} #res := ~__retres1~9; {124571#true} is VALID [2022-02-20 20:00:40,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {124571#true} assume true; {124571#true} is VALID [2022-02-20 20:00:40,344 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {124571#true} {124572#false} #1085#return; {124572#false} is VALID [2022-02-20 20:00:40,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {124571#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(17, 2);call #Ultimate.allocInit(12, 3);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet35#1, main_#t~ret36#1, main_#t~ret37#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~10#1;havoc main2_~__retres1~10#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret33#1, start_simulation2_#t~ret34#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~5#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~5#1;start_simulation2_~kernel_st~1#1 := 0; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {124571#true} is VALID [2022-02-20 20:00:40,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {124571#true} assume true; {124571#true} is VALID [2022-02-20 20:00:40,346 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {124571#true} {124573#(= ~T1_E~0 ~M_E~0)} #1077#return; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t4_i~0;~t4_st~0 := 0; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {124573#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 20:00:40,349 INFO L272 TraceCheckUtils]: 14: Hoare triple {124573#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {124637#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:40,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {124637#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(0 == ~M_E~0); {124638#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 20:00:40,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {124638#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T2_E~0;~T2_E~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T3_E~0;~T3_E~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~T4_E~0;~T4_E~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_M~0); {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_1~0;~E_1~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_2~0;~E_2~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_3~0;~E_3~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_4~0;~E_4~0 := 1; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 20:00:40,353 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {124639#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {124573#(= ~T1_E~0 ~M_E~0)} #1079#return; {124572#false} is VALID [2022-02-20 20:00:40,353 INFO L272 TraceCheckUtils]: 27: Hoare triple {124572#false} call activate_threads2(); {124640#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {124640#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0) (= |old(~t4_st~0)| ~t4_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~4#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;havoc ~tmp___3~0#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; {124571#true} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {124571#true} assume !(1 == ~m_pc~0); {124571#true} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {124571#true} is_master_triggered_~__retres1~4#1 := 0; {124571#true} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {124571#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {124571#true} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {124571#true} #t~ret27#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp~6#1 := #t~ret27#1;havoc #t~ret27#1; {124571#true} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {124571#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {124571#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; {124571#true} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {124571#true} assume 1 == ~t1_pc~0; {124571#true} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {124571#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {124571#true} is VALID [2022-02-20 20:00:40,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {124571#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {124571#true} #t~ret28#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___0~4#1 := #t~ret28#1;havoc #t~ret28#1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {124571#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {124571#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {124571#true} assume !(1 == ~t2_pc~0); {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {124571#true} is_transmit2_triggered_~__retres1~6#1 := 0; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {124571#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {124571#true} #t~ret29#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret29#1 && #t~ret29#1 <= 2147483647;~tmp___1~1#1 := #t~ret29#1;havoc #t~ret29#1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {124571#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {124571#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {124571#true} assume 1 == ~t3_pc~0; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {124571#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {124571#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 50: Hoare triple {124571#true} #t~ret30#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret30#1 && #t~ret30#1 <= 2147483647;~tmp___2~0#1 := #t~ret30#1;havoc #t~ret30#1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 51: Hoare triple {124571#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {124571#true} assume { :begin_inline_is_transmit4_triggered } true;havoc is_transmit4_triggered_#res#1;havoc is_transmit4_triggered_~__retres1~8#1;havoc is_transmit4_triggered_~__retres1~8#1; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {124571#true} assume 1 == ~t4_pc~0; {124571#true} is VALID [2022-02-20 20:00:40,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {124571#true} assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~8#1 := 1; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 55: Hoare triple {124571#true} is_transmit4_triggered_#res#1 := is_transmit4_triggered_~__retres1~8#1; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {124571#true} #t~ret31#1 := is_transmit4_triggered_#res#1;assume { :end_inline_is_transmit4_triggered } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647;~tmp___3~0#1 := #t~ret31#1;havoc #t~ret31#1; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {124571#true} assume 0 != ~tmp___3~0#1;~t4_st~0 := 0; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {124571#true} assume true; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {124571#true} {124572#false} #1081#return; {124572#false} is VALID [2022-02-20 20:00:40,355 INFO L272 TraceCheckUtils]: 60: Hoare triple {124572#false} call reset_delta_events2(); {124637#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {124637#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~T4_E~0)| ~T4_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_4~0 |old(~E_4~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume !(1 == ~M_E~0); {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {124571#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {124571#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {124571#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {124571#true} assume !(1 == ~T4_E~0); {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 66: Hoare triple {124571#true} assume 1 == ~E_M~0;~E_M~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 67: Hoare triple {124571#true} assume 1 == ~E_1~0;~E_1~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {124571#true} assume 1 == ~E_2~0;~E_2~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 69: Hoare triple {124571#true} assume 1 == ~E_3~0;~E_3~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 70: Hoare triple {124571#true} assume 1 == ~E_4~0;~E_4~0 := 2; {124571#true} is VALID [2022-02-20 20:00:40,355 INFO L290 TraceCheckUtils]: 71: Hoare triple {124571#true} assume true; {124571#true} is VALID [2022-02-20 20:00:40,356 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {124571#true} {124572#false} #1083#return; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 73: Hoare triple {124572#false} assume !false; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 74: Hoare triple {124572#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret21#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet25#1, eval2_~tmp_ndt_4~0#1, eval2_#t~nondet26#1, eval2_~tmp_ndt_5~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {124572#false} assume !false; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L272 TraceCheckUtils]: 76: Hoare triple {124572#false} call eval2_#t~ret21#1 := exists_runnable_thread2(); {124571#true} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {124571#true} havoc ~__retres1~9; {124571#true} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 78: Hoare triple {124571#true} assume 0 == ~m_st~0;~__retres1~9 := 1; {124571#true} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 79: Hoare triple {124571#true} #res := ~__retres1~9; {124571#true} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 80: Hoare triple {124571#true} assume true; {124571#true} is VALID [2022-02-20 20:00:40,356 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {124571#true} {124572#false} #1085#return; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 82: Hoare triple {124572#false} assume -2147483648 <= eval2_#t~ret21#1 && eval2_#t~ret21#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret21#1;havoc eval2_#t~ret21#1; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 83: Hoare triple {124572#false} assume 0 != eval2_~tmp~5#1; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 84: Hoare triple {124572#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet22#1 && eval2_#t~nondet22#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet22#1;havoc eval2_#t~nondet22#1; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 85: Hoare triple {124572#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 86: Hoare triple {124572#false} assume !(0 == ~m_pc~0); {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 87: Hoare triple {124572#false} assume 1 == ~m_pc~0; {124572#false} is VALID [2022-02-20 20:00:40,356 INFO L290 TraceCheckUtils]: 88: Hoare triple {124572#false} assume ~token~0 != 4 + ~local~0;assume { :begin_inline_error2 } true; {124572#false} is VALID [2022-02-20 20:00:40,357 INFO L290 TraceCheckUtils]: 89: Hoare triple {124572#false} assume !false; {124572#false} is VALID [2022-02-20 20:00:40,357 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 20:00:40,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:40,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948234226] [2022-02-20 20:00:40,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948234226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:40,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:40,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:00:40,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633934407] [2022-02-20 20:00:40,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:40,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2022-02-20 20:00:40,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:40,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 20:00:40,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:40,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:00:40,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:40,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:00:40,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:00:40,425 INFO L87 Difference]: Start difference. First operand 2445 states and 3113 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 20:00:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:44,949 INFO L93 Difference]: Finished difference Result 3110 states and 4145 transitions. [2022-02-20 20:00:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:44,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 90 [2022-02-20 20:00:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 20:00:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1106 transitions. [2022-02-20 20:00:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 20:00:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1106 transitions. [2022-02-20 20:00:44,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1106 transitions.