./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.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.01.cil-2.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 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:16,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:16,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:16,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:16,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:16,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:16,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:16,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:16,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:16,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:16,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:16,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:16,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:16,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:16,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:16,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:16,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:16,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:16,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:16,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:16,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:16,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:16,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:16,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:16,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:16,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:16,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:16,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:16,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:16,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:16,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:16,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:16,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:16,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:16,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:16,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:16,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:16,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:16,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:16,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:16,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:16,802 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:16,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:16,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:16,843 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:16,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:16,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:16,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:16,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:16,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:16,845 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:16,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:16,846 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:16,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:16,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:16,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:16,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:16,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:16,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:16,847 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:16,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:16,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:16,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:16,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:16,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:16,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:16,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:16,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:16,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:16,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:16,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:16,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:16,856 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:16,856 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:16,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:16,856 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 -> 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c [2022-02-20 19:59:17,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:17,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:17,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:17,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:17,101 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:17,102 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.01.cil-2.c [2022-02-20 19:59:17,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7246fcd/ac8c82cf1d1c4df791a049044ab26393/FLAGa4a5b1594 [2022-02-20 19:59:17,538 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:17,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-02-20 19:59:17,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7246fcd/ac8c82cf1d1c4df791a049044ab26393/FLAGa4a5b1594 [2022-02-20 19:59:17,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7246fcd/ac8c82cf1d1c4df791a049044ab26393 [2022-02-20 19:59:17,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:17,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:17,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:17,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:17,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:17,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338478d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:17, skipping insertion in model container [2022-02-20 19:59:17,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:17" (1/1) ... [2022-02-20 19:59:17,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:18,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:18,155 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.01.cil-2.c[911,924] [2022-02-20 19:59:18,250 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.01.cil-2.c[8416,8429] [2022-02-20 19:59:18,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:18,309 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:18,334 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.01.cil-2.c[911,924] [2022-02-20 19:59:18,361 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.01.cil-2.c[8416,8429] [2022-02-20 19:59:18,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:18,405 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:18,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:18 WrapperNode [2022-02-20 19:59:18,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:18,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:18,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:18,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:18,414 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:18" (1/1) ... [2022-02-20 19:59:18,438 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:18" (1/1) ... [2022-02-20 19:59:18,490 INFO L137 Inliner]: procedures = 57, calls = 65, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 445 [2022-02-20 19:59:18,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:18,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:18,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:18,494 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:18,500 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:18" (1/1) ... [2022-02-20 19:59:18,501 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:18" (1/1) ... [2022-02-20 19:59:18,504 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:18" (1/1) ... [2022-02-20 19:59:18,504 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:18" (1/1) ... [2022-02-20 19:59:18,512 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:18" (1/1) ... [2022-02-20 19:59:18,519 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:18" (1/1) ... [2022-02-20 19:59:18,521 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:18" (1/1) ... [2022-02-20 19:59:18,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:18,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:18,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:18,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:18,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:18" (1/1) ... [2022-02-20 19:59:18,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:18,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:18,575 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:18,577 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:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:18,606 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:18,606 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:18,607 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:18,607 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:18,607 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:18,607 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:18,607 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:18,608 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:18,608 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:18,608 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:18,608 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:18,608 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:18,608 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:18,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:18,609 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:18,609 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:18,609 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:18,609 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:18,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:18,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:18,609 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:18,609 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:18,609 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:59:18,610 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:59:18,681 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:18,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:19,211 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 19:59:19,211 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:19,276 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:19,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:19,293 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 19:59:19,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:19 BoogieIcfgContainer [2022-02-20 19:59:19,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:19,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:19,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:19,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:19,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:17" (1/3) ... [2022-02-20 19:59:19,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ac01e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:19, skipping insertion in model container [2022-02-20 19:59:19,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:18" (2/3) ... [2022-02-20 19:59:19,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ac01e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:19, skipping insertion in model container [2022-02-20 19:59:19,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:19" (3/3) ... [2022-02-20 19:59:19,307 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-02-20 19:59:19,312 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:19,313 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:19,358 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:19,363 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:19,364 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:19,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:59:19,397 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:19,398 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] [2022-02-20 19:59:19,398 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash 560703049, now seen corresponding path program 1 times [2022-02-20 19:59:19,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:19,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800468148] [2022-02-20 19:59:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#true} assume true; {235#true} is VALID [2022-02-20 19:59:19,689 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {235#true} {237#(= ~M_E~0 2)} #770#return; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {271#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {272#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {272#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {272#(= |old(~M_E~0)| 0)} assume true; {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,758 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {272#(= |old(~M_E~0)| 0)} {237#(= ~M_E~0 2)} #772#return; {236#false} is VALID [2022-02-20 19:59:19,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {273#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {235#true} is VALID [2022-02-20 19:59:19,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#true} assume !(1 == ~m_pc~0); {235#true} is VALID [2022-02-20 19:59:19,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#true} is_master_triggered_~__retres1~4#1 := 0; {235#true} is VALID [2022-02-20 19:59:19,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {235#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {235#true} is VALID [2022-02-20 19:59:19,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {235#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {235#true} is VALID [2022-02-20 19:59:19,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {235#true} is VALID [2022-02-20 19:59:19,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {235#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; {235#true} is VALID [2022-02-20 19:59:19,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#true} assume 1 == ~t1_pc~0; {235#true} is VALID [2022-02-20 19:59:19,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {235#true} is VALID [2022-02-20 19:59:19,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {235#true} is VALID [2022-02-20 19:59:19,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {235#true} is VALID [2022-02-20 19:59:19,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {235#true} is VALID [2022-02-20 19:59:19,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#true} assume true; {235#true} is VALID [2022-02-20 19:59:19,807 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {235#true} {236#false} #774#return; {236#false} is VALID [2022-02-20 19:59:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {271#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {235#true} is VALID [2022-02-20 19:59:19,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {235#true} is VALID [2022-02-20 19:59:19,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#true} assume 1 == ~E_M~0;~E_M~0 := 2; {235#true} is VALID [2022-02-20 19:59:19,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {235#true} assume 1 == ~E_1~0;~E_1~0 := 2; {235#true} is VALID [2022-02-20 19:59:19,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {235#true} assume true; {235#true} is VALID [2022-02-20 19:59:19,823 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {235#true} {236#false} #776#return; {236#false} is VALID [2022-02-20 19:59:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#true} havoc ~__retres1~6; {235#true} is VALID [2022-02-20 19:59:19,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {235#true} is VALID [2022-02-20 19:59:19,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#true} #res := ~__retres1~6; {235#true} is VALID [2022-02-20 19:59:19,838 INFO L290 TraceCheckUtils]: 3: Hoare triple {235#true} assume true; {235#true} is VALID [2022-02-20 19:59:19,838 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {235#true} {236#false} #778#return; {236#false} is VALID [2022-02-20 19:59:19,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#(= ~M_E~0 2)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#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; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {237#(= ~M_E~0 2)} call update_channels2(); {235#true} is VALID [2022-02-20 19:59:19,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#true} assume true; {235#true} is VALID [2022-02-20 19:59:19,850 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {235#true} {237#(= ~M_E~0 2)} #770#return; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {237#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {237#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {237#(= ~M_E~0 2)} is VALID [2022-02-20 19:59:19,855 INFO L272 TraceCheckUtils]: 11: Hoare triple {237#(= ~M_E~0 2)} call fire_delta_events2(); {271#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:19,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {271#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 0 == ~M_E~0;~M_E~0 := 1; {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {272#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {272#(= |old(~M_E~0)| 0)} assume !(0 == ~E_1~0); {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {272#(= |old(~M_E~0)| 0)} assume true; {272#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:59:19,866 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {272#(= |old(~M_E~0)| 0)} {237#(= ~M_E~0 2)} #772#return; {236#false} is VALID [2022-02-20 19:59:19,866 INFO L272 TraceCheckUtils]: 18: Hoare triple {236#false} call activate_threads2(); {273#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:19,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {273#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {235#true} is VALID [2022-02-20 19:59:19,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {235#true} assume !(1 == ~m_pc~0); {235#true} is VALID [2022-02-20 19:59:19,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {235#true} is_master_triggered_~__retres1~4#1 := 0; {235#true} is VALID [2022-02-20 19:59:19,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {235#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {235#true} is VALID [2022-02-20 19:59:19,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {235#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {235#true} is VALID [2022-02-20 19:59:19,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {235#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {235#true} is VALID [2022-02-20 19:59:19,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {235#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; {235#true} is VALID [2022-02-20 19:59:19,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {235#true} assume 1 == ~t1_pc~0; {235#true} is VALID [2022-02-20 19:59:19,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {235#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {235#true} is VALID [2022-02-20 19:59:19,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {235#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {235#true} is VALID [2022-02-20 19:59:19,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {235#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {235#true} is VALID [2022-02-20 19:59:19,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {235#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {235#true} is VALID [2022-02-20 19:59:19,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {235#true} assume true; {235#true} is VALID [2022-02-20 19:59:19,872 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {235#true} {236#false} #774#return; {236#false} is VALID [2022-02-20 19:59:19,872 INFO L272 TraceCheckUtils]: 33: Hoare triple {236#false} call reset_delta_events2(); {271#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:19,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {271#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume 1 == ~M_E~0;~M_E~0 := 2; {235#true} is VALID [2022-02-20 19:59:19,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {235#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {235#true} is VALID [2022-02-20 19:59:19,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {235#true} assume 1 == ~E_M~0;~E_M~0 := 2; {235#true} is VALID [2022-02-20 19:59:19,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {235#true} assume 1 == ~E_1~0;~E_1~0 := 2; {235#true} is VALID [2022-02-20 19:59:19,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {235#true} assume true; {235#true} is VALID [2022-02-20 19:59:19,874 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {235#true} {236#false} #776#return; {236#false} is VALID [2022-02-20 19:59:19,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {236#false} assume !false; {236#false} is VALID [2022-02-20 19:59:19,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {236#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {236#false} is VALID [2022-02-20 19:59:19,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {236#false} assume !false; {236#false} is VALID [2022-02-20 19:59:19,875 INFO L272 TraceCheckUtils]: 43: Hoare triple {236#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {235#true} is VALID [2022-02-20 19:59:19,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {235#true} havoc ~__retres1~6; {235#true} is VALID [2022-02-20 19:59:19,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {235#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {235#true} is VALID [2022-02-20 19:59:19,875 INFO L290 TraceCheckUtils]: 46: Hoare triple {235#true} #res := ~__retres1~6; {235#true} is VALID [2022-02-20 19:59:19,875 INFO L290 TraceCheckUtils]: 47: Hoare triple {235#true} assume true; {235#true} is VALID [2022-02-20 19:59:19,876 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {235#true} {236#false} #778#return; {236#false} is VALID [2022-02-20 19:59:19,876 INFO L290 TraceCheckUtils]: 49: Hoare triple {236#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {236#false} is VALID [2022-02-20 19:59:19,876 INFO L290 TraceCheckUtils]: 50: Hoare triple {236#false} assume 0 != eval2_~tmp~5#1; {236#false} is VALID [2022-02-20 19:59:19,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {236#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {236#false} is VALID [2022-02-20 19:59:19,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {236#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {236#false} is VALID [2022-02-20 19:59:19,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {236#false} assume !(0 == ~m_pc~0); {236#false} is VALID [2022-02-20 19:59:19,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {236#false} assume 1 == ~m_pc~0; {236#false} is VALID [2022-02-20 19:59:19,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {236#false} assume ~token~0 != 1 + ~local~0; {236#false} is VALID [2022-02-20 19:59:19,878 INFO L272 TraceCheckUtils]: 56: Hoare triple {236#false} call error2(); {236#false} is VALID [2022-02-20 19:59:19,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {236#false} assume !false; {236#false} is VALID [2022-02-20 19:59:19,879 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:19,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:19,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800468148] [2022-02-20 19:59:19,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800468148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:19,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:19,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:19,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110298638] [2022-02-20 19:59:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:19,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:19,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:19,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:19,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:19,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:19,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:19,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:19,984 INFO L87 Difference]: Start difference. First operand has 232 states, 181 states have (on average 1.5469613259668509) internal successors, (280), 189 states have internal predecessors, (280), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,010 INFO L93 Difference]: Finished difference Result 584 states and 884 transitions. [2022-02-20 19:59:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:59:22,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 884 transitions. [2022-02-20 19:59:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 884 transitions. [2022-02-20 19:59:22,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 884 transitions. [2022-02-20 19:59:22,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 884 edges. 884 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:22,833 INFO L225 Difference]: With dead ends: 584 [2022-02-20 19:59:22,833 INFO L226 Difference]: Without dead ends: 359 [2022-02-20 19:59:22,838 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 19:59:22,840 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 572 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:22,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 862 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-02-20 19:59:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 316. [2022-02-20 19:59:22,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:22,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-02-20 19:59:22,896 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-02-20 19:59:22,897 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-02-20 19:59:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,919 INFO L93 Difference]: Finished difference Result 359 states and 516 transitions. [2022-02-20 19:59:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 516 transitions. [2022-02-20 19:59:22,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) Second operand 359 states. [2022-02-20 19:59:22,926 INFO L87 Difference]: Start difference. First operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) Second operand 359 states. [2022-02-20 19:59:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,946 INFO L93 Difference]: Finished difference Result 359 states and 516 transitions. [2022-02-20 19:59:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 516 transitions. [2022-02-20 19:59:22,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:22,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:22,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:22,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 251 states have (on average 1.4621513944223108) internal successors, (367), 257 states have internal predecessors, (367), 43 states have call successors, (43), 21 states have call predecessors, (43), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2022-02-20 19:59:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 452 transitions. [2022-02-20 19:59:22,977 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 452 transitions. Word has length 58 [2022-02-20 19:59:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:22,977 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 452 transitions. [2022-02-20 19:59:22,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2022-02-20 19:59:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:59:22,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:22,980 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] [2022-02-20 19:59:22,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:22,980 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:22,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1940005051, now seen corresponding path program 1 times [2022-02-20 19:59:22,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:22,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816984807] [2022-02-20 19:59:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:22,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {2240#true} assume true; {2240#true} is VALID [2022-02-20 19:59:23,038 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2240#true} {2242#(= ~T1_E~0 ~M_E~0)} #770#return; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {2276#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {2277#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:23,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {2277#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:23,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:23,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:23,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:23,082 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {2242#(= ~T1_E~0 ~M_E~0)} #772#return; {2241#false} is VALID [2022-02-20 19:59:23,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {2279#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {2240#true} is VALID [2022-02-20 19:59:23,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {2240#true} assume !(1 == ~m_pc~0); {2240#true} is VALID [2022-02-20 19:59:23,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {2240#true} is_master_triggered_~__retres1~4#1 := 0; {2240#true} is VALID [2022-02-20 19:59:23,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {2240#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {2240#true} is VALID [2022-02-20 19:59:23,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {2240#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {2240#true} is VALID [2022-02-20 19:59:23,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {2240#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {2240#true} is VALID [2022-02-20 19:59:23,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {2240#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; {2240#true} is VALID [2022-02-20 19:59:23,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {2240#true} assume 1 == ~t1_pc~0; {2240#true} is VALID [2022-02-20 19:59:23,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {2240#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {2240#true} is VALID [2022-02-20 19:59:23,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {2240#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {2240#true} is VALID [2022-02-20 19:59:23,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {2240#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {2240#true} is VALID [2022-02-20 19:59:23,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {2240#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {2240#true} is VALID [2022-02-20 19:59:23,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {2240#true} assume true; {2240#true} is VALID [2022-02-20 19:59:23,102 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2240#true} {2241#false} #774#return; {2241#false} is VALID [2022-02-20 19:59:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {2276#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {2240#true} is VALID [2022-02-20 19:59:23,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {2240#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2240#true} is VALID [2022-02-20 19:59:23,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {2240#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2240#true} is VALID [2022-02-20 19:59:23,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {2240#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2240#true} is VALID [2022-02-20 19:59:23,110 INFO L290 TraceCheckUtils]: 4: Hoare triple {2240#true} assume true; {2240#true} is VALID [2022-02-20 19:59:23,110 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2240#true} {2241#false} #776#return; {2241#false} is VALID [2022-02-20 19:59:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {2240#true} havoc ~__retres1~6; {2240#true} is VALID [2022-02-20 19:59:23,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {2240#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {2240#true} is VALID [2022-02-20 19:59:23,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {2240#true} #res := ~__retres1~6; {2240#true} is VALID [2022-02-20 19:59:23,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {2240#true} assume true; {2240#true} is VALID [2022-02-20 19:59:23,116 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2240#true} {2241#false} #778#return; {2241#false} is VALID [2022-02-20 19:59:23,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {2240#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {2242#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {2242#(= ~T1_E~0 ~M_E~0)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {2242#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#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; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {2242#(= ~T1_E~0 ~M_E~0)} call update_channels2(); {2240#true} is VALID [2022-02-20 19:59:23,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {2240#true} assume true; {2240#true} is VALID [2022-02-20 19:59:23,119 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2240#true} {2242#(= ~T1_E~0 ~M_E~0)} #770#return; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {2242#(= ~T1_E~0 ~M_E~0)} assume { :begin_inline_init_threads2 } true; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {2242#(= ~T1_E~0 ~M_E~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {2242#(= ~T1_E~0 ~M_E~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {2242#(= ~T1_E~0 ~M_E~0)} assume { :end_inline_init_threads2 } true; {2242#(= ~T1_E~0 ~M_E~0)} is VALID [2022-02-20 19:59:23,122 INFO L272 TraceCheckUtils]: 11: Hoare triple {2242#(= ~T1_E~0 ~M_E~0)} call fire_delta_events2(); {2276#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:23,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {2276#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {2277#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} is VALID [2022-02-20 19:59:23,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {2277#(and (= |old(~T1_E~0)| ~T1_E~0) (not (= |old(~M_E~0)| 0)))} assume 0 == ~T1_E~0;~T1_E~0 := 1; {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:23,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume 0 == ~E_M~0;~E_M~0 := 1; {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:23,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume !(0 == ~E_1~0); {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:23,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} assume true; {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} is VALID [2022-02-20 19:59:23,124 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2278#(not (= |old(~T1_E~0)| |old(~M_E~0)|))} {2242#(= ~T1_E~0 ~M_E~0)} #772#return; {2241#false} is VALID [2022-02-20 19:59:23,125 INFO L272 TraceCheckUtils]: 18: Hoare triple {2241#false} call activate_threads2(); {2279#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:23,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {2279#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {2240#true} is VALID [2022-02-20 19:59:23,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {2240#true} assume !(1 == ~m_pc~0); {2240#true} is VALID [2022-02-20 19:59:23,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {2240#true} is_master_triggered_~__retres1~4#1 := 0; {2240#true} is VALID [2022-02-20 19:59:23,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {2240#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {2240#true} is VALID [2022-02-20 19:59:23,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {2240#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {2240#true} is VALID [2022-02-20 19:59:23,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {2240#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {2240#true} is VALID [2022-02-20 19:59:23,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {2240#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; {2240#true} is VALID [2022-02-20 19:59:23,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {2240#true} assume 1 == ~t1_pc~0; {2240#true} is VALID [2022-02-20 19:59:23,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {2240#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {2240#true} is VALID [2022-02-20 19:59:23,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {2240#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {2240#true} is VALID [2022-02-20 19:59:23,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {2240#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {2240#true} is VALID [2022-02-20 19:59:23,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {2240#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {2240#true} is VALID [2022-02-20 19:59:23,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {2240#true} assume true; {2240#true} is VALID [2022-02-20 19:59:23,128 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2240#true} {2241#false} #774#return; {2241#false} is VALID [2022-02-20 19:59:23,128 INFO L272 TraceCheckUtils]: 33: Hoare triple {2241#false} call reset_delta_events2(); {2276#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:23,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {2276#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {2240#true} is VALID [2022-02-20 19:59:23,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {2240#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {2240#true} is VALID [2022-02-20 19:59:23,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {2240#true} assume 1 == ~E_M~0;~E_M~0 := 2; {2240#true} is VALID [2022-02-20 19:59:23,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {2240#true} assume 1 == ~E_1~0;~E_1~0 := 2; {2240#true} is VALID [2022-02-20 19:59:23,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {2240#true} assume true; {2240#true} is VALID [2022-02-20 19:59:23,129 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2240#true} {2241#false} #776#return; {2241#false} is VALID [2022-02-20 19:59:23,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {2241#false} assume !false; {2241#false} is VALID [2022-02-20 19:59:23,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {2241#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {2241#false} is VALID [2022-02-20 19:59:23,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {2241#false} assume !false; {2241#false} is VALID [2022-02-20 19:59:23,130 INFO L272 TraceCheckUtils]: 43: Hoare triple {2241#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {2240#true} is VALID [2022-02-20 19:59:23,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {2240#true} havoc ~__retres1~6; {2240#true} is VALID [2022-02-20 19:59:23,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {2240#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {2240#true} is VALID [2022-02-20 19:59:23,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {2240#true} #res := ~__retres1~6; {2240#true} is VALID [2022-02-20 19:59:23,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {2240#true} assume true; {2240#true} is VALID [2022-02-20 19:59:23,131 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2240#true} {2241#false} #778#return; {2241#false} is VALID [2022-02-20 19:59:23,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {2241#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {2241#false} is VALID [2022-02-20 19:59:23,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {2241#false} assume 0 != eval2_~tmp~5#1; {2241#false} is VALID [2022-02-20 19:59:23,132 INFO L290 TraceCheckUtils]: 51: Hoare triple {2241#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {2241#false} is VALID [2022-02-20 19:59:23,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {2241#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {2241#false} is VALID [2022-02-20 19:59:23,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {2241#false} assume !(0 == ~m_pc~0); {2241#false} is VALID [2022-02-20 19:59:23,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {2241#false} assume 1 == ~m_pc~0; {2241#false} is VALID [2022-02-20 19:59:23,132 INFO L290 TraceCheckUtils]: 55: Hoare triple {2241#false} assume ~token~0 != 1 + ~local~0; {2241#false} is VALID [2022-02-20 19:59:23,133 INFO L272 TraceCheckUtils]: 56: Hoare triple {2241#false} call error2(); {2241#false} is VALID [2022-02-20 19:59:23,133 INFO L290 TraceCheckUtils]: 57: Hoare triple {2241#false} assume !false; {2241#false} is VALID [2022-02-20 19:59:23,133 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:23,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:23,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816984807] [2022-02-20 19:59:23,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816984807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:23,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:23,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:23,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421932947] [2022-02-20 19:59:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:23,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:23,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:23,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:23,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:23,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:23,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:23,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:23,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:23,174 INFO L87 Difference]: Start difference. First operand 316 states and 452 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:25,595 INFO L93 Difference]: Finished difference Result 667 states and 960 transitions. [2022-02-20 19:59:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:25,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 661 transitions. [2022-02-20 19:59:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:25,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 661 transitions. [2022-02-20 19:59:25,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 661 transitions. [2022-02-20 19:59:26,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 661 edges. 661 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:26,088 INFO L225 Difference]: With dead ends: 667 [2022-02-20 19:59:26,089 INFO L226 Difference]: Without dead ends: 472 [2022-02-20 19:59:26,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:26,091 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 547 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:26,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 1212 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:59:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-02-20 19:59:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 406. [2022-02-20 19:59:26,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:26,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 472 states. Second operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:26,118 INFO L74 IsIncluded]: Start isIncluded. First operand 472 states. Second operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:26,120 INFO L87 Difference]: Start difference. First operand 472 states. Second operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:26,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,141 INFO L93 Difference]: Finished difference Result 472 states and 676 transitions. [2022-02-20 19:59:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 676 transitions. [2022-02-20 19:59:26,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 472 states. [2022-02-20 19:59:26,145 INFO L87 Difference]: Start difference. First operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 472 states. [2022-02-20 19:59:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,166 INFO L93 Difference]: Finished difference Result 472 states and 676 transitions. [2022-02-20 19:59:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 676 transitions. [2022-02-20 19:59:26,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:26,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:26,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:26,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 324 states have (on average 1.4567901234567902) internal successors, (472), 331 states have internal predecessors, (472), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 579 transitions. [2022-02-20 19:59:26,186 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 579 transitions. Word has length 58 [2022-02-20 19:59:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:26,187 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 579 transitions. [2022-02-20 19:59:26,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 579 transitions. [2022-02-20 19:59:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:59:26,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:26,188 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] [2022-02-20 19:59:26,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:26,189 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:26,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1046518713, now seen corresponding path program 1 times [2022-02-20 19:59:26,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:26,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282425024] [2022-02-20 19:59:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:26,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {4702#true} assume true; {4702#true} is VALID [2022-02-20 19:59:26,268 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {4702#true} {4704#(not (= ~E_M~0 0))} #770#return; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {4738#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {4739#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:26,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {4739#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {4739#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:26,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {4739#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {4740#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:26,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {4740#(= |old(~E_M~0)| 0)} assume !(0 == ~E_1~0); {4740#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:26,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {4740#(= |old(~E_M~0)| 0)} assume true; {4740#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:26,308 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4740#(= |old(~E_M~0)| 0)} {4704#(not (= ~E_M~0 0))} #772#return; {4703#false} is VALID [2022-02-20 19:59:26,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {4741#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {4702#true} is VALID [2022-02-20 19:59:26,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {4702#true} assume !(1 == ~m_pc~0); {4702#true} is VALID [2022-02-20 19:59:26,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {4702#true} is_master_triggered_~__retres1~4#1 := 0; {4702#true} is VALID [2022-02-20 19:59:26,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {4702#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {4702#true} is VALID [2022-02-20 19:59:26,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {4702#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {4702#true} is VALID [2022-02-20 19:59:26,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {4702#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {4702#true} is VALID [2022-02-20 19:59:26,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {4702#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; {4702#true} is VALID [2022-02-20 19:59:26,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {4702#true} assume 1 == ~t1_pc~0; {4702#true} is VALID [2022-02-20 19:59:26,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {4702#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {4702#true} is VALID [2022-02-20 19:59:26,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {4702#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {4702#true} is VALID [2022-02-20 19:59:26,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {4702#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {4702#true} is VALID [2022-02-20 19:59:26,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {4702#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {4702#true} is VALID [2022-02-20 19:59:26,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {4702#true} assume true; {4702#true} is VALID [2022-02-20 19:59:26,328 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4702#true} {4703#false} #774#return; {4703#false} is VALID [2022-02-20 19:59:26,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {4738#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {4702#true} is VALID [2022-02-20 19:59:26,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {4702#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {4702#true} is VALID [2022-02-20 19:59:26,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {4702#true} assume 1 == ~E_M~0;~E_M~0 := 2; {4702#true} is VALID [2022-02-20 19:59:26,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {4702#true} assume 1 == ~E_1~0;~E_1~0 := 2; {4702#true} is VALID [2022-02-20 19:59:26,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {4702#true} assume true; {4702#true} is VALID [2022-02-20 19:59:26,335 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4702#true} {4703#false} #776#return; {4703#false} is VALID [2022-02-20 19:59:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:26,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {4702#true} havoc ~__retres1~6; {4702#true} is VALID [2022-02-20 19:59:26,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {4702#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {4702#true} is VALID [2022-02-20 19:59:26,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {4702#true} #res := ~__retres1~6; {4702#true} is VALID [2022-02-20 19:59:26,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {4702#true} assume true; {4702#true} is VALID [2022-02-20 19:59:26,341 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4702#true} {4703#false} #778#return; {4703#false} is VALID [2022-02-20 19:59:26,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {4702#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {4704#(not (= ~E_M~0 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {4704#(not (= ~E_M~0 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {4704#(not (= ~E_M~0 0))} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#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; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {4704#(not (= ~E_M~0 0))} call update_channels2(); {4702#true} is VALID [2022-02-20 19:59:26,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {4702#true} assume true; {4702#true} is VALID [2022-02-20 19:59:26,345 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4702#true} {4704#(not (= ~E_M~0 0))} #770#return; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {4704#(not (= ~E_M~0 0))} assume { :begin_inline_init_threads2 } true; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {4704#(not (= ~E_M~0 0))} assume 1 == ~m_i~0;~m_st~0 := 0; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {4704#(not (= ~E_M~0 0))} assume 1 == ~t1_i~0;~t1_st~0 := 0; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {4704#(not (= ~E_M~0 0))} assume { :end_inline_init_threads2 } true; {4704#(not (= ~E_M~0 0))} is VALID [2022-02-20 19:59:26,347 INFO L272 TraceCheckUtils]: 11: Hoare triple {4704#(not (= ~E_M~0 0))} call fire_delta_events2(); {4738#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:26,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {4738#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {4739#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:26,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {4739#(= ~E_M~0 |old(~E_M~0)|)} assume !(0 == ~T1_E~0); {4739#(= ~E_M~0 |old(~E_M~0)|)} is VALID [2022-02-20 19:59:26,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {4739#(= ~E_M~0 |old(~E_M~0)|)} assume 0 == ~E_M~0;~E_M~0 := 1; {4740#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:26,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {4740#(= |old(~E_M~0)| 0)} assume !(0 == ~E_1~0); {4740#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:26,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {4740#(= |old(~E_M~0)| 0)} assume true; {4740#(= |old(~E_M~0)| 0)} is VALID [2022-02-20 19:59:26,350 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4740#(= |old(~E_M~0)| 0)} {4704#(not (= ~E_M~0 0))} #772#return; {4703#false} is VALID [2022-02-20 19:59:26,350 INFO L272 TraceCheckUtils]: 18: Hoare triple {4703#false} call activate_threads2(); {4741#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:26,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {4741#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {4702#true} is VALID [2022-02-20 19:59:26,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {4702#true} assume !(1 == ~m_pc~0); {4702#true} is VALID [2022-02-20 19:59:26,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {4702#true} is_master_triggered_~__retres1~4#1 := 0; {4702#true} is VALID [2022-02-20 19:59:26,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {4702#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {4702#true} is VALID [2022-02-20 19:59:26,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {4702#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {4702#true} is VALID [2022-02-20 19:59:26,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {4702#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {4702#true} is VALID [2022-02-20 19:59:26,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {4702#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; {4702#true} is VALID [2022-02-20 19:59:26,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {4702#true} assume 1 == ~t1_pc~0; {4702#true} is VALID [2022-02-20 19:59:26,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {4702#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {4702#true} is VALID [2022-02-20 19:59:26,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {4702#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {4702#true} is VALID [2022-02-20 19:59:26,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {4702#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {4702#true} is VALID [2022-02-20 19:59:26,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {4702#true} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {4702#true} is VALID [2022-02-20 19:59:26,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {4702#true} assume true; {4702#true} is VALID [2022-02-20 19:59:26,354 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4702#true} {4703#false} #774#return; {4703#false} is VALID [2022-02-20 19:59:26,354 INFO L272 TraceCheckUtils]: 33: Hoare triple {4703#false} call reset_delta_events2(); {4738#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:26,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {4738#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {4702#true} is VALID [2022-02-20 19:59:26,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {4702#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {4702#true} is VALID [2022-02-20 19:59:26,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {4702#true} assume 1 == ~E_M~0;~E_M~0 := 2; {4702#true} is VALID [2022-02-20 19:59:26,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {4702#true} assume 1 == ~E_1~0;~E_1~0 := 2; {4702#true} is VALID [2022-02-20 19:59:26,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {4702#true} assume true; {4702#true} is VALID [2022-02-20 19:59:26,355 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4702#true} {4703#false} #776#return; {4703#false} is VALID [2022-02-20 19:59:26,355 INFO L290 TraceCheckUtils]: 40: Hoare triple {4703#false} assume !false; {4703#false} is VALID [2022-02-20 19:59:26,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {4703#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {4703#false} is VALID [2022-02-20 19:59:26,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {4703#false} assume !false; {4703#false} is VALID [2022-02-20 19:59:26,356 INFO L272 TraceCheckUtils]: 43: Hoare triple {4703#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {4702#true} is VALID [2022-02-20 19:59:26,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {4702#true} havoc ~__retres1~6; {4702#true} is VALID [2022-02-20 19:59:26,356 INFO L290 TraceCheckUtils]: 45: Hoare triple {4702#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {4702#true} is VALID [2022-02-20 19:59:26,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {4702#true} #res := ~__retres1~6; {4702#true} is VALID [2022-02-20 19:59:26,357 INFO L290 TraceCheckUtils]: 47: Hoare triple {4702#true} assume true; {4702#true} is VALID [2022-02-20 19:59:26,357 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4702#true} {4703#false} #778#return; {4703#false} is VALID [2022-02-20 19:59:26,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {4703#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {4703#false} is VALID [2022-02-20 19:59:26,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {4703#false} assume 0 != eval2_~tmp~5#1; {4703#false} is VALID [2022-02-20 19:59:26,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {4703#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {4703#false} is VALID [2022-02-20 19:59:26,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {4703#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {4703#false} is VALID [2022-02-20 19:59:26,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {4703#false} assume !(0 == ~m_pc~0); {4703#false} is VALID [2022-02-20 19:59:26,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {4703#false} assume 1 == ~m_pc~0; {4703#false} is VALID [2022-02-20 19:59:26,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {4703#false} assume ~token~0 != 1 + ~local~0; {4703#false} is VALID [2022-02-20 19:59:26,359 INFO L272 TraceCheckUtils]: 56: Hoare triple {4703#false} call error2(); {4703#false} is VALID [2022-02-20 19:59:26,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {4703#false} assume !false; {4703#false} is VALID [2022-02-20 19:59:26,360 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:26,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:26,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282425024] [2022-02-20 19:59:26,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282425024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:26,360 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:26,361 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:26,361 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621535027] [2022-02-20 19:59:26,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:26,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:26,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:26,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:26,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:26,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:26,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:26,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:26,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:26,402 INFO L87 Difference]: Start difference. First operand 406 states and 579 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:27,812 INFO L93 Difference]: Finished difference Result 753 states and 1087 transitions. [2022-02-20 19:59:27,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:59:27,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:27,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 500 transitions. [2022-02-20 19:59:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 500 transitions. [2022-02-20 19:59:27,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 500 transitions. [2022-02-20 19:59:28,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:28,210 INFO L225 Difference]: With dead ends: 753 [2022-02-20 19:59:28,210 INFO L226 Difference]: Without dead ends: 468 [2022-02-20 19:59:28,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:59:28,212 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 490 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:28,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 816 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-02-20 19:59:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 406. [2022-02-20 19:59:28,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:28,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 406 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 331 states have internal predecessors, (469), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:28,235 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 406 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 331 states have internal predecessors, (469), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:28,236 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 406 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 331 states have internal predecessors, (469), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:28,252 INFO L93 Difference]: Finished difference Result 468 states and 670 transitions. [2022-02-20 19:59:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 670 transitions. [2022-02-20 19:59:28,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:28,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:28,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 406 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 331 states have internal predecessors, (469), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 468 states. [2022-02-20 19:59:28,256 INFO L87 Difference]: Start difference. First operand has 406 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 331 states have internal predecessors, (469), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 468 states. [2022-02-20 19:59:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:28,271 INFO L93 Difference]: Finished difference Result 468 states and 670 transitions. [2022-02-20 19:59:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 670 transitions. [2022-02-20 19:59:28,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:28,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:28,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:28,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 324 states have (on average 1.4475308641975309) internal successors, (469), 331 states have internal predecessors, (469), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 576 transitions. [2022-02-20 19:59:28,289 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 576 transitions. Word has length 58 [2022-02-20 19:59:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:28,289 INFO L470 AbstractCegarLoop]: Abstraction has 406 states and 576 transitions. [2022-02-20 19:59:28,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 576 transitions. [2022-02-20 19:59:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:59:28,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:28,291 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] [2022-02-20 19:59:28,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:28,291 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1199060741, now seen corresponding path program 1 times [2022-02-20 19:59:28,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:28,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455346011] [2022-02-20 19:59:28,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:28,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {7259#true} assume true; {7259#true} is VALID [2022-02-20 19:59:28,325 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {7259#true} {7259#true} #770#return; {7259#true} is VALID [2022-02-20 19:59:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {7294#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {7259#true} is VALID [2022-02-20 19:59:28,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {7259#true} assume !(0 == ~T1_E~0); {7259#true} is VALID [2022-02-20 19:59:28,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {7259#true} assume !(0 == ~E_M~0); {7259#true} is VALID [2022-02-20 19:59:28,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {7259#true} assume !(0 == ~E_1~0); {7259#true} is VALID [2022-02-20 19:59:28,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {7259#true} assume true; {7259#true} is VALID [2022-02-20 19:59:28,336 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7259#true} {7259#true} #772#return; {7259#true} is VALID [2022-02-20 19:59:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {7259#true} is VALID [2022-02-20 19:59:28,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {7259#true} assume !(1 == ~m_pc~0); {7259#true} is VALID [2022-02-20 19:59:28,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {7259#true} is_master_triggered_~__retres1~4#1 := 0; {7296#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:59:28,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {7296#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {7297#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:59:28,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {7297#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {7298#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:59:28,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {7298#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {7260#false} is VALID [2022-02-20 19:59:28,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {7260#false} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {7260#false} is VALID [2022-02-20 19:59:28,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {7260#false} assume 1 == ~t1_pc~0; {7260#false} is VALID [2022-02-20 19:59:28,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {7260#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {7260#false} is VALID [2022-02-20 19:59:28,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {7260#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {7260#false} is VALID [2022-02-20 19:59:28,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {7260#false} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {7260#false} is VALID [2022-02-20 19:59:28,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {7260#false} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {7260#false} is VALID [2022-02-20 19:59:28,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {7260#false} assume true; {7260#false} is VALID [2022-02-20 19:59:28,423 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {7260#false} {7259#true} #774#return; {7260#false} is VALID [2022-02-20 19:59:28,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {7294#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {7259#true} is VALID [2022-02-20 19:59:28,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {7259#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {7259#true} is VALID [2022-02-20 19:59:28,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {7259#true} assume 1 == ~E_M~0;~E_M~0 := 2; {7259#true} is VALID [2022-02-20 19:59:28,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {7259#true} assume 1 == ~E_1~0;~E_1~0 := 2; {7259#true} is VALID [2022-02-20 19:59:28,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {7259#true} assume true; {7259#true} is VALID [2022-02-20 19:59:28,431 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7259#true} {7260#false} #776#return; {7260#false} is VALID [2022-02-20 19:59:28,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:28,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {7259#true} havoc ~__retres1~6; {7259#true} is VALID [2022-02-20 19:59:28,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {7259#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {7259#true} is VALID [2022-02-20 19:59:28,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {7259#true} #res := ~__retres1~6; {7259#true} is VALID [2022-02-20 19:59:28,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {7259#true} assume true; {7259#true} is VALID [2022-02-20 19:59:28,438 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7259#true} {7260#false} #778#return; {7260#false} is VALID [2022-02-20 19:59:28,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {7259#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {7259#true} is VALID [2022-02-20 19:59:28,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {7259#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {7259#true} is VALID [2022-02-20 19:59:28,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {7259#true} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {7259#true} is VALID [2022-02-20 19:59:28,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {7259#true} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#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; {7259#true} is VALID [2022-02-20 19:59:28,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {7259#true} call update_channels2(); {7259#true} is VALID [2022-02-20 19:59:28,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {7259#true} assume true; {7259#true} is VALID [2022-02-20 19:59:28,439 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7259#true} {7259#true} #770#return; {7259#true} is VALID [2022-02-20 19:59:28,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {7259#true} assume { :begin_inline_init_threads2 } true; {7259#true} is VALID [2022-02-20 19:59:28,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {7259#true} assume 1 == ~m_i~0;~m_st~0 := 0; {7259#true} is VALID [2022-02-20 19:59:28,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {7259#true} assume 1 == ~t1_i~0;~t1_st~0 := 0; {7259#true} is VALID [2022-02-20 19:59:28,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {7259#true} assume { :end_inline_init_threads2 } true; {7259#true} is VALID [2022-02-20 19:59:28,441 INFO L272 TraceCheckUtils]: 11: Hoare triple {7259#true} call fire_delta_events2(); {7294#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:28,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {7294#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {7259#true} is VALID [2022-02-20 19:59:28,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {7259#true} assume !(0 == ~T1_E~0); {7259#true} is VALID [2022-02-20 19:59:28,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {7259#true} assume !(0 == ~E_M~0); {7259#true} is VALID [2022-02-20 19:59:28,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {7259#true} assume !(0 == ~E_1~0); {7259#true} is VALID [2022-02-20 19:59:28,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {7259#true} assume true; {7259#true} is VALID [2022-02-20 19:59:28,442 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7259#true} {7259#true} #772#return; {7259#true} is VALID [2022-02-20 19:59:28,443 INFO L272 TraceCheckUtils]: 18: Hoare triple {7259#true} call activate_threads2(); {7295#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:28,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {7295#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {7259#true} is VALID [2022-02-20 19:59:28,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {7259#true} assume !(1 == ~m_pc~0); {7259#true} is VALID [2022-02-20 19:59:28,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {7259#true} is_master_triggered_~__retres1~4#1 := 0; {7296#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is VALID [2022-02-20 19:59:28,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {7296#(and (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {7297#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} is VALID [2022-02-20 19:59:28,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {7297#(and (<= |activate_threads2_is_master_triggered_#res#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {7298#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} is VALID [2022-02-20 19:59:28,445 INFO L290 TraceCheckUtils]: 24: Hoare triple {7298#(and (< 0 (+ |activate_threads2_~tmp~6#1| 1)) (<= |activate_threads2_~tmp~6#1| 0))} assume 0 != ~tmp~6#1;~m_st~0 := 0; {7260#false} is VALID [2022-02-20 19:59:28,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {7260#false} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {7260#false} is VALID [2022-02-20 19:59:28,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {7260#false} assume 1 == ~t1_pc~0; {7260#false} is VALID [2022-02-20 19:59:28,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {7260#false} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {7260#false} is VALID [2022-02-20 19:59:28,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {7260#false} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {7260#false} is VALID [2022-02-20 19:59:28,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {7260#false} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {7260#false} is VALID [2022-02-20 19:59:28,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {7260#false} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {7260#false} is VALID [2022-02-20 19:59:28,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {7260#false} assume true; {7260#false} is VALID [2022-02-20 19:59:28,446 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7260#false} {7259#true} #774#return; {7260#false} is VALID [2022-02-20 19:59:28,447 INFO L272 TraceCheckUtils]: 33: Hoare triple {7260#false} call reset_delta_events2(); {7294#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:28,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {7294#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {7259#true} is VALID [2022-02-20 19:59:28,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {7259#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {7259#true} is VALID [2022-02-20 19:59:28,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {7259#true} assume 1 == ~E_M~0;~E_M~0 := 2; {7259#true} is VALID [2022-02-20 19:59:28,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {7259#true} assume 1 == ~E_1~0;~E_1~0 := 2; {7259#true} is VALID [2022-02-20 19:59:28,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {7259#true} assume true; {7259#true} is VALID [2022-02-20 19:59:28,448 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7259#true} {7260#false} #776#return; {7260#false} is VALID [2022-02-20 19:59:28,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {7260#false} assume !false; {7260#false} is VALID [2022-02-20 19:59:28,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {7260#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {7260#false} is VALID [2022-02-20 19:59:28,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {7260#false} assume !false; {7260#false} is VALID [2022-02-20 19:59:28,448 INFO L272 TraceCheckUtils]: 43: Hoare triple {7260#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {7259#true} is VALID [2022-02-20 19:59:28,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {7259#true} havoc ~__retres1~6; {7259#true} is VALID [2022-02-20 19:59:28,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {7259#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {7259#true} is VALID [2022-02-20 19:59:28,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {7259#true} #res := ~__retres1~6; {7259#true} is VALID [2022-02-20 19:59:28,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {7259#true} assume true; {7259#true} is VALID [2022-02-20 19:59:28,449 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7259#true} {7260#false} #778#return; {7260#false} is VALID [2022-02-20 19:59:28,449 INFO L290 TraceCheckUtils]: 49: Hoare triple {7260#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {7260#false} is VALID [2022-02-20 19:59:28,449 INFO L290 TraceCheckUtils]: 50: Hoare triple {7260#false} assume 0 != eval2_~tmp~5#1; {7260#false} is VALID [2022-02-20 19:59:28,450 INFO L290 TraceCheckUtils]: 51: Hoare triple {7260#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {7260#false} is VALID [2022-02-20 19:59:28,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {7260#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {7260#false} is VALID [2022-02-20 19:59:28,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {7260#false} assume !(0 == ~m_pc~0); {7260#false} is VALID [2022-02-20 19:59:28,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {7260#false} assume 1 == ~m_pc~0; {7260#false} is VALID [2022-02-20 19:59:28,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {7260#false} assume ~token~0 != 1 + ~local~0; {7260#false} is VALID [2022-02-20 19:59:28,450 INFO L272 TraceCheckUtils]: 56: Hoare triple {7260#false} call error2(); {7260#false} is VALID [2022-02-20 19:59:28,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {7260#false} assume !false; {7260#false} is VALID [2022-02-20 19:59:28,451 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:28,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:28,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455346011] [2022-02-20 19:59:28,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455346011] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:28,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:28,452 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:28,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733559752] [2022-02-20 19:59:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:28,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:28,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:28,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:28,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:28,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:28,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:28,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:28,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:28,490 INFO L87 Difference]: Start difference. First operand 406 states and 576 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,404 INFO L93 Difference]: Finished difference Result 789 states and 1144 transitions. [2022-02-20 19:59:30,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:30,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 523 transitions. [2022-02-20 19:59:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 523 transitions. [2022-02-20 19:59:30,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 523 transitions. [2022-02-20 19:59:30,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:30,862 INFO L225 Difference]: With dead ends: 789 [2022-02-20 19:59:30,862 INFO L226 Difference]: Without dead ends: 505 [2022-02-20 19:59:30,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-02-20 19:59:30,873 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 285 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:30,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 1081 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:59:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-02-20 19:59:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 415. [2022-02-20 19:59:30,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:30,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand has 415 states, 333 states have (on average 1.4354354354354355) internal successors, (478), 340 states have internal predecessors, (478), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:30,926 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand has 415 states, 333 states have (on average 1.4354354354354355) internal successors, (478), 340 states have internal predecessors, (478), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:30,927 INFO L87 Difference]: Start difference. First operand 505 states. Second operand has 415 states, 333 states have (on average 1.4354354354354355) internal successors, (478), 340 states have internal predecessors, (478), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,944 INFO L93 Difference]: Finished difference Result 505 states and 724 transitions. [2022-02-20 19:59:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 724 transitions. [2022-02-20 19:59:30,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:30,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:30,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 415 states, 333 states have (on average 1.4354354354354355) internal successors, (478), 340 states have internal predecessors, (478), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 505 states. [2022-02-20 19:59:30,949 INFO L87 Difference]: Start difference. First operand has 415 states, 333 states have (on average 1.4354354354354355) internal successors, (478), 340 states have internal predecessors, (478), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 505 states. [2022-02-20 19:59:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,975 INFO L93 Difference]: Finished difference Result 505 states and 724 transitions. [2022-02-20 19:59:30,975 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 724 transitions. [2022-02-20 19:59:30,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:30,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:30,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:30,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:30,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 333 states have (on average 1.4354354354354355) internal successors, (478), 340 states have internal predecessors, (478), 53 states have call successors, (53), 27 states have call predecessors, (53), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:59:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 585 transitions. [2022-02-20 19:59:30,992 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 585 transitions. Word has length 58 [2022-02-20 19:59:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:30,993 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 585 transitions. [2022-02-20 19:59:30,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 585 transitions. [2022-02-20 19:59:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 19:59:30,996 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:30,996 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] [2022-02-20 19:59:30,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:30,996 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1044922557, now seen corresponding path program 1 times [2022-02-20 19:59:30,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:30,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796391535] [2022-02-20 19:59:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {9955#true} assume true; {9955#true} is VALID [2022-02-20 19:59:31,067 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {9955#true} {9957#(= ~m_pc~0 ~t1_pc~0)} #770#return; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {9991#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {9955#true} is VALID [2022-02-20 19:59:31,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {9955#true} assume !(0 == ~T1_E~0); {9955#true} is VALID [2022-02-20 19:59:31,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {9955#true} assume !(0 == ~E_M~0); {9955#true} is VALID [2022-02-20 19:59:31,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {9955#true} assume !(0 == ~E_1~0); {9955#true} is VALID [2022-02-20 19:59:31,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {9955#true} assume true; {9955#true} is VALID [2022-02-20 19:59:31,083 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9955#true} {9957#(= ~m_pc~0 ~t1_pc~0)} #772#return; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 19:59:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {9992#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {9955#true} is VALID [2022-02-20 19:59:31,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {9955#true} assume !(1 == ~m_pc~0); {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume true; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,192 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} {9957#(= ~m_pc~0 ~t1_pc~0)} #774#return; {9956#false} is VALID [2022-02-20 19:59:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 19:59:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {9991#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {9955#true} is VALID [2022-02-20 19:59:31,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {9955#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {9955#true} is VALID [2022-02-20 19:59:31,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {9955#true} assume 1 == ~E_M~0;~E_M~0 := 2; {9955#true} is VALID [2022-02-20 19:59:31,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {9955#true} assume 1 == ~E_1~0;~E_1~0 := 2; {9955#true} is VALID [2022-02-20 19:59:31,202 INFO L290 TraceCheckUtils]: 4: Hoare triple {9955#true} assume true; {9955#true} is VALID [2022-02-20 19:59:31,202 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9955#true} {9956#false} #776#return; {9956#false} is VALID [2022-02-20 19:59:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:59:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {9955#true} havoc ~__retres1~6; {9955#true} is VALID [2022-02-20 19:59:31,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {9955#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {9955#true} is VALID [2022-02-20 19:59:31,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {9955#true} #res := ~__retres1~6; {9955#true} is VALID [2022-02-20 19:59:31,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {9955#true} assume true; {9955#true} is VALID [2022-02-20 19:59:31,208 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9955#true} {9956#false} #778#return; {9956#false} is VALID [2022-02-20 19:59:31,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {9955#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~7#1;havoc main2_~__retres1~7#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret28#1, start_simulation2_#t~ret29#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; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} call update_channels2(); {9955#true} is VALID [2022-02-20 19:59:31,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {9955#true} assume true; {9955#true} is VALID [2022-02-20 19:59:31,211 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9955#true} {9957#(= ~m_pc~0 ~t1_pc~0)} #770#return; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} assume { :begin_inline_init_threads2 } true; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~m_i~0;~m_st~0 := 0; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} assume { :end_inline_init_threads2 } true; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,214 INFO L272 TraceCheckUtils]: 11: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} call fire_delta_events2(); {9991#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:31,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {9991#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(0 == ~M_E~0); {9955#true} is VALID [2022-02-20 19:59:31,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {9955#true} assume !(0 == ~T1_E~0); {9955#true} is VALID [2022-02-20 19:59:31,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {9955#true} assume !(0 == ~E_M~0); {9955#true} is VALID [2022-02-20 19:59:31,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {9955#true} assume !(0 == ~E_1~0); {9955#true} is VALID [2022-02-20 19:59:31,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {9955#true} assume true; {9955#true} is VALID [2022-02-20 19:59:31,216 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9955#true} {9957#(= ~m_pc~0 ~t1_pc~0)} #772#return; {9957#(= ~m_pc~0 ~t1_pc~0)} is VALID [2022-02-20 19:59:31,216 INFO L272 TraceCheckUtils]: 18: Hoare triple {9957#(= ~m_pc~0 ~t1_pc~0)} call activate_threads2(); {9992#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} is VALID [2022-02-20 19:59:31,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {9992#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))} havoc ~tmp~6#1;havoc ~tmp___0~4#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; {9955#true} is VALID [2022-02-20 19:59:31,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {9955#true} assume !(1 == ~m_pc~0); {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_~__retres1~4#1 := 0; {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume !(0 != ~tmp~6#1); {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} is VALID [2022-02-20 19:59:31,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {9993#(or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))} assume 1 == ~t1_pc~0; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~4#1 := #t~ret26#1;havoc #t~ret26#1; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume 0 != ~tmp___0~4#1;~t1_st~0 := 0; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} assume true; {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} is VALID [2022-02-20 19:59:31,223 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9994#(and (or (<= 1 ~t1_pc~0) (not (<= ~m_pc~0 0))) (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) (<= ~m_pc~0 0)))} {9957#(= ~m_pc~0 ~t1_pc~0)} #774#return; {9956#false} is VALID [2022-02-20 19:59:31,223 INFO L272 TraceCheckUtils]: 33: Hoare triple {9956#false} call reset_delta_events2(); {9991#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} is VALID [2022-02-20 19:59:31,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {9991#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))} assume !(1 == ~M_E~0); {9955#true} is VALID [2022-02-20 19:59:31,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {9955#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {9955#true} is VALID [2022-02-20 19:59:31,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {9955#true} assume 1 == ~E_M~0;~E_M~0 := 2; {9955#true} is VALID [2022-02-20 19:59:31,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {9955#true} assume 1 == ~E_1~0;~E_1~0 := 2; {9955#true} is VALID [2022-02-20 19:59:31,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {9955#true} assume true; {9955#true} is VALID [2022-02-20 19:59:31,224 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9955#true} {9956#false} #776#return; {9956#false} is VALID [2022-02-20 19:59:31,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {9956#false} assume !false; {9956#false} is VALID [2022-02-20 19:59:31,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {9956#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret22#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_2~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {9956#false} is VALID [2022-02-20 19:59:31,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {9956#false} assume !false; {9956#false} is VALID [2022-02-20 19:59:31,226 INFO L272 TraceCheckUtils]: 43: Hoare triple {9956#false} call eval2_#t~ret22#1 := exists_runnable_thread2(); {9955#true} is VALID [2022-02-20 19:59:31,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {9955#true} havoc ~__retres1~6; {9955#true} is VALID [2022-02-20 19:59:31,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {9955#true} assume 0 == ~m_st~0;~__retres1~6 := 1; {9955#true} is VALID [2022-02-20 19:59:31,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {9955#true} #res := ~__retres1~6; {9955#true} is VALID [2022-02-20 19:59:31,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {9955#true} assume true; {9955#true} is VALID [2022-02-20 19:59:31,227 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9955#true} {9956#false} #778#return; {9956#false} is VALID [2022-02-20 19:59:31,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {9956#false} assume -2147483648 <= eval2_#t~ret22#1 && eval2_#t~ret22#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret22#1;havoc eval2_#t~ret22#1; {9956#false} is VALID [2022-02-20 19:59:31,227 INFO L290 TraceCheckUtils]: 50: Hoare triple {9956#false} assume 0 != eval2_~tmp~5#1; {9956#false} is VALID [2022-02-20 19:59:31,227 INFO L290 TraceCheckUtils]: 51: Hoare triple {9956#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet23#1 && eval2_#t~nondet23#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet23#1;havoc eval2_#t~nondet23#1; {9956#false} is VALID [2022-02-20 19:59:31,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {9956#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet20#1, master_#t~nondet21#1, master_~tmp_var~0#1;assume -2147483648 <= master_#t~nondet20#1 && master_#t~nondet20#1 <= 2147483647;master_~tmp_var~0#1 := master_#t~nondet20#1;havoc master_#t~nondet20#1; {9956#false} is VALID [2022-02-20 19:59:31,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {9956#false} assume !(0 == ~m_pc~0); {9956#false} is VALID [2022-02-20 19:59:31,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {9956#false} assume 1 == ~m_pc~0; {9956#false} is VALID [2022-02-20 19:59:31,228 INFO L290 TraceCheckUtils]: 55: Hoare triple {9956#false} assume ~token~0 != 1 + ~local~0; {9956#false} is VALID [2022-02-20 19:59:31,228 INFO L272 TraceCheckUtils]: 56: Hoare triple {9956#false} call error2(); {9956#false} is VALID [2022-02-20 19:59:31,228 INFO L290 TraceCheckUtils]: 57: Hoare triple {9956#false} assume !false; {9956#false} is VALID [2022-02-20 19:59:31,230 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:31,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:31,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796391535] [2022-02-20 19:59:31,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796391535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:31,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:31,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:31,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888100558] [2022-02-20 19:59:31,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:31,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:31,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:31,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:31,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:31,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:31,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:31,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:31,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:31,274 INFO L87 Difference]: Start difference. First operand 415 states and 585 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:35,180 INFO L93 Difference]: Finished difference Result 1587 states and 2310 transitions. [2022-02-20 19:59:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 19:59:35,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-02-20 19:59:35,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 938 transitions. [2022-02-20 19:59:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:35,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 938 transitions. [2022-02-20 19:59:35,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 938 transitions. [2022-02-20 19:59:35,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 938 edges. 938 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:36,100 INFO L225 Difference]: With dead ends: 1587 [2022-02-20 19:59:36,101 INFO L226 Difference]: Without dead ends: 1294 [2022-02-20 19:59:36,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-02-20 19:59:36,103 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 1000 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:36,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1019 Valid, 1044 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:59:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-02-20 19:59:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1123. [2022-02-20 19:59:36,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:36,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1294 states. Second operand has 1123 states, 894 states have (on average 1.3870246085011186) internal successors, (1240), 916 states have internal predecessors, (1240), 140 states have call successors, (140), 81 states have call predecessors, (140), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2022-02-20 19:59:36,643 INFO L74 IsIncluded]: Start isIncluded. First operand 1294 states. Second operand has 1123 states, 894 states have (on average 1.3870246085011186) internal successors, (1240), 916 states have internal predecessors, (1240), 140 states have call successors, (140), 81 states have call predecessors, (140), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2022-02-20 19:59:36,647 INFO L87 Difference]: Start difference. First operand 1294 states. Second operand has 1123 states, 894 states have (on average 1.3870246085011186) internal successors, (1240), 916 states have internal predecessors, (1240), 140 states have call successors, (140), 81 states have call predecessors, (140), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2022-02-20 19:59:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:36,727 INFO L93 Difference]: Finished difference Result 1294 states and 1840 transitions. [2022-02-20 19:59:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1840 transitions. [2022-02-20 19:59:36,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:36,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:36,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 1123 states, 894 states have (on average 1.3870246085011186) internal successors, (1240), 916 states have internal predecessors, (1240), 140 states have call successors, (140), 81 states have call predecessors, (140), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) Second operand 1294 states. [2022-02-20 19:59:36,741 INFO L87 Difference]: Start difference. First operand has 1123 states, 894 states have (on average 1.3870246085011186) internal successors, (1240), 916 states have internal predecessors, (1240), 140 states have call successors, (140), 81 states have call predecessors, (140), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) Second operand 1294 states. [2022-02-20 19:59:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:36,823 INFO L93 Difference]: Finished difference Result 1294 states and 1840 transitions. [2022-02-20 19:59:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1840 transitions. [2022-02-20 19:59:36,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:36,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:36,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:36,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 894 states have (on average 1.3870246085011186) internal successors, (1240), 916 states have internal predecessors, (1240), 140 states have call successors, (140), 81 states have call predecessors, (140), 87 states have return successors, (189), 128 states have call predecessors, (189), 136 states have call successors, (189) [2022-02-20 19:59:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1569 transitions. [2022-02-20 19:59:36,920 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1569 transitions. Word has length 58 [2022-02-20 19:59:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:36,920 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1569 transitions. [2022-02-20 19:59:36,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:59:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1569 transitions. [2022-02-20 19:59:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:36,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:36,922 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:36,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:36,923 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:36,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash 863362558, now seen corresponding path program 1 times [2022-02-20 19:59:36,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:36,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665007689] [2022-02-20 19:59:36,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:36,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:36,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {16293#(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); {16294#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {16294#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {16294#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:36,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16294#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {16255#(= ~q_read_ev~0 2)} #742#return; {16255#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:36,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {16295#(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;~q_read_ev~0 := 1; {16296#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {16296#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {16296#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {16296#(= |old(~q_read_ev~0)| 0)} assume true; {16296#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16296#(= |old(~q_read_ev~0)| 0)} {16255#(= ~q_read_ev~0 2)} #744#return; {16254#false} is VALID [2022-02-20 19:59:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {16253#true} havoc ~__retres1~0; {16253#true} is VALID [2022-02-20 19:59:37,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {16253#true} assume 1 == ~p_dw_pc~0; {16253#true} is VALID [2022-02-20 19:59:37,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {16253#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {16253#true} is VALID [2022-02-20 19:59:37,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {16253#true} #res := ~__retres1~0; {16253#true} is VALID [2022-02-20 19:59:37,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,037 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16253#true} {16253#true} #738#return; {16253#true} is VALID [2022-02-20 19:59:37,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {16253#true} havoc ~__retres1~1; {16253#true} is VALID [2022-02-20 19:59:37,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {16253#true} assume 1 == ~c_dr_pc~0; {16253#true} is VALID [2022-02-20 19:59:37,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {16253#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16253#true} is VALID [2022-02-20 19:59:37,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {16253#true} #res := ~__retres1~1; {16253#true} is VALID [2022-02-20 19:59:37,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,044 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16253#true} {16253#true} #740#return; {16253#true} is VALID [2022-02-20 19:59:37,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {16297#(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; {16253#true} is VALID [2022-02-20 19:59:37,044 INFO L272 TraceCheckUtils]: 1: Hoare triple {16253#true} call #t~ret8 := is_do_write_p_triggered(); {16253#true} is VALID [2022-02-20 19:59:37,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {16253#true} havoc ~__retres1~0; {16253#true} is VALID [2022-02-20 19:59:37,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {16253#true} assume 1 == ~p_dw_pc~0; {16253#true} is VALID [2022-02-20 19:59:37,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {16253#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {16253#true} is VALID [2022-02-20 19:59:37,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {16253#true} #res := ~__retres1~0; {16253#true} is VALID [2022-02-20 19:59:37,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,045 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16253#true} {16253#true} #738#return; {16253#true} is VALID [2022-02-20 19:59:37,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {16253#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16253#true} is VALID [2022-02-20 19:59:37,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {16253#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {16253#true} is VALID [2022-02-20 19:59:37,046 INFO L272 TraceCheckUtils]: 10: Hoare triple {16253#true} call #t~ret9 := is_do_read_c_triggered(); {16253#true} is VALID [2022-02-20 19:59:37,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {16253#true} havoc ~__retres1~1; {16253#true} is VALID [2022-02-20 19:59:37,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {16253#true} assume 1 == ~c_dr_pc~0; {16253#true} is VALID [2022-02-20 19:59:37,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {16253#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16253#true} is VALID [2022-02-20 19:59:37,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {16253#true} #res := ~__retres1~1; {16253#true} is VALID [2022-02-20 19:59:37,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,047 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16253#true} {16253#true} #740#return; {16253#true} is VALID [2022-02-20 19:59:37,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {16253#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16253#true} is VALID [2022-02-20 19:59:37,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {16253#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16253#true} is VALID [2022-02-20 19:59:37,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,048 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16253#true} {16254#false} #746#return; {16254#false} is VALID [2022-02-20 19:59:37,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {16295#(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; {16253#true} is VALID [2022-02-20 19:59:37,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {16253#true} assume !(1 == ~q_write_ev~0); {16253#true} is VALID [2022-02-20 19:59:37,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16253#true} {16254#false} #748#return; {16254#false} is VALID [2022-02-20 19:59:37,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:37,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {16253#true} havoc ~__retres1~2; {16253#true} is VALID [2022-02-20 19:59:37,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {16253#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16253#true} is VALID [2022-02-20 19:59:37,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {16253#true} #res := ~__retres1~2; {16253#true} is VALID [2022-02-20 19:59:37,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,064 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16253#true} {16254#false} #750#return; {16254#false} is VALID [2022-02-20 19:59:37,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {16253#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {16253#true} is VALID [2022-02-20 19:59:37,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {16253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {16253#true} is VALID [2022-02-20 19:59:37,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {16253#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {16255#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {16255#(= ~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; {16255#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {16255#(= ~q_read_ev~0 2)} call update_channels1(); {16293#(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:37,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {16293#(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); {16294#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:37,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {16294#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {16294#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:37,067 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16294#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {16255#(= ~q_read_ev~0 2)} #742#return; {16255#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {16255#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {16255#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {16255#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {16255#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {16255#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {16255#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {16255#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {16255#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:37,069 INFO L272 TraceCheckUtils]: 12: Hoare triple {16255#(= ~q_read_ev~0 2)} call fire_delta_events1(); {16295#(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:37,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {16295#(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;~q_read_ev~0 := 1; {16296#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {16296#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {16296#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {16296#(= |old(~q_read_ev~0)| 0)} assume true; {16296#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:37,071 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16296#(= |old(~q_read_ev~0)| 0)} {16255#(= ~q_read_ev~0 2)} #744#return; {16254#false} is VALID [2022-02-20 19:59:37,071 INFO L272 TraceCheckUtils]: 17: Hoare triple {16254#false} call activate_threads1(); {16297#(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:37,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {16297#(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; {16253#true} is VALID [2022-02-20 19:59:37,071 INFO L272 TraceCheckUtils]: 19: Hoare triple {16253#true} call #t~ret8 := is_do_write_p_triggered(); {16253#true} is VALID [2022-02-20 19:59:37,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {16253#true} havoc ~__retres1~0; {16253#true} is VALID [2022-02-20 19:59:37,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {16253#true} assume 1 == ~p_dw_pc~0; {16253#true} is VALID [2022-02-20 19:59:37,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {16253#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {16253#true} is VALID [2022-02-20 19:59:37,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {16253#true} #res := ~__retres1~0; {16253#true} is VALID [2022-02-20 19:59:37,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,072 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16253#true} {16253#true} #738#return; {16253#true} is VALID [2022-02-20 19:59:37,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {16253#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16253#true} is VALID [2022-02-20 19:59:37,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {16253#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {16253#true} is VALID [2022-02-20 19:59:37,073 INFO L272 TraceCheckUtils]: 28: Hoare triple {16253#true} call #t~ret9 := is_do_read_c_triggered(); {16253#true} is VALID [2022-02-20 19:59:37,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {16253#true} havoc ~__retres1~1; {16253#true} is VALID [2022-02-20 19:59:37,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {16253#true} assume 1 == ~c_dr_pc~0; {16253#true} is VALID [2022-02-20 19:59:37,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {16253#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16253#true} is VALID [2022-02-20 19:59:37,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {16253#true} #res := ~__retres1~1; {16253#true} is VALID [2022-02-20 19:59:37,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,074 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16253#true} {16253#true} #740#return; {16253#true} is VALID [2022-02-20 19:59:37,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {16253#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16253#true} is VALID [2022-02-20 19:59:37,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {16253#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16253#true} is VALID [2022-02-20 19:59:37,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,074 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16253#true} {16254#false} #746#return; {16254#false} is VALID [2022-02-20 19:59:37,074 INFO L272 TraceCheckUtils]: 39: Hoare triple {16254#false} call reset_delta_events1(); {16295#(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:37,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {16295#(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; {16253#true} is VALID [2022-02-20 19:59:37,075 INFO L290 TraceCheckUtils]: 41: Hoare triple {16253#true} assume !(1 == ~q_write_ev~0); {16253#true} is VALID [2022-02-20 19:59:37,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,075 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16253#true} {16254#false} #748#return; {16254#false} is VALID [2022-02-20 19:59:37,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {16254#false} assume !false; {16254#false} is VALID [2022-02-20 19:59:37,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {16254#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; {16254#false} is VALID [2022-02-20 19:59:37,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {16254#false} assume !false; {16254#false} is VALID [2022-02-20 19:59:37,076 INFO L272 TraceCheckUtils]: 47: Hoare triple {16254#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {16253#true} is VALID [2022-02-20 19:59:37,076 INFO L290 TraceCheckUtils]: 48: Hoare triple {16253#true} havoc ~__retres1~2; {16253#true} is VALID [2022-02-20 19:59:37,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {16253#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16253#true} is VALID [2022-02-20 19:59:37,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {16253#true} #res := ~__retres1~2; {16253#true} is VALID [2022-02-20 19:59:37,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {16253#true} assume true; {16253#true} is VALID [2022-02-20 19:59:37,076 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16253#true} {16254#false} #750#return; {16254#false} is VALID [2022-02-20 19:59:37,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {16254#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; {16254#false} is VALID [2022-02-20 19:59:37,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {16254#false} assume 0 != eval1_~tmp___1~0#1; {16254#false} is VALID [2022-02-20 19:59:37,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {16254#false} assume !(0 == ~p_dw_st~0); {16254#false} is VALID [2022-02-20 19:59:37,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {16254#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; {16254#false} is VALID [2022-02-20 19:59:37,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {16254#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; {16254#false} is VALID [2022-02-20 19:59:37,079 INFO L290 TraceCheckUtils]: 58: Hoare triple {16254#false} assume !(0 == ~c_dr_pc~0); {16254#false} is VALID [2022-02-20 19:59:37,079 INFO L290 TraceCheckUtils]: 59: Hoare triple {16254#false} assume 2 == ~c_dr_pc~0; {16254#false} is VALID [2022-02-20 19:59:37,079 INFO L290 TraceCheckUtils]: 60: Hoare triple {16254#false} do_read_c_~a~0#1 := ~a_t~0; {16254#false} is VALID [2022-02-20 19:59:37,079 INFO L290 TraceCheckUtils]: 61: Hoare triple {16254#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; {16254#false} is VALID [2022-02-20 19:59:37,079 INFO L290 TraceCheckUtils]: 62: Hoare triple {16254#false} assume !(~p_last_write~0 == ~c_last_read~0); {16254#false} is VALID [2022-02-20 19:59:37,079 INFO L272 TraceCheckUtils]: 63: Hoare triple {16254#false} call error1(); {16254#false} is VALID [2022-02-20 19:59:37,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {16254#false} assume !false; {16254#false} is VALID [2022-02-20 19:59:37,080 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:37,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:37,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665007689] [2022-02-20 19:59:37,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665007689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:37,081 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:37,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:37,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062470423] [2022-02-20 19:59:37,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:37,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 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:37,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:37,082 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), 5 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:37,123 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:37,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:37,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:37,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:37,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:37,125 INFO L87 Difference]: Start difference. First operand 1123 states and 1569 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 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:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:39,760 INFO L93 Difference]: Finished difference Result 1378 states and 1939 transitions. [2022-02-20 19:59:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:39,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 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:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 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:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 683 transitions. [2022-02-20 19:59:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 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:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 683 transitions. [2022-02-20 19:59:39,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 683 transitions. [2022-02-20 19:59:40,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:40,455 INFO L225 Difference]: With dead ends: 1378 [2022-02-20 19:59:40,455 INFO L226 Difference]: Without dead ends: 1274 [2022-02-20 19:59:40,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:40,458 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 467 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:40,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 1046 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:40,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2022-02-20 19:59:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1235. [2022-02-20 19:59:41,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:41,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1274 states. Second operand has 1235 states, 984 states have (on average 1.3892276422764227) internal successors, (1367), 1008 states have internal predecessors, (1367), 153 states have call successors, (153), 88 states have call predecessors, (153), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2022-02-20 19:59:41,091 INFO L74 IsIncluded]: Start isIncluded. First operand 1274 states. Second operand has 1235 states, 984 states have (on average 1.3892276422764227) internal successors, (1367), 1008 states have internal predecessors, (1367), 153 states have call successors, (153), 88 states have call predecessors, (153), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2022-02-20 19:59:41,102 INFO L87 Difference]: Start difference. First operand 1274 states. Second operand has 1235 states, 984 states have (on average 1.3892276422764227) internal successors, (1367), 1008 states have internal predecessors, (1367), 153 states have call successors, (153), 88 states have call predecessors, (153), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2022-02-20 19:59:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:41,186 INFO L93 Difference]: Finished difference Result 1274 states and 1783 transitions. [2022-02-20 19:59:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1783 transitions. [2022-02-20 19:59:41,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:41,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:41,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 1235 states, 984 states have (on average 1.3892276422764227) internal successors, (1367), 1008 states have internal predecessors, (1367), 153 states have call successors, (153), 88 states have call predecessors, (153), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) Second operand 1274 states. [2022-02-20 19:59:41,196 INFO L87 Difference]: Start difference. First operand has 1235 states, 984 states have (on average 1.3892276422764227) internal successors, (1367), 1008 states have internal predecessors, (1367), 153 states have call successors, (153), 88 states have call predecessors, (153), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) Second operand 1274 states. [2022-02-20 19:59:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:41,273 INFO L93 Difference]: Finished difference Result 1274 states and 1783 transitions. [2022-02-20 19:59:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1783 transitions. [2022-02-20 19:59:41,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:41,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:41,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:41,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 984 states have (on average 1.3892276422764227) internal successors, (1367), 1008 states have internal predecessors, (1367), 153 states have call successors, (153), 88 states have call predecessors, (153), 96 states have return successors, (207), 142 states have call predecessors, (207), 149 states have call successors, (207) [2022-02-20 19:59:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1727 transitions. [2022-02-20 19:59:41,375 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1727 transitions. Word has length 65 [2022-02-20 19:59:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:41,376 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 1727 transitions. [2022-02-20 19:59:41,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 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:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1727 transitions. [2022-02-20 19:59:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:41,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:41,377 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:41,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:41,378 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:41,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1752716098, now seen corresponding path program 1 times [2022-02-20 19:59:41,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:41,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538863306] [2022-02-20 19:59:41,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:41,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {22474#(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); {22475#(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:41,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {22475#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22475#(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:41,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22475#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22436#(= ~q_write_ev~0 ~q_read_ev~0)} #742#return; {22436#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {22475#(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); {22476#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:41,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {22476#(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; {22477#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:41,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {22477#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22477#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:41,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22477#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22436#(= ~q_write_ev~0 ~q_read_ev~0)} #744#return; {22435#false} is VALID [2022-02-20 19:59:41,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {22434#true} havoc ~__retres1~0; {22434#true} is VALID [2022-02-20 19:59:41,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {22434#true} assume 1 == ~p_dw_pc~0; {22434#true} is VALID [2022-02-20 19:59:41,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {22434#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {22434#true} is VALID [2022-02-20 19:59:41,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {22434#true} #res := ~__retres1~0; {22434#true} is VALID [2022-02-20 19:59:41,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,478 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22434#true} {22434#true} #738#return; {22434#true} is VALID [2022-02-20 19:59:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {22434#true} havoc ~__retres1~1; {22434#true} is VALID [2022-02-20 19:59:41,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {22434#true} assume 1 == ~c_dr_pc~0; {22434#true} is VALID [2022-02-20 19:59:41,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {22434#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {22434#true} is VALID [2022-02-20 19:59:41,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {22434#true} #res := ~__retres1~1; {22434#true} is VALID [2022-02-20 19:59:41,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,482 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22434#true} {22434#true} #740#return; {22434#true} is VALID [2022-02-20 19:59:41,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {22478#(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; {22434#true} is VALID [2022-02-20 19:59:41,483 INFO L272 TraceCheckUtils]: 1: Hoare triple {22434#true} call #t~ret8 := is_do_write_p_triggered(); {22434#true} is VALID [2022-02-20 19:59:41,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {22434#true} havoc ~__retres1~0; {22434#true} is VALID [2022-02-20 19:59:41,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {22434#true} assume 1 == ~p_dw_pc~0; {22434#true} is VALID [2022-02-20 19:59:41,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {22434#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {22434#true} is VALID [2022-02-20 19:59:41,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {22434#true} #res := ~__retres1~0; {22434#true} is VALID [2022-02-20 19:59:41,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,484 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22434#true} {22434#true} #738#return; {22434#true} is VALID [2022-02-20 19:59:41,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {22434#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22434#true} is VALID [2022-02-20 19:59:41,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {22434#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {22434#true} is VALID [2022-02-20 19:59:41,484 INFO L272 TraceCheckUtils]: 10: Hoare triple {22434#true} call #t~ret9 := is_do_read_c_triggered(); {22434#true} is VALID [2022-02-20 19:59:41,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {22434#true} havoc ~__retres1~1; {22434#true} is VALID [2022-02-20 19:59:41,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {22434#true} assume 1 == ~c_dr_pc~0; {22434#true} is VALID [2022-02-20 19:59:41,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {22434#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {22434#true} is VALID [2022-02-20 19:59:41,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {22434#true} #res := ~__retres1~1; {22434#true} is VALID [2022-02-20 19:59:41,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,485 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22434#true} {22434#true} #740#return; {22434#true} is VALID [2022-02-20 19:59:41,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {22434#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22434#true} is VALID [2022-02-20 19:59:41,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {22434#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {22434#true} is VALID [2022-02-20 19:59:41,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,486 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22434#true} {22435#false} #746#return; {22435#false} is VALID [2022-02-20 19:59:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {22475#(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); {22434#true} is VALID [2022-02-20 19:59:41,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {22434#true} assume !(1 == ~q_write_ev~0); {22434#true} is VALID [2022-02-20 19:59:41,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22434#true} {22435#false} #748#return; {22435#false} is VALID [2022-02-20 19:59:41,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:41,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {22434#true} havoc ~__retres1~2; {22434#true} is VALID [2022-02-20 19:59:41,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {22434#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22434#true} is VALID [2022-02-20 19:59:41,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {22434#true} #res := ~__retres1~2; {22434#true} is VALID [2022-02-20 19:59:41,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,497 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22434#true} {22435#false} #750#return; {22435#false} is VALID [2022-02-20 19:59:41,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {22434#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {22434#true} is VALID [2022-02-20 19:59:41,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {22434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {22434#true} is VALID [2022-02-20 19:59:41,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {22434#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {22436#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:41,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {22436#(= ~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; {22436#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:41,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {22436#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {22474#(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:41,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {22474#(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); {22475#(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:41,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {22475#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {22475#(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:41,501 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22475#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {22436#(= ~q_write_ev~0 ~q_read_ev~0)} #742#return; {22436#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:41,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {22436#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {22436#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:41,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {22436#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22436#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:41,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {22436#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22436#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:41,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {22436#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {22436#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:41,503 INFO L272 TraceCheckUtils]: 12: Hoare triple {22436#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {22475#(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:41,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {22475#(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); {22476#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:41,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {22476#(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; {22477#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:41,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {22477#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {22477#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:41,505 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22477#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {22436#(= ~q_write_ev~0 ~q_read_ev~0)} #744#return; {22435#false} is VALID [2022-02-20 19:59:41,505 INFO L272 TraceCheckUtils]: 17: Hoare triple {22435#false} call activate_threads1(); {22478#(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:41,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {22478#(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; {22434#true} is VALID [2022-02-20 19:59:41,505 INFO L272 TraceCheckUtils]: 19: Hoare triple {22434#true} call #t~ret8 := is_do_write_p_triggered(); {22434#true} is VALID [2022-02-20 19:59:41,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {22434#true} havoc ~__retres1~0; {22434#true} is VALID [2022-02-20 19:59:41,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {22434#true} assume 1 == ~p_dw_pc~0; {22434#true} is VALID [2022-02-20 19:59:41,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {22434#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {22434#true} is VALID [2022-02-20 19:59:41,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {22434#true} #res := ~__retres1~0; {22434#true} is VALID [2022-02-20 19:59:41,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,506 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22434#true} {22434#true} #738#return; {22434#true} is VALID [2022-02-20 19:59:41,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {22434#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22434#true} is VALID [2022-02-20 19:59:41,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {22434#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {22434#true} is VALID [2022-02-20 19:59:41,507 INFO L272 TraceCheckUtils]: 28: Hoare triple {22434#true} call #t~ret9 := is_do_read_c_triggered(); {22434#true} is VALID [2022-02-20 19:59:41,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {22434#true} havoc ~__retres1~1; {22434#true} is VALID [2022-02-20 19:59:41,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {22434#true} assume 1 == ~c_dr_pc~0; {22434#true} is VALID [2022-02-20 19:59:41,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {22434#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {22434#true} is VALID [2022-02-20 19:59:41,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {22434#true} #res := ~__retres1~1; {22434#true} is VALID [2022-02-20 19:59:41,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,508 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22434#true} {22434#true} #740#return; {22434#true} is VALID [2022-02-20 19:59:41,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {22434#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22434#true} is VALID [2022-02-20 19:59:41,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {22434#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {22434#true} is VALID [2022-02-20 19:59:41,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,508 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22434#true} {22435#false} #746#return; {22435#false} is VALID [2022-02-20 19:59:41,508 INFO L272 TraceCheckUtils]: 39: Hoare triple {22435#false} call reset_delta_events1(); {22475#(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:41,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {22475#(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); {22434#true} is VALID [2022-02-20 19:59:41,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {22434#true} assume !(1 == ~q_write_ev~0); {22434#true} is VALID [2022-02-20 19:59:41,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,509 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22434#true} {22435#false} #748#return; {22435#false} is VALID [2022-02-20 19:59:41,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {22435#false} assume !false; {22435#false} is VALID [2022-02-20 19:59:41,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {22435#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; {22435#false} is VALID [2022-02-20 19:59:41,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {22435#false} assume !false; {22435#false} is VALID [2022-02-20 19:59:41,510 INFO L272 TraceCheckUtils]: 47: Hoare triple {22435#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22434#true} is VALID [2022-02-20 19:59:41,510 INFO L290 TraceCheckUtils]: 48: Hoare triple {22434#true} havoc ~__retres1~2; {22434#true} is VALID [2022-02-20 19:59:41,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {22434#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22434#true} is VALID [2022-02-20 19:59:41,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {22434#true} #res := ~__retres1~2; {22434#true} is VALID [2022-02-20 19:59:41,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {22434#true} assume true; {22434#true} is VALID [2022-02-20 19:59:41,510 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22434#true} {22435#false} #750#return; {22435#false} is VALID [2022-02-20 19:59:41,511 INFO L290 TraceCheckUtils]: 53: Hoare triple {22435#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; {22435#false} is VALID [2022-02-20 19:59:41,511 INFO L290 TraceCheckUtils]: 54: Hoare triple {22435#false} assume 0 != eval1_~tmp___1~0#1; {22435#false} is VALID [2022-02-20 19:59:41,511 INFO L290 TraceCheckUtils]: 55: Hoare triple {22435#false} assume !(0 == ~p_dw_st~0); {22435#false} is VALID [2022-02-20 19:59:41,511 INFO L290 TraceCheckUtils]: 56: Hoare triple {22435#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; {22435#false} is VALID [2022-02-20 19:59:41,511 INFO L290 TraceCheckUtils]: 57: Hoare triple {22435#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; {22435#false} is VALID [2022-02-20 19:59:41,511 INFO L290 TraceCheckUtils]: 58: Hoare triple {22435#false} assume !(0 == ~c_dr_pc~0); {22435#false} is VALID [2022-02-20 19:59:41,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {22435#false} assume 2 == ~c_dr_pc~0; {22435#false} is VALID [2022-02-20 19:59:41,512 INFO L290 TraceCheckUtils]: 60: Hoare triple {22435#false} do_read_c_~a~0#1 := ~a_t~0; {22435#false} is VALID [2022-02-20 19:59:41,512 INFO L290 TraceCheckUtils]: 61: Hoare triple {22435#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; {22435#false} is VALID [2022-02-20 19:59:41,512 INFO L290 TraceCheckUtils]: 62: Hoare triple {22435#false} assume !(~p_last_write~0 == ~c_last_read~0); {22435#false} is VALID [2022-02-20 19:59:41,512 INFO L272 TraceCheckUtils]: 63: Hoare triple {22435#false} call error1(); {22435#false} is VALID [2022-02-20 19:59:41,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {22435#false} assume !false; {22435#false} is VALID [2022-02-20 19:59:41,513 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:41,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:41,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538863306] [2022-02-20 19:59:41,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538863306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:41,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:41,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:41,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320011225] [2022-02-20 19:59:41,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:41,515 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:41,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:41,515 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:41,561 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:41,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:41,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:41,563 INFO L87 Difference]: Start difference. First operand 1235 states and 1727 transitions. 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:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:44,513 INFO L93 Difference]: Finished difference Result 1632 states and 2293 transitions. [2022-02-20 19:59:44,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:44,513 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:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:44,513 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:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 713 transitions. [2022-02-20 19:59:44,520 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:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 713 transitions. [2022-02-20 19:59:44,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 713 transitions. [2022-02-20 19:59:45,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 713 edges. 713 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:45,168 INFO L225 Difference]: With dead ends: 1632 [2022-02-20 19:59:45,168 INFO L226 Difference]: Without dead ends: 1423 [2022-02-20 19:59:45,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:45,171 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 762 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:45,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 1065 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2022-02-20 19:59:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1347. [2022-02-20 19:59:45,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:45,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1423 states. Second operand has 1347 states, 1074 states have (on average 1.3901303538175047) internal successors, (1493), 1100 states have internal predecessors, (1493), 166 states have call successors, (166), 95 states have call predecessors, (166), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2022-02-20 19:59:45,757 INFO L74 IsIncluded]: Start isIncluded. First operand 1423 states. Second operand has 1347 states, 1074 states have (on average 1.3901303538175047) internal successors, (1493), 1100 states have internal predecessors, (1493), 166 states have call successors, (166), 95 states have call predecessors, (166), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2022-02-20 19:59:45,760 INFO L87 Difference]: Start difference. First operand 1423 states. Second operand has 1347 states, 1074 states have (on average 1.3901303538175047) internal successors, (1493), 1100 states have internal predecessors, (1493), 166 states have call successors, (166), 95 states have call predecessors, (166), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2022-02-20 19:59:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,855 INFO L93 Difference]: Finished difference Result 1423 states and 2001 transitions. [2022-02-20 19:59:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2001 transitions. [2022-02-20 19:59:45,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:45,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:45,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 1347 states, 1074 states have (on average 1.3901303538175047) internal successors, (1493), 1100 states have internal predecessors, (1493), 166 states have call successors, (166), 95 states have call predecessors, (166), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) Second operand 1423 states. [2022-02-20 19:59:45,865 INFO L87 Difference]: Start difference. First operand has 1347 states, 1074 states have (on average 1.3901303538175047) internal successors, (1493), 1100 states have internal predecessors, (1493), 166 states have call successors, (166), 95 states have call predecessors, (166), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) Second operand 1423 states. [2022-02-20 19:59:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:45,956 INFO L93 Difference]: Finished difference Result 1423 states and 2001 transitions. [2022-02-20 19:59:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2001 transitions. [2022-02-20 19:59:45,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:45,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:45,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:45,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1074 states have (on average 1.3901303538175047) internal successors, (1493), 1100 states have internal predecessors, (1493), 166 states have call successors, (166), 95 states have call predecessors, (166), 105 states have return successors, (228), 156 states have call predecessors, (228), 162 states have call successors, (228) [2022-02-20 19:59:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1887 transitions. [2022-02-20 19:59:46,071 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1887 transitions. Word has length 65 [2022-02-20 19:59:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:46,071 INFO L470 AbstractCegarLoop]: Abstraction has 1347 states and 1887 transitions. [2022-02-20 19:59:46,072 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:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1887 transitions. [2022-02-20 19:59:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:46,073 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:46,073 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:46,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:46,074 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash 513665088, now seen corresponding path program 1 times [2022-02-20 19:59:46,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:46,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257069486] [2022-02-20 19:59:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {29449#(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); {29450#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:46,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {29450#(not (= |old(~q_req_up~0)| 1))} assume true; {29450#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:46,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29450#(not (= |old(~q_req_up~0)| 1))} {29410#(= ~q_req_up~0 ~p_dw_pc~0)} #742#return; {29414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {29451#(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); {29407#true} is VALID [2022-02-20 19:59:46,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {29407#true} assume !(0 == ~q_write_ev~0); {29407#true} is VALID [2022-02-20 19:59:46,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-02-20 19:59:46,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29407#true} {29414#(not (= ~p_dw_pc~0 1))} #744#return; {29414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:46,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {29407#true} havoc ~__retres1~0; {29407#true} is VALID [2022-02-20 19:59:46,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {29407#true} assume 1 == ~p_dw_pc~0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,170 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} {29407#true} #738#return; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {29407#true} havoc ~__retres1~1; {29407#true} is VALID [2022-02-20 19:59:46,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {29407#true} assume 1 == ~c_dr_pc~0; {29407#true} is VALID [2022-02-20 19:59:46,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {29407#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {29407#true} is VALID [2022-02-20 19:59:46,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {29407#true} #res := ~__retres1~1; {29407#true} is VALID [2022-02-20 19:59:46,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-02-20 19:59:46,176 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29407#true} {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} #740#return; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {29452#(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; {29407#true} is VALID [2022-02-20 19:59:46,176 INFO L272 TraceCheckUtils]: 1: Hoare triple {29407#true} call #t~ret8 := is_do_write_p_triggered(); {29407#true} is VALID [2022-02-20 19:59:46,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {29407#true} havoc ~__retres1~0; {29407#true} is VALID [2022-02-20 19:59:46,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {29407#true} assume 1 == ~p_dw_pc~0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,179 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} {29407#true} #738#return; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,180 INFO L272 TraceCheckUtils]: 10: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {29407#true} is VALID [2022-02-20 19:59:46,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {29407#true} havoc ~__retres1~1; {29407#true} is VALID [2022-02-20 19:59:46,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {29407#true} assume 1 == ~c_dr_pc~0; {29407#true} is VALID [2022-02-20 19:59:46,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {29407#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {29407#true} is VALID [2022-02-20 19:59:46,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {29407#true} #res := ~__retres1~1; {29407#true} is VALID [2022-02-20 19:59:46,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-02-20 19:59:46,181 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29407#true} {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} #740#return; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,183 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} {29414#(not (= ~p_dw_pc~0 1))} #746#return; {29408#false} is VALID [2022-02-20 19:59:46,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {29451#(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); {29407#true} is VALID [2022-02-20 19:59:46,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {29407#true} assume !(1 == ~q_write_ev~0); {29407#true} is VALID [2022-02-20 19:59:46,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-02-20 19:59:46,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29407#true} {29408#false} #748#return; {29408#false} is VALID [2022-02-20 19:59:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:46,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {29407#true} havoc ~__retres1~2; {29407#true} is VALID [2022-02-20 19:59:46,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {29407#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29407#true} is VALID [2022-02-20 19:59:46,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {29407#true} #res := ~__retres1~2; {29407#true} is VALID [2022-02-20 19:59:46,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-02-20 19:59:46,191 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29407#true} {29408#false} #750#return; {29408#false} is VALID [2022-02-20 19:59:46,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {29407#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {29409#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:46,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {29409#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {29409#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:59:46,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {29409#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {29410#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:46,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {29410#(= ~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; {29410#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:59:46,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {29410#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {29449#(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:46,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {29449#(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); {29450#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:46,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {29450#(not (= |old(~q_req_up~0)| 1))} assume true; {29450#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:59:46,195 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29450#(not (= |old(~q_req_up~0)| 1))} {29410#(= ~q_req_up~0 ~p_dw_pc~0)} #742#return; {29414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:46,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {29414#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {29414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:46,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {29414#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {29414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:46,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {29414#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {29414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:46,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {29414#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {29414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:46,197 INFO L272 TraceCheckUtils]: 12: Hoare triple {29414#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {29451#(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:46,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {29451#(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); {29407#true} is VALID [2022-02-20 19:59:46,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {29407#true} assume !(0 == ~q_write_ev~0); {29407#true} is VALID [2022-02-20 19:59:46,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-02-20 19:59:46,197 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29407#true} {29414#(not (= ~p_dw_pc~0 1))} #744#return; {29414#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:59:46,198 INFO L272 TraceCheckUtils]: 17: Hoare triple {29414#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {29452#(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:46,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {29452#(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; {29407#true} is VALID [2022-02-20 19:59:46,198 INFO L272 TraceCheckUtils]: 19: Hoare triple {29407#true} call #t~ret8 := is_do_write_p_triggered(); {29407#true} is VALID [2022-02-20 19:59:46,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {29407#true} havoc ~__retres1~0; {29407#true} is VALID [2022-02-20 19:59:46,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {29407#true} assume 1 == ~p_dw_pc~0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,200 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} {29407#true} #738#return; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,200 INFO L272 TraceCheckUtils]: 28: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {29407#true} is VALID [2022-02-20 19:59:46,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {29407#true} havoc ~__retres1~1; {29407#true} is VALID [2022-02-20 19:59:46,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {29407#true} assume 1 == ~c_dr_pc~0; {29407#true} is VALID [2022-02-20 19:59:46,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {29407#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {29407#true} is VALID [2022-02-20 19:59:46,201 INFO L290 TraceCheckUtils]: 32: Hoare triple {29407#true} #res := ~__retres1~1; {29407#true} is VALID [2022-02-20 19:59:46,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-02-20 19:59:46,201 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29407#true} {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} #740#return; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:59:46,202 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29459#(= (+ (- 1) ~p_dw_pc~0) 0)} {29414#(not (= ~p_dw_pc~0 1))} #746#return; {29408#false} is VALID [2022-02-20 19:59:46,203 INFO L272 TraceCheckUtils]: 39: Hoare triple {29408#false} call reset_delta_events1(); {29451#(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:46,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {29451#(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); {29407#true} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {29407#true} assume !(1 == ~q_write_ev~0); {29407#true} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-02-20 19:59:46,203 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29407#true} {29408#false} #748#return; {29408#false} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {29408#false} assume !false; {29408#false} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {29408#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; {29408#false} is VALID [2022-02-20 19:59:46,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {29408#false} assume !false; {29408#false} is VALID [2022-02-20 19:59:46,203 INFO L272 TraceCheckUtils]: 47: Hoare triple {29408#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {29407#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {29407#true} havoc ~__retres1~2; {29407#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {29407#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29407#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {29407#true} #res := ~__retres1~2; {29407#true} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {29407#true} assume true; {29407#true} is VALID [2022-02-20 19:59:46,204 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29407#true} {29408#false} #750#return; {29408#false} is VALID [2022-02-20 19:59:46,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {29408#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; {29408#false} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {29408#false} assume 0 != eval1_~tmp___1~0#1; {29408#false} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {29408#false} assume !(0 == ~p_dw_st~0); {29408#false} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 56: Hoare triple {29408#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; {29408#false} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {29408#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; {29408#false} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {29408#false} assume !(0 == ~c_dr_pc~0); {29408#false} is VALID [2022-02-20 19:59:46,205 INFO L290 TraceCheckUtils]: 59: Hoare triple {29408#false} assume 2 == ~c_dr_pc~0; {29408#false} is VALID [2022-02-20 19:59:46,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {29408#false} do_read_c_~a~0#1 := ~a_t~0; {29408#false} is VALID [2022-02-20 19:59:46,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {29408#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; {29408#false} is VALID [2022-02-20 19:59:46,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {29408#false} assume !(~p_last_write~0 == ~c_last_read~0); {29408#false} is VALID [2022-02-20 19:59:46,206 INFO L272 TraceCheckUtils]: 63: Hoare triple {29408#false} call error1(); {29408#false} is VALID [2022-02-20 19:59:46,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {29408#false} assume !false; {29408#false} is VALID [2022-02-20 19:59:46,207 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:46,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:46,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257069486] [2022-02-20 19:59:46,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257069486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:46,207 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:46,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:59:46,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212791516] [2022-02-20 19:59:46,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:46,208 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:46,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:46,209 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:46,249 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:46,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:46,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:46,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:46,250 INFO L87 Difference]: Start difference. First operand 1347 states and 1887 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:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:52,014 INFO L93 Difference]: Finished difference Result 2893 states and 4085 transitions. [2022-02-20 19:59:52,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:59:52,015 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:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:52,015 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:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1118 transitions. [2022-02-20 19:59:52,024 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:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1118 transitions. [2022-02-20 19:59:52,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1118 transitions. [2022-02-20 19:59:52,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1118 edges. 1118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:53,136 INFO L225 Difference]: With dead ends: 2893 [2022-02-20 19:59:53,137 INFO L226 Difference]: Without dead ends: 2560 [2022-02-20 19:59:53,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:59:53,140 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 2216 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2238 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:53,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2238 Valid, 1576 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:59:53,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2022-02-20 19:59:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2400. [2022-02-20 19:59:54,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:54,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2560 states. Second operand has 2400 states, 1922 states have (on average 1.3720083246618107) internal successors, (2637), 1963 states have internal predecessors, (2637), 276 states have call successors, (276), 178 states have call predecessors, (276), 200 states have return successors, (361), 262 states have call predecessors, (361), 272 states have call successors, (361) [2022-02-20 19:59:54,078 INFO L74 IsIncluded]: Start isIncluded. First operand 2560 states. Second operand has 2400 states, 1922 states have (on average 1.3720083246618107) internal successors, (2637), 1963 states have internal predecessors, (2637), 276 states have call successors, (276), 178 states have call predecessors, (276), 200 states have return successors, (361), 262 states have call predecessors, (361), 272 states have call successors, (361) [2022-02-20 19:59:54,084 INFO L87 Difference]: Start difference. First operand 2560 states. Second operand has 2400 states, 1922 states have (on average 1.3720083246618107) internal successors, (2637), 1963 states have internal predecessors, (2637), 276 states have call successors, (276), 178 states have call predecessors, (276), 200 states have return successors, (361), 262 states have call predecessors, (361), 272 states have call successors, (361) [2022-02-20 19:59:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:54,277 INFO L93 Difference]: Finished difference Result 2560 states and 3486 transitions. [2022-02-20 19:59:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3486 transitions. [2022-02-20 19:59:54,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:54,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:54,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 2400 states, 1922 states have (on average 1.3720083246618107) internal successors, (2637), 1963 states have internal predecessors, (2637), 276 states have call successors, (276), 178 states have call predecessors, (276), 200 states have return successors, (361), 262 states have call predecessors, (361), 272 states have call successors, (361) Second operand 2560 states. [2022-02-20 19:59:54,292 INFO L87 Difference]: Start difference. First operand has 2400 states, 1922 states have (on average 1.3720083246618107) internal successors, (2637), 1963 states have internal predecessors, (2637), 276 states have call successors, (276), 178 states have call predecessors, (276), 200 states have return successors, (361), 262 states have call predecessors, (361), 272 states have call successors, (361) Second operand 2560 states. [2022-02-20 19:59:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:54,487 INFO L93 Difference]: Finished difference Result 2560 states and 3486 transitions. [2022-02-20 19:59:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3486 transitions. [2022-02-20 19:59:54,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:54,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:54,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:54,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 1922 states have (on average 1.3720083246618107) internal successors, (2637), 1963 states have internal predecessors, (2637), 276 states have call successors, (276), 178 states have call predecessors, (276), 200 states have return successors, (361), 262 states have call predecessors, (361), 272 states have call successors, (361) [2022-02-20 19:59:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3274 transitions. [2022-02-20 19:59:54,806 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3274 transitions. Word has length 65 [2022-02-20 19:59:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:54,806 INFO L470 AbstractCegarLoop]: Abstraction has 2400 states and 3274 transitions. [2022-02-20 19:59:54,806 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:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3274 transitions. [2022-02-20 19:59:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:54,807 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:54,808 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:54,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:59:54,808 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:54,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2024207263, now seen corresponding path program 1 times [2022-02-20 19:59:54,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:54,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99351393] [2022-02-20 19:59:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:54,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {41863#(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); {41823#true} is VALID [2022-02-20 19:59:54,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41823#true} {41823#true} #742#return; {41823#true} is VALID [2022-02-20 19:59:54,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {41864#(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); {41823#true} is VALID [2022-02-20 19:59:54,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {41823#true} assume !(0 == ~q_write_ev~0); {41823#true} is VALID [2022-02-20 19:59:54,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41823#true} {41823#true} #744#return; {41823#true} is VALID [2022-02-20 19:59:54,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {41823#true} havoc ~__retres1~0; {41823#true} is VALID [2022-02-20 19:59:54,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {41823#true} assume !(1 == ~p_dw_pc~0); {41823#true} is VALID [2022-02-20 19:59:54,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {41823#true} assume !(2 == ~p_dw_pc~0); {41823#true} is VALID [2022-02-20 19:59:54,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {41823#true} ~__retres1~0 := 0; {41881#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:54,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {41881#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,933 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {41823#true} #738#return; {41873#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 19:59:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {41823#true} havoc ~__retres1~1; {41823#true} is VALID [2022-02-20 19:59:54,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {41823#true} assume 1 == ~c_dr_pc~0; {41823#true} is VALID [2022-02-20 19:59:54,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {41823#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {41823#true} is VALID [2022-02-20 19:59:54,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {41823#true} #res := ~__retres1~1; {41823#true} is VALID [2022-02-20 19:59:54,937 INFO L290 TraceCheckUtils]: 4: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,938 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {41823#true} {41824#false} #740#return; {41824#false} is VALID [2022-02-20 19:59:54,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {41865#(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; {41823#true} is VALID [2022-02-20 19:59:54,938 INFO L272 TraceCheckUtils]: 1: Hoare triple {41823#true} call #t~ret8 := is_do_write_p_triggered(); {41823#true} is VALID [2022-02-20 19:59:54,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {41823#true} havoc ~__retres1~0; {41823#true} is VALID [2022-02-20 19:59:54,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {41823#true} assume !(1 == ~p_dw_pc~0); {41823#true} is VALID [2022-02-20 19:59:54,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {41823#true} assume !(2 == ~p_dw_pc~0); {41823#true} is VALID [2022-02-20 19:59:54,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {41823#true} ~__retres1~0 := 0; {41881#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:54,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {41881#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,940 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {41823#true} #738#return; {41873#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:54,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {41873#(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; {41874#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:54,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {41874#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {41824#false} is VALID [2022-02-20 19:59:54,941 INFO L272 TraceCheckUtils]: 11: Hoare triple {41824#false} call #t~ret9 := is_do_read_c_triggered(); {41823#true} is VALID [2022-02-20 19:59:54,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {41823#true} havoc ~__retres1~1; {41823#true} is VALID [2022-02-20 19:59:54,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {41823#true} assume 1 == ~c_dr_pc~0; {41823#true} is VALID [2022-02-20 19:59:54,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {41823#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {41823#true} is VALID [2022-02-20 19:59:54,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {41823#true} #res := ~__retres1~1; {41823#true} is VALID [2022-02-20 19:59:54,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,942 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {41823#true} {41824#false} #740#return; {41824#false} is VALID [2022-02-20 19:59:54,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {41824#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {41824#false} is VALID [2022-02-20 19:59:54,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {41824#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {41824#false} is VALID [2022-02-20 19:59:54,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {41824#false} assume true; {41824#false} is VALID [2022-02-20 19:59:54,943 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41824#false} {41823#true} #746#return; {41824#false} is VALID [2022-02-20 19:59:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:59:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {41864#(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); {41823#true} is VALID [2022-02-20 19:59:54,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {41823#true} assume !(1 == ~q_write_ev~0); {41823#true} is VALID [2022-02-20 19:59:54,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41823#true} {41824#false} #748#return; {41824#false} is VALID [2022-02-20 19:59:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 19:59:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:54,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {41823#true} havoc ~__retres1~2; {41823#true} is VALID [2022-02-20 19:59:54,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {41823#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41823#true} is VALID [2022-02-20 19:59:54,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {41823#true} #res := ~__retres1~2; {41823#true} is VALID [2022-02-20 19:59:54,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,955 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41823#true} {41824#false} #750#return; {41824#false} is VALID [2022-02-20 19:59:54,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {41823#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {41823#true} is VALID [2022-02-20 19:59:54,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {41823#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {41823#true} is VALID [2022-02-20 19:59:54,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {41823#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {41823#true} is VALID [2022-02-20 19:59:54,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {41823#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; {41823#true} is VALID [2022-02-20 19:59:54,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {41823#true} call update_channels1(); {41863#(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:54,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {41863#(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); {41823#true} is VALID [2022-02-20 19:59:54,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,957 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {41823#true} {41823#true} #742#return; {41823#true} is VALID [2022-02-20 19:59:54,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {41823#true} assume { :begin_inline_init_threads1 } true; {41823#true} is VALID [2022-02-20 19:59:54,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {41823#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {41823#true} is VALID [2022-02-20 19:59:54,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {41823#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {41823#true} is VALID [2022-02-20 19:59:54,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {41823#true} assume { :end_inline_init_threads1 } true; {41823#true} is VALID [2022-02-20 19:59:54,958 INFO L272 TraceCheckUtils]: 12: Hoare triple {41823#true} call fire_delta_events1(); {41864#(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:54,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {41864#(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); {41823#true} is VALID [2022-02-20 19:59:54,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {41823#true} assume !(0 == ~q_write_ev~0); {41823#true} is VALID [2022-02-20 19:59:54,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,958 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41823#true} {41823#true} #744#return; {41823#true} is VALID [2022-02-20 19:59:54,959 INFO L272 TraceCheckUtils]: 17: Hoare triple {41823#true} call activate_threads1(); {41865#(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:54,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {41865#(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; {41823#true} is VALID [2022-02-20 19:59:54,959 INFO L272 TraceCheckUtils]: 19: Hoare triple {41823#true} call #t~ret8 := is_do_write_p_triggered(); {41823#true} is VALID [2022-02-20 19:59:54,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {41823#true} havoc ~__retres1~0; {41823#true} is VALID [2022-02-20 19:59:54,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {41823#true} assume !(1 == ~p_dw_pc~0); {41823#true} is VALID [2022-02-20 19:59:54,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {41823#true} assume !(2 == ~p_dw_pc~0); {41823#true} is VALID [2022-02-20 19:59:54,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {41823#true} ~__retres1~0 := 0; {41881#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:54,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {41881#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:54,962 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41882#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {41823#true} #738#return; {41873#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:54,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {41873#(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; {41874#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:54,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {41874#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {41824#false} is VALID [2022-02-20 19:59:54,963 INFO L272 TraceCheckUtils]: 29: Hoare triple {41824#false} call #t~ret9 := is_do_read_c_triggered(); {41823#true} is VALID [2022-02-20 19:59:54,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {41823#true} havoc ~__retres1~1; {41823#true} is VALID [2022-02-20 19:59:54,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {41823#true} assume 1 == ~c_dr_pc~0; {41823#true} is VALID [2022-02-20 19:59:54,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {41823#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {41823#true} is VALID [2022-02-20 19:59:54,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {41823#true} #res := ~__retres1~1; {41823#true} is VALID [2022-02-20 19:59:54,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,964 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {41823#true} {41824#false} #740#return; {41824#false} is VALID [2022-02-20 19:59:54,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {41824#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {41824#false} is VALID [2022-02-20 19:59:54,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {41824#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {41824#false} is VALID [2022-02-20 19:59:54,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {41824#false} assume true; {41824#false} is VALID [2022-02-20 19:59:54,964 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {41824#false} {41823#true} #746#return; {41824#false} is VALID [2022-02-20 19:59:54,964 INFO L272 TraceCheckUtils]: 40: Hoare triple {41824#false} call reset_delta_events1(); {41864#(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:54,965 INFO L290 TraceCheckUtils]: 41: Hoare triple {41864#(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); {41823#true} is VALID [2022-02-20 19:59:54,965 INFO L290 TraceCheckUtils]: 42: Hoare triple {41823#true} assume !(1 == ~q_write_ev~0); {41823#true} is VALID [2022-02-20 19:59:54,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,965 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {41823#true} {41824#false} #748#return; {41824#false} is VALID [2022-02-20 19:59:54,965 INFO L290 TraceCheckUtils]: 45: Hoare triple {41824#false} assume !false; {41824#false} is VALID [2022-02-20 19:59:54,965 INFO L290 TraceCheckUtils]: 46: Hoare triple {41824#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; {41824#false} is VALID [2022-02-20 19:59:54,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {41824#false} assume !false; {41824#false} is VALID [2022-02-20 19:59:54,966 INFO L272 TraceCheckUtils]: 48: Hoare triple {41824#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {41823#true} is VALID [2022-02-20 19:59:54,966 INFO L290 TraceCheckUtils]: 49: Hoare triple {41823#true} havoc ~__retres1~2; {41823#true} is VALID [2022-02-20 19:59:54,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {41823#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41823#true} is VALID [2022-02-20 19:59:54,966 INFO L290 TraceCheckUtils]: 51: Hoare triple {41823#true} #res := ~__retres1~2; {41823#true} is VALID [2022-02-20 19:59:54,966 INFO L290 TraceCheckUtils]: 52: Hoare triple {41823#true} assume true; {41823#true} is VALID [2022-02-20 19:59:54,966 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {41823#true} {41824#false} #750#return; {41824#false} is VALID [2022-02-20 19:59:54,966 INFO L290 TraceCheckUtils]: 54: Hoare triple {41824#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; {41824#false} is VALID [2022-02-20 19:59:54,967 INFO L290 TraceCheckUtils]: 55: Hoare triple {41824#false} assume 0 != eval1_~tmp___1~0#1; {41824#false} is VALID [2022-02-20 19:59:54,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {41824#false} assume !(0 == ~p_dw_st~0); {41824#false} is VALID [2022-02-20 19:59:54,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {41824#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; {41824#false} is VALID [2022-02-20 19:59:54,967 INFO L290 TraceCheckUtils]: 58: Hoare triple {41824#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; {41824#false} is VALID [2022-02-20 19:59:54,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {41824#false} assume !(0 == ~c_dr_pc~0); {41824#false} is VALID [2022-02-20 19:59:54,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {41824#false} assume 2 == ~c_dr_pc~0; {41824#false} is VALID [2022-02-20 19:59:54,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {41824#false} do_read_c_~a~0#1 := ~a_t~0; {41824#false} is VALID [2022-02-20 19:59:54,968 INFO L290 TraceCheckUtils]: 62: Hoare triple {41824#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; {41824#false} is VALID [2022-02-20 19:59:54,968 INFO L290 TraceCheckUtils]: 63: Hoare triple {41824#false} assume !(~p_last_write~0 == ~c_last_read~0); {41824#false} is VALID [2022-02-20 19:59:54,968 INFO L272 TraceCheckUtils]: 64: Hoare triple {41824#false} call error1(); {41824#false} is VALID [2022-02-20 19:59:54,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {41824#false} assume !false; {41824#false} is VALID [2022-02-20 19:59:54,968 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:54,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:54,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99351393] [2022-02-20 19:59:54,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99351393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:54,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:54,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:54,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724288862] [2022-02-20 19:59:54,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:54,970 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,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:54,971 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:55,017 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,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:55,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:55,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:55,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:55,019 INFO L87 Difference]: Start difference. First operand 2400 states and 3274 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:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:58,383 INFO L93 Difference]: Finished difference Result 3928 states and 5353 transitions. [2022-02-20 19:59:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:58,383 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:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:58,383 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:58,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 494 transitions. [2022-02-20 19:59:58,386 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:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 494 transitions. [2022-02-20 19:59:58,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 494 transitions. [2022-02-20 19:59:58,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:58,988 INFO L225 Difference]: With dead ends: 3928 [2022-02-20 19:59:58,988 INFO L226 Difference]: Without dead ends: 2548 [2022-02-20 19:59:58,991 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:58,992 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 227 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:58,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 1406 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2022-02-20 19:59:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2440. [2022-02-20 19:59:59,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:59,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2548 states. Second operand has 2440 states, 1954 states have (on average 1.3628454452405323) internal successors, (2663), 1995 states have internal predecessors, (2663), 276 states have call successors, (276), 178 states have call predecessors, (276), 208 states have return successors, (369), 270 states have call predecessors, (369), 272 states have call successors, (369) [2022-02-20 19:59:59,966 INFO L74 IsIncluded]: Start isIncluded. First operand 2548 states. Second operand has 2440 states, 1954 states have (on average 1.3628454452405323) internal successors, (2663), 1995 states have internal predecessors, (2663), 276 states have call successors, (276), 178 states have call predecessors, (276), 208 states have return successors, (369), 270 states have call predecessors, (369), 272 states have call successors, (369) [2022-02-20 19:59:59,971 INFO L87 Difference]: Start difference. First operand 2548 states. Second operand has 2440 states, 1954 states have (on average 1.3628454452405323) internal successors, (2663), 1995 states have internal predecessors, (2663), 276 states have call successors, (276), 178 states have call predecessors, (276), 208 states have return successors, (369), 270 states have call predecessors, (369), 272 states have call successors, (369) [2022-02-20 20:00:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,161 INFO L93 Difference]: Finished difference Result 2548 states and 3462 transitions. [2022-02-20 20:00:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3462 transitions. [2022-02-20 20:00:00,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:00,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:00,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 2440 states, 1954 states have (on average 1.3628454452405323) internal successors, (2663), 1995 states have internal predecessors, (2663), 276 states have call successors, (276), 178 states have call predecessors, (276), 208 states have return successors, (369), 270 states have call predecessors, (369), 272 states have call successors, (369) Second operand 2548 states. [2022-02-20 20:00:00,176 INFO L87 Difference]: Start difference. First operand has 2440 states, 1954 states have (on average 1.3628454452405323) internal successors, (2663), 1995 states have internal predecessors, (2663), 276 states have call successors, (276), 178 states have call predecessors, (276), 208 states have return successors, (369), 270 states have call predecessors, (369), 272 states have call successors, (369) Second operand 2548 states. [2022-02-20 20:00:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:00,448 INFO L93 Difference]: Finished difference Result 2548 states and 3462 transitions. [2022-02-20 20:00:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3462 transitions. [2022-02-20 20:00:00,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:00,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:00,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:00,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 1954 states have (on average 1.3628454452405323) internal successors, (2663), 1995 states have internal predecessors, (2663), 276 states have call successors, (276), 178 states have call predecessors, (276), 208 states have return successors, (369), 270 states have call predecessors, (369), 272 states have call successors, (369) [2022-02-20 20:00:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3308 transitions. [2022-02-20 20:00:00,834 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3308 transitions. Word has length 66 [2022-02-20 20:00:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:00,834 INFO L470 AbstractCegarLoop]: Abstraction has 2440 states and 3308 transitions. [2022-02-20 20:00:00,835 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 20:00:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3308 transitions. [2022-02-20 20:00:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:00,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:00,836 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 20:00:00,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:00:00,836 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash 994847965, now seen corresponding path program 1 times [2022-02-20 20:00:00,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:00,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040346608] [2022-02-20 20:00:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {55633#(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); {55634#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:00,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {55634#(not (= |old(~q_req_up~0)| 1))} assume true; {55634#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:00,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55634#(not (= |old(~q_req_up~0)| 1))} {55593#(= ~c_dr_pc~0 ~q_req_up~0)} #742#return; {55597#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {55635#(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); {55590#true} is VALID [2022-02-20 20:00:00,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {55590#true} assume !(0 == ~q_write_ev~0); {55590#true} is VALID [2022-02-20 20:00:00,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {55590#true} assume true; {55590#true} is VALID [2022-02-20 20:00:00,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55590#true} {55597#(not (= ~c_dr_pc~0 1))} #744#return; {55597#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {55590#true} havoc ~__retres1~0; {55590#true} is VALID [2022-02-20 20:00:00,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {55590#true} assume !(1 == ~p_dw_pc~0); {55590#true} is VALID [2022-02-20 20:00:00,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {55590#true} assume !(2 == ~p_dw_pc~0); {55590#true} is VALID [2022-02-20 20:00:00,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {55590#true} ~__retres1~0 := 0; {55590#true} is VALID [2022-02-20 20:00:00,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {55590#true} #res := ~__retres1~0; {55590#true} is VALID [2022-02-20 20:00:00,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {55590#true} assume true; {55590#true} is VALID [2022-02-20 20:00:00,932 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {55590#true} {55590#true} #738#return; {55590#true} is VALID [2022-02-20 20:00:00,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {55590#true} havoc ~__retres1~1; {55590#true} is VALID [2022-02-20 20:00:00,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {55590#true} assume 1 == ~c_dr_pc~0; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,938 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} {55590#true} #740#return; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {55636#(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; {55590#true} is VALID [2022-02-20 20:00:00,939 INFO L272 TraceCheckUtils]: 1: Hoare triple {55590#true} call #t~ret8 := is_do_write_p_triggered(); {55590#true} is VALID [2022-02-20 20:00:00,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {55590#true} havoc ~__retres1~0; {55590#true} is VALID [2022-02-20 20:00:00,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {55590#true} assume !(1 == ~p_dw_pc~0); {55590#true} is VALID [2022-02-20 20:00:00,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {55590#true} assume !(2 == ~p_dw_pc~0); {55590#true} is VALID [2022-02-20 20:00:00,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {55590#true} ~__retres1~0 := 0; {55590#true} is VALID [2022-02-20 20:00:00,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {55590#true} #res := ~__retres1~0; {55590#true} is VALID [2022-02-20 20:00:00,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {55590#true} assume true; {55590#true} is VALID [2022-02-20 20:00:00,940 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {55590#true} {55590#true} #738#return; {55590#true} is VALID [2022-02-20 20:00:00,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {55590#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {55590#true} is VALID [2022-02-20 20:00:00,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {55590#true} assume !(0 != ~tmp~1); {55590#true} is VALID [2022-02-20 20:00:00,940 INFO L272 TraceCheckUtils]: 11: Hoare triple {55590#true} call #t~ret9 := is_do_read_c_triggered(); {55590#true} is VALID [2022-02-20 20:00:00,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {55590#true} havoc ~__retres1~1; {55590#true} is VALID [2022-02-20 20:00:00,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {55590#true} assume 1 == ~c_dr_pc~0; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,942 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} {55590#true} #740#return; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,944 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} {55597#(not (= ~c_dr_pc~0 1))} #746#return; {55591#false} is VALID [2022-02-20 20:00:00,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {55635#(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); {55590#true} is VALID [2022-02-20 20:00:00,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {55590#true} assume !(1 == ~q_write_ev~0); {55590#true} is VALID [2022-02-20 20:00:00,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {55590#true} assume true; {55590#true} is VALID [2022-02-20 20:00:00,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55590#true} {55591#false} #748#return; {55591#false} is VALID [2022-02-20 20:00:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:00,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {55590#true} havoc ~__retres1~2; {55590#true} is VALID [2022-02-20 20:00:00,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {55590#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55590#true} is VALID [2022-02-20 20:00:00,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {55590#true} #res := ~__retres1~2; {55590#true} is VALID [2022-02-20 20:00:00,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {55590#true} assume true; {55590#true} is VALID [2022-02-20 20:00:00,950 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {55590#true} {55591#false} #750#return; {55591#false} is VALID [2022-02-20 20:00:00,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {55590#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;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; {55592#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:00,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {55592#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {55592#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:00,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {55592#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#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; {55593#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:00,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {55593#(= ~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; {55593#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:00:00,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {55593#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {55633#(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:00,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {55633#(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); {55634#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:00,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {55634#(not (= |old(~q_req_up~0)| 1))} assume true; {55634#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:00,954 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {55634#(not (= |old(~q_req_up~0)| 1))} {55593#(= ~c_dr_pc~0 ~q_req_up~0)} #742#return; {55597#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {55597#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {55597#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {55597#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {55597#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {55597#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {55597#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {55597#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {55597#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,955 INFO L272 TraceCheckUtils]: 12: Hoare triple {55597#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {55635#(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:00,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {55635#(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); {55590#true} is VALID [2022-02-20 20:00:00,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {55590#true} assume !(0 == ~q_write_ev~0); {55590#true} is VALID [2022-02-20 20:00:00,956 INFO L290 TraceCheckUtils]: 15: Hoare triple {55590#true} assume true; {55590#true} is VALID [2022-02-20 20:00:00,956 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {55590#true} {55597#(not (= ~c_dr_pc~0 1))} #744#return; {55597#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:00:00,957 INFO L272 TraceCheckUtils]: 17: Hoare triple {55597#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {55636#(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:00,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {55636#(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; {55590#true} is VALID [2022-02-20 20:00:00,957 INFO L272 TraceCheckUtils]: 19: Hoare triple {55590#true} call #t~ret8 := is_do_write_p_triggered(); {55590#true} is VALID [2022-02-20 20:00:00,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {55590#true} havoc ~__retres1~0; {55590#true} is VALID [2022-02-20 20:00:00,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {55590#true} assume !(1 == ~p_dw_pc~0); {55590#true} is VALID [2022-02-20 20:00:00,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {55590#true} assume !(2 == ~p_dw_pc~0); {55590#true} is VALID [2022-02-20 20:00:00,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {55590#true} ~__retres1~0 := 0; {55590#true} is VALID [2022-02-20 20:00:00,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {55590#true} #res := ~__retres1~0; {55590#true} is VALID [2022-02-20 20:00:00,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {55590#true} assume true; {55590#true} is VALID [2022-02-20 20:00:00,958 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {55590#true} {55590#true} #738#return; {55590#true} is VALID [2022-02-20 20:00:00,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {55590#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {55590#true} is VALID [2022-02-20 20:00:00,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {55590#true} assume !(0 != ~tmp~1); {55590#true} is VALID [2022-02-20 20:00:00,958 INFO L272 TraceCheckUtils]: 29: Hoare triple {55590#true} call #t~ret9 := is_do_read_c_triggered(); {55590#true} is VALID [2022-02-20 20:00:00,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {55590#true} havoc ~__retres1~1; {55590#true} is VALID [2022-02-20 20:00:00,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {55590#true} assume 1 == ~c_dr_pc~0; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,960 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} {55590#true} #740#return; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:00:00,962 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {55650#(= (+ (- 1) ~c_dr_pc~0) 0)} {55597#(not (= ~c_dr_pc~0 1))} #746#return; {55591#false} is VALID [2022-02-20 20:00:00,962 INFO L272 TraceCheckUtils]: 40: Hoare triple {55591#false} call reset_delta_events1(); {55635#(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:00,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {55635#(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); {55590#true} is VALID [2022-02-20 20:00:00,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {55590#true} assume !(1 == ~q_write_ev~0); {55590#true} is VALID [2022-02-20 20:00:00,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {55590#true} assume true; {55590#true} is VALID [2022-02-20 20:00:00,963 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {55590#true} {55591#false} #748#return; {55591#false} is VALID [2022-02-20 20:00:00,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {55591#false} assume !false; {55591#false} is VALID [2022-02-20 20:00:00,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {55591#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; {55591#false} is VALID [2022-02-20 20:00:00,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {55591#false} assume !false; {55591#false} is VALID [2022-02-20 20:00:00,963 INFO L272 TraceCheckUtils]: 48: Hoare triple {55591#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {55590#true} is VALID [2022-02-20 20:00:00,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {55590#true} havoc ~__retres1~2; {55590#true} is VALID [2022-02-20 20:00:00,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {55590#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {55590#true} is VALID [2022-02-20 20:00:00,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {55590#true} #res := ~__retres1~2; {55590#true} is VALID [2022-02-20 20:00:00,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {55590#true} assume true; {55590#true} is VALID [2022-02-20 20:00:00,964 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {55590#true} {55591#false} #750#return; {55591#false} is VALID [2022-02-20 20:00:00,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {55591#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; {55591#false} is VALID [2022-02-20 20:00:00,964 INFO L290 TraceCheckUtils]: 55: Hoare triple {55591#false} assume 0 != eval1_~tmp___1~0#1; {55591#false} is VALID [2022-02-20 20:00:00,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {55591#false} assume !(0 == ~p_dw_st~0); {55591#false} is VALID [2022-02-20 20:00:00,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {55591#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; {55591#false} is VALID [2022-02-20 20:00:00,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {55591#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; {55591#false} is VALID [2022-02-20 20:00:00,965 INFO L290 TraceCheckUtils]: 59: Hoare triple {55591#false} assume !(0 == ~c_dr_pc~0); {55591#false} is VALID [2022-02-20 20:00:00,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {55591#false} assume 2 == ~c_dr_pc~0; {55591#false} is VALID [2022-02-20 20:00:00,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {55591#false} do_read_c_~a~0#1 := ~a_t~0; {55591#false} is VALID [2022-02-20 20:00:00,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {55591#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; {55591#false} is VALID [2022-02-20 20:00:00,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {55591#false} assume !(~p_last_write~0 == ~c_last_read~0); {55591#false} is VALID [2022-02-20 20:00:00,965 INFO L272 TraceCheckUtils]: 64: Hoare triple {55591#false} call error1(); {55591#false} is VALID [2022-02-20 20:00:00,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {55591#false} assume !false; {55591#false} is VALID [2022-02-20 20:00:00,966 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:00,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:00,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040346608] [2022-02-20 20:00:00,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040346608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:00,967 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:00,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:00,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293311445] [2022-02-20 20:00:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:00,968 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,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:00,968 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 20:00:01,016 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 20:00:01,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:01,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:01,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:01,017 INFO L87 Difference]: Start difference. First operand 2440 states and 3308 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:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:08,598 INFO L93 Difference]: Finished difference Result 6012 states and 8182 transitions. [2022-02-20 20:00:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:08,599 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:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:08,599 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:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1107 transitions. [2022-02-20 20:00:08,608 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:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1107 transitions. [2022-02-20 20:00:08,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1107 transitions. [2022-02-20 20:00:09,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1107 edges. 1107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:09,741 INFO L225 Difference]: With dead ends: 6012 [2022-02-20 20:00:09,741 INFO L226 Difference]: Without dead ends: 2831 [2022-02-20 20:00:09,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:09,748 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 2288 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:09,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2310 Valid, 1618 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 20:00:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states.