./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.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_2.cil-2+token_ring.10.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 a110ed0c6f4923a9ada85889b347db0ba056a7cf6869bb52e907ef3e34294094 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:11,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:11,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:11,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:11,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:11,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:11,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:11,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:11,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:11,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:11,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:11,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:11,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:11,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:11,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:11,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:11,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:11,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:11,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:11,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:11,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:11,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:11,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:11,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:11,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:11,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:11,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:11,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:11,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:11,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:11,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:11,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:11,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:11,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:11,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:11,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:11,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:11,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:11,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:11,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:11,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:11,756 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:11,770 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:11,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:11,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:11,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:11,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:11,773 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:11,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:11,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:11,774 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:11,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:11,774 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:11,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:59:11,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:11,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:11,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:11,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:11,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:11,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:11,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:11,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:11,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:11,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:11,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:11,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:11,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:11,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:11,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:11,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:11,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:59:11,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:59:11,779 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:11,779 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:11,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:11,779 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 -> a110ed0c6f4923a9ada85889b347db0ba056a7cf6869bb52e907ef3e34294094 [2022-02-20 19:59:11,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:11,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:11,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:11,978 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:11,978 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:11,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c [2022-02-20 19:59:12,030 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307fa9def/a7beb2dfb9c7498a86bf64f09d278a64/FLAGe9ea9039e [2022-02-20 19:59:12,369 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:12,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c [2022-02-20 19:59:12,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307fa9def/a7beb2dfb9c7498a86bf64f09d278a64/FLAGe9ea9039e [2022-02-20 19:59:12,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/307fa9def/a7beb2dfb9c7498a86bf64f09d278a64 [2022-02-20 19:59:12,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:12,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:12,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:12,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:12,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:12,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:12, skipping insertion in model container [2022-02-20 19:59:12,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:12" (1/1) ... [2022-02-20 19:59:12,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:12,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:12,908 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_2.cil-2+token_ring.10.cil-2.c[914,927] [2022-02-20 19:59:12,954 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_2.cil-2+token_ring.10.cil-2.c[7125,7138] [2022-02-20 19:59:13,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:13,049 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:13,056 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_2.cil-2+token_ring.10.cil-2.c[914,927] [2022-02-20 19:59:13,068 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_2.cil-2+token_ring.10.cil-2.c[7125,7138] [2022-02-20 19:59:13,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:13,152 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:13,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:13 WrapperNode [2022-02-20 19:59:13,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:13,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:13,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:13,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:13,161 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:13" (1/1) ... [2022-02-20 19:59:13,180 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:13" (1/1) ... [2022-02-20 19:59:13,224 INFO L137 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 925 [2022-02-20 19:59:13,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:13,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:13,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:13,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:13,231 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:13" (1/1) ... [2022-02-20 19:59:13,232 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:13" (1/1) ... [2022-02-20 19:59:13,235 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:13" (1/1) ... [2022-02-20 19:59:13,236 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:13" (1/1) ... [2022-02-20 19:59:13,246 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:13" (1/1) ... [2022-02-20 19:59:13,265 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:13" (1/1) ... [2022-02-20 19:59:13,267 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:13" (1/1) ... [2022-02-20 19:59:13,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:13,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:13,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:13,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:13,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:13" (1/1) ... [2022-02-20 19:59:13,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:13,314 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:13,319 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:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:13,342 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:13,342 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:13,342 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:13,343 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:13,343 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:13,344 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:13,344 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:13,344 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:13,345 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:13,345 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:13,345 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:59:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:13,474 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:13,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:14,186 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:14,205 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:14,205 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 19:59:14,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:14 BoogieIcfgContainer [2022-02-20 19:59:14,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:14,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:14,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:14,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:14,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:12" (1/3) ... [2022-02-20 19:59:14,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bf4085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:14, skipping insertion in model container [2022-02-20 19:59:14,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:13" (2/3) ... [2022-02-20 19:59:14,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bf4085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:14, skipping insertion in model container [2022-02-20 19:59:14,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:14" (3/3) ... [2022-02-20 19:59:14,215 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.10.cil-2.c [2022-02-20 19:59:14,219 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:14,219 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:14,258 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:14,265 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:14,265 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 434 states, 378 states have (on average 1.6322751322751323) internal successors, (617), 385 states have internal predecessors, (617), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 19:59:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:14,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:14,301 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] [2022-02-20 19:59:14,301 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:14,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1937637408, now seen corresponding path program 1 times [2022-02-20 19:59:14,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:14,311 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905235165] [2022-02-20 19:59:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:14,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#(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); {478#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:14,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {478#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:14,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {439#(= ~q_read_ev~0 2)} #1661#return; {439#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#(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; {480#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {480#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#(= |old(~q_read_ev~0)| 0)} assume true; {480#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {480#(= |old(~q_read_ev~0)| 0)} {439#(= ~q_read_ev~0 2)} #1663#return; {438#false} is VALID [2022-02-20 19:59:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} havoc ~__retres1~0; {437#true} is VALID [2022-02-20 19:59:14,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume !(1 == ~p_dw_pc~0); {437#true} is VALID [2022-02-20 19:59:14,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#true} ~__retres1~0 := 0; {437#true} is VALID [2022-02-20 19:59:14,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#true} #res := ~__retres1~0; {437#true} is VALID [2022-02-20 19:59:14,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,623 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {437#true} {437#true} #1657#return; {437#true} is VALID [2022-02-20 19:59:14,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} havoc ~__retres1~1; {437#true} is VALID [2022-02-20 19:59:14,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume !(1 == ~c_dr_pc~0); {437#true} is VALID [2022-02-20 19:59:14,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#true} ~__retres1~1 := 0; {437#true} is VALID [2022-02-20 19:59:14,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#true} #res := ~__retres1~1; {437#true} is VALID [2022-02-20 19:59:14,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,630 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {437#true} {437#true} #1659#return; {437#true} is VALID [2022-02-20 19:59:14,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#(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; {437#true} is VALID [2022-02-20 19:59:14,631 INFO L272 TraceCheckUtils]: 1: Hoare triple {437#true} call #t~ret8 := is_do_write_p_triggered(); {437#true} is VALID [2022-02-20 19:59:14,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#true} havoc ~__retres1~0; {437#true} is VALID [2022-02-20 19:59:14,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#true} assume !(1 == ~p_dw_pc~0); {437#true} is VALID [2022-02-20 19:59:14,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {437#true} ~__retres1~0 := 0; {437#true} is VALID [2022-02-20 19:59:14,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {437#true} #res := ~__retres1~0; {437#true} is VALID [2022-02-20 19:59:14,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,632 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {437#true} {437#true} #1657#return; {437#true} is VALID [2022-02-20 19:59:14,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {437#true} is VALID [2022-02-20 19:59:14,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {437#true} is VALID [2022-02-20 19:59:14,634 INFO L272 TraceCheckUtils]: 10: Hoare triple {437#true} call #t~ret9 := is_do_read_c_triggered(); {437#true} is VALID [2022-02-20 19:59:14,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#true} havoc ~__retres1~1; {437#true} is VALID [2022-02-20 19:59:14,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {437#true} assume !(1 == ~c_dr_pc~0); {437#true} is VALID [2022-02-20 19:59:14,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {437#true} ~__retres1~1 := 0; {437#true} is VALID [2022-02-20 19:59:14,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {437#true} #res := ~__retres1~1; {437#true} is VALID [2022-02-20 19:59:14,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,635 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {437#true} {437#true} #1659#return; {437#true} is VALID [2022-02-20 19:59:14,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {437#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {437#true} is VALID [2022-02-20 19:59:14,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {437#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {437#true} is VALID [2022-02-20 19:59:14,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,637 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {437#true} {438#false} #1665#return; {438#false} is VALID [2022-02-20 19:59:14,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#(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; {437#true} is VALID [2022-02-20 19:59:14,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {437#true} is VALID [2022-02-20 19:59:14,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {437#true} {438#false} #1667#return; {438#false} is VALID [2022-02-20 19:59:14,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:14,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} havoc ~__retres1~2; {437#true} is VALID [2022-02-20 19:59:14,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {437#true} is VALID [2022-02-20 19:59:14,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#true} #res := ~__retres1~2; {437#true} is VALID [2022-02-20 19:59:14,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,669 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {437#true} {438#false} #1669#return; {438#false} is VALID [2022-02-20 19:59:14,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {437#true} is VALID [2022-02-20 19:59:14,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {437#true} is VALID [2022-02-20 19:59:14,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {439#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {439#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {439#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#(= ~q_read_ev~0 2)} call update_channels1(); {477#(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:14,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#(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); {478#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:14,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {478#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {478#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:14,675 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {478#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {439#(= ~q_read_ev~0 2)} #1661#return; {439#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {439#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {439#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {439#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {439#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {439#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:59:14,679 INFO L272 TraceCheckUtils]: 12: Hoare triple {439#(= ~q_read_ev~0 2)} call fire_delta_events1(); {479#(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:14,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {479#(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; {480#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {480#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {480#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {480#(= |old(~q_read_ev~0)| 0)} assume true; {480#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:59:14,681 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {480#(= |old(~q_read_ev~0)| 0)} {439#(= ~q_read_ev~0 2)} #1663#return; {438#false} is VALID [2022-02-20 19:59:14,682 INFO L272 TraceCheckUtils]: 17: Hoare triple {438#false} call activate_threads1(); {481#(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:14,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {481#(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; {437#true} is VALID [2022-02-20 19:59:14,682 INFO L272 TraceCheckUtils]: 19: Hoare triple {437#true} call #t~ret8 := is_do_write_p_triggered(); {437#true} is VALID [2022-02-20 19:59:14,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {437#true} havoc ~__retres1~0; {437#true} is VALID [2022-02-20 19:59:14,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {437#true} assume !(1 == ~p_dw_pc~0); {437#true} is VALID [2022-02-20 19:59:14,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {437#true} ~__retres1~0 := 0; {437#true} is VALID [2022-02-20 19:59:14,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {437#true} #res := ~__retres1~0; {437#true} is VALID [2022-02-20 19:59:14,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,684 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {437#true} {437#true} #1657#return; {437#true} is VALID [2022-02-20 19:59:14,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {437#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {437#true} is VALID [2022-02-20 19:59:14,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {437#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {437#true} is VALID [2022-02-20 19:59:14,684 INFO L272 TraceCheckUtils]: 28: Hoare triple {437#true} call #t~ret9 := is_do_read_c_triggered(); {437#true} is VALID [2022-02-20 19:59:14,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {437#true} havoc ~__retres1~1; {437#true} is VALID [2022-02-20 19:59:14,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {437#true} assume !(1 == ~c_dr_pc~0); {437#true} is VALID [2022-02-20 19:59:14,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {437#true} ~__retres1~1 := 0; {437#true} is VALID [2022-02-20 19:59:14,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {437#true} #res := ~__retres1~1; {437#true} is VALID [2022-02-20 19:59:14,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,685 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {437#true} {437#true} #1659#return; {437#true} is VALID [2022-02-20 19:59:14,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {437#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {437#true} is VALID [2022-02-20 19:59:14,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {437#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {437#true} is VALID [2022-02-20 19:59:14,686 INFO L290 TraceCheckUtils]: 37: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,686 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {437#true} {438#false} #1665#return; {438#false} is VALID [2022-02-20 19:59:14,687 INFO L272 TraceCheckUtils]: 39: Hoare triple {438#false} call reset_delta_events1(); {479#(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:14,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {479#(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; {437#true} is VALID [2022-02-20 19:59:14,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {437#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {437#true} is VALID [2022-02-20 19:59:14,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,688 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {437#true} {438#false} #1667#return; {438#false} is VALID [2022-02-20 19:59:14,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 19:59:14,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {438#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; {438#false} is VALID [2022-02-20 19:59:14,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 19:59:14,689 INFO L272 TraceCheckUtils]: 47: Hoare triple {438#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {437#true} is VALID [2022-02-20 19:59:14,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {437#true} havoc ~__retres1~2; {437#true} is VALID [2022-02-20 19:59:14,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {437#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {437#true} is VALID [2022-02-20 19:59:14,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {437#true} #res := ~__retres1~2; {437#true} is VALID [2022-02-20 19:59:14,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {437#true} assume true; {437#true} is VALID [2022-02-20 19:59:14,691 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {437#true} {438#false} #1669#return; {438#false} is VALID [2022-02-20 19:59:14,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {438#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; {438#false} is VALID [2022-02-20 19:59:14,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {438#false} assume 0 != eval1_~tmp___1~0#1; {438#false} is VALID [2022-02-20 19:59:14,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {438#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {438#false} is VALID [2022-02-20 19:59:14,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {438#false} assume !(0 != eval1_~tmp~2#1); {438#false} is VALID [2022-02-20 19:59:14,692 INFO L272 TraceCheckUtils]: 57: Hoare triple {438#false} call error1(); {438#false} is VALID [2022-02-20 19:59:14,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 19:59:14,694 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:14,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:14,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905235165] [2022-02-20 19:59:14,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905235165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:14,695 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:14,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:14,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133530605] [2022-02-20 19:59:14,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:14,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:14,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:14,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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:14,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:14,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:14,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:14,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:14,782 INFO L87 Difference]: Start difference. First operand has 434 states, 378 states have (on average 1.6322751322751323) internal successors, (617), 385 states have internal predecessors, (617), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:17,778 INFO L93 Difference]: Finished difference Result 978 states and 1554 transitions. [2022-02-20 19:59:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:59:17,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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:17,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1554 transitions. [2022-02-20 19:59:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1554 transitions. [2022-02-20 19:59:17,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1554 transitions. [2022-02-20 19:59:18,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1554 edges. 1554 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:18,832 INFO L225 Difference]: With dead ends: 978 [2022-02-20 19:59:18,833 INFO L226 Difference]: Without dead ends: 560 [2022-02-20 19:59:18,837 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:18,839 INFO L933 BasicCegarLoop]: 662 mSDtfsCounter, 768 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2179 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:18,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [773 Valid, 2179 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:59:18,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-02-20 19:59:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 520. [2022-02-20 19:59:18,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:18,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 560 states. Second operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:59:18,918 INFO L74 IsIncluded]: Start isIncluded. First operand 560 states. Second operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:59:18,920 INFO L87 Difference]: Start difference. First operand 560 states. Second operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:59:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:18,951 INFO L93 Difference]: Finished difference Result 560 states and 833 transitions. [2022-02-20 19:59:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 833 transitions. [2022-02-20 19:59:18,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:18,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:18,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 560 states. [2022-02-20 19:59:18,964 INFO L87 Difference]: Start difference. First operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 560 states. [2022-02-20 19:59:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:18,988 INFO L93 Difference]: Finished difference Result 560 states and 833 transitions. [2022-02-20 19:59:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 833 transitions. [2022-02-20 19:59:18,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:18,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:18,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:18,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:59:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 778 transitions. [2022-02-20 19:59:19,027 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 778 transitions. Word has length 59 [2022-02-20 19:59:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:19,028 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 778 transitions. [2022-02-20 19:59:19,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 778 transitions. [2022-02-20 19:59:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:19,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:19,032 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] [2022-02-20 19:59:19,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:59:19,034 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:19,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:19,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2118000928, now seen corresponding path program 1 times [2022-02-20 19:59:19,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:19,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527396029] [2022-02-20 19:59:19,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:19,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {3659#(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); {3660#(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:19,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {3660#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3660#(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:19,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3660#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3621#(= ~q_write_ev~0 ~q_read_ev~0)} #1661#return; {3621#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {3660#(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); {3661#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:19,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {3661#(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; {3662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:19,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {3662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:19,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3621#(= ~q_write_ev~0 ~q_read_ev~0)} #1663#return; {3620#false} is VALID [2022-02-20 19:59:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {3619#true} havoc ~__retres1~0; {3619#true} is VALID [2022-02-20 19:59:19,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3619#true} assume !(1 == ~p_dw_pc~0); {3619#true} is VALID [2022-02-20 19:59:19,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#true} ~__retres1~0 := 0; {3619#true} is VALID [2022-02-20 19:59:19,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {3619#true} #res := ~__retres1~0; {3619#true} is VALID [2022-02-20 19:59:19,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,169 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3619#true} {3619#true} #1657#return; {3619#true} is VALID [2022-02-20 19:59:19,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {3619#true} havoc ~__retres1~1; {3619#true} is VALID [2022-02-20 19:59:19,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {3619#true} assume !(1 == ~c_dr_pc~0); {3619#true} is VALID [2022-02-20 19:59:19,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#true} ~__retres1~1 := 0; {3619#true} is VALID [2022-02-20 19:59:19,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {3619#true} #res := ~__retres1~1; {3619#true} is VALID [2022-02-20 19:59:19,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,174 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3619#true} {3619#true} #1659#return; {3619#true} is VALID [2022-02-20 19:59:19,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {3663#(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; {3619#true} is VALID [2022-02-20 19:59:19,174 INFO L272 TraceCheckUtils]: 1: Hoare triple {3619#true} call #t~ret8 := is_do_write_p_triggered(); {3619#true} is VALID [2022-02-20 19:59:19,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#true} havoc ~__retres1~0; {3619#true} is VALID [2022-02-20 19:59:19,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {3619#true} assume !(1 == ~p_dw_pc~0); {3619#true} is VALID [2022-02-20 19:59:19,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {3619#true} ~__retres1~0 := 0; {3619#true} is VALID [2022-02-20 19:59:19,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {3619#true} #res := ~__retres1~0; {3619#true} is VALID [2022-02-20 19:59:19,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,175 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3619#true} {3619#true} #1657#return; {3619#true} is VALID [2022-02-20 19:59:19,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {3619#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3619#true} is VALID [2022-02-20 19:59:19,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {3619#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3619#true} is VALID [2022-02-20 19:59:19,175 INFO L272 TraceCheckUtils]: 10: Hoare triple {3619#true} call #t~ret9 := is_do_read_c_triggered(); {3619#true} is VALID [2022-02-20 19:59:19,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {3619#true} havoc ~__retres1~1; {3619#true} is VALID [2022-02-20 19:59:19,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {3619#true} assume !(1 == ~c_dr_pc~0); {3619#true} is VALID [2022-02-20 19:59:19,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {3619#true} ~__retres1~1 := 0; {3619#true} is VALID [2022-02-20 19:59:19,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {3619#true} #res := ~__retres1~1; {3619#true} is VALID [2022-02-20 19:59:19,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,176 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3619#true} {3619#true} #1659#return; {3619#true} is VALID [2022-02-20 19:59:19,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {3619#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3619#true} is VALID [2022-02-20 19:59:19,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {3619#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3619#true} is VALID [2022-02-20 19:59:19,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,177 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3619#true} {3620#false} #1665#return; {3620#false} is VALID [2022-02-20 19:59:19,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {3660#(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); {3619#true} is VALID [2022-02-20 19:59:19,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {3619#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3619#true} is VALID [2022-02-20 19:59:19,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3619#true} {3620#false} #1667#return; {3620#false} is VALID [2022-02-20 19:59:19,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:19,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {3619#true} havoc ~__retres1~2; {3619#true} is VALID [2022-02-20 19:59:19,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {3619#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3619#true} is VALID [2022-02-20 19:59:19,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#true} #res := ~__retres1~2; {3619#true} is VALID [2022-02-20 19:59:19,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,203 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3619#true} {3620#false} #1669#return; {3620#false} is VALID [2022-02-20 19:59:19,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {3619#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {3619#true} is VALID [2022-02-20 19:59:19,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {3619#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {3619#true} is VALID [2022-02-20 19:59:19,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {3621#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {3621#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {3621#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {3621#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3659#(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:19,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {3659#(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); {3660#(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:19,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {3660#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3660#(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:19,206 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3660#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3621#(= ~q_write_ev~0 ~q_read_ev~0)} #1661#return; {3621#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {3621#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3621#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {3621#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3621#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {3621#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3621#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {3621#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3621#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:19,208 INFO L272 TraceCheckUtils]: 12: Hoare triple {3621#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3660#(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:19,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {3660#(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); {3661#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:19,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {3661#(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; {3662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:19,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {3662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:19,209 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3662#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3621#(= ~q_write_ev~0 ~q_read_ev~0)} #1663#return; {3620#false} is VALID [2022-02-20 19:59:19,210 INFO L272 TraceCheckUtils]: 17: Hoare triple {3620#false} call activate_threads1(); {3663#(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:19,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {3663#(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; {3619#true} is VALID [2022-02-20 19:59:19,210 INFO L272 TraceCheckUtils]: 19: Hoare triple {3619#true} call #t~ret8 := is_do_write_p_triggered(); {3619#true} is VALID [2022-02-20 19:59:19,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {3619#true} havoc ~__retres1~0; {3619#true} is VALID [2022-02-20 19:59:19,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {3619#true} assume !(1 == ~p_dw_pc~0); {3619#true} is VALID [2022-02-20 19:59:19,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {3619#true} ~__retres1~0 := 0; {3619#true} is VALID [2022-02-20 19:59:19,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {3619#true} #res := ~__retres1~0; {3619#true} is VALID [2022-02-20 19:59:19,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,211 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3619#true} {3619#true} #1657#return; {3619#true} is VALID [2022-02-20 19:59:19,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {3619#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3619#true} is VALID [2022-02-20 19:59:19,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {3619#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3619#true} is VALID [2022-02-20 19:59:19,212 INFO L272 TraceCheckUtils]: 28: Hoare triple {3619#true} call #t~ret9 := is_do_read_c_triggered(); {3619#true} is VALID [2022-02-20 19:59:19,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {3619#true} havoc ~__retres1~1; {3619#true} is VALID [2022-02-20 19:59:19,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {3619#true} assume !(1 == ~c_dr_pc~0); {3619#true} is VALID [2022-02-20 19:59:19,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {3619#true} ~__retres1~1 := 0; {3619#true} is VALID [2022-02-20 19:59:19,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {3619#true} #res := ~__retres1~1; {3619#true} is VALID [2022-02-20 19:59:19,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,215 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3619#true} {3619#true} #1659#return; {3619#true} is VALID [2022-02-20 19:59:19,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {3619#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3619#true} is VALID [2022-02-20 19:59:19,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {3619#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3619#true} is VALID [2022-02-20 19:59:19,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,215 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3619#true} {3620#false} #1665#return; {3620#false} is VALID [2022-02-20 19:59:19,216 INFO L272 TraceCheckUtils]: 39: Hoare triple {3620#false} call reset_delta_events1(); {3660#(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:19,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {3660#(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); {3619#true} is VALID [2022-02-20 19:59:19,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {3619#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3619#true} is VALID [2022-02-20 19:59:19,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,219 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3619#true} {3620#false} #1667#return; {3620#false} is VALID [2022-02-20 19:59:19,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2022-02-20 19:59:19,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {3620#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; {3620#false} is VALID [2022-02-20 19:59:19,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2022-02-20 19:59:19,219 INFO L272 TraceCheckUtils]: 47: Hoare triple {3620#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3619#true} is VALID [2022-02-20 19:59:19,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {3619#true} havoc ~__retres1~2; {3619#true} is VALID [2022-02-20 19:59:19,220 INFO L290 TraceCheckUtils]: 49: Hoare triple {3619#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3619#true} is VALID [2022-02-20 19:59:19,220 INFO L290 TraceCheckUtils]: 50: Hoare triple {3619#true} #res := ~__retres1~2; {3619#true} is VALID [2022-02-20 19:59:19,220 INFO L290 TraceCheckUtils]: 51: Hoare triple {3619#true} assume true; {3619#true} is VALID [2022-02-20 19:59:19,220 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3619#true} {3620#false} #1669#return; {3620#false} is VALID [2022-02-20 19:59:19,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {3620#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; {3620#false} is VALID [2022-02-20 19:59:19,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {3620#false} assume 0 != eval1_~tmp___1~0#1; {3620#false} is VALID [2022-02-20 19:59:19,221 INFO L290 TraceCheckUtils]: 55: Hoare triple {3620#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3620#false} is VALID [2022-02-20 19:59:19,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {3620#false} assume !(0 != eval1_~tmp~2#1); {3620#false} is VALID [2022-02-20 19:59:19,221 INFO L272 TraceCheckUtils]: 57: Hoare triple {3620#false} call error1(); {3620#false} is VALID [2022-02-20 19:59:19,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2022-02-20 19:59:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:19,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:19,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527396029] [2022-02-20 19:59:19,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527396029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:19,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:19,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:19,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843229956] [2022-02-20 19:59:19,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:19,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:19,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:19,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:19,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:19,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:19,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:19,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:19,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:19,259 INFO L87 Difference]: Start difference. First operand 520 states and 778 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:22,531 INFO L93 Difference]: Finished difference Result 869 states and 1257 transitions. [2022-02-20 19:59:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 986 transitions. [2022-02-20 19:59:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 986 transitions. [2022-02-20 19:59:22,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 986 transitions. [2022-02-20 19:59:23,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 986 edges. 986 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:23,251 INFO L225 Difference]: With dead ends: 869 [2022-02-20 19:59:23,251 INFO L226 Difference]: Without dead ends: 691 [2022-02-20 19:59:23,252 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:23,253 INFO L933 BasicCegarLoop]: 709 mSDtfsCounter, 1539 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:23,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1567 Valid, 2100 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-02-20 19:59:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 616. [2022-02-20 19:59:23,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:23,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 616 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 531 states have internal predecessors, (780), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:59:23,295 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 616 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 531 states have internal predecessors, (780), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:59:23,296 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 616 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 531 states have internal predecessors, (780), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:59:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:23,319 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2022-02-20 19:59:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1016 transitions. [2022-02-20 19:59:23,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:23,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:23,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 616 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 531 states have internal predecessors, (780), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) Second operand 691 states. [2022-02-20 19:59:23,324 INFO L87 Difference]: Start difference. First operand has 616 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 531 states have internal predecessors, (780), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) Second operand 691 states. [2022-02-20 19:59:23,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:23,346 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2022-02-20 19:59:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1016 transitions. [2022-02-20 19:59:23,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:23,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:23,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:23,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 531 states have internal predecessors, (780), 61 states have call successors, (61), 28 states have call predecessors, (61), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:59:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 912 transitions. [2022-02-20 19:59:23,372 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 912 transitions. Word has length 59 [2022-02-20 19:59:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:23,373 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 912 transitions. [2022-02-20 19:59:23,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 912 transitions. [2022-02-20 19:59:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:23,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:23,375 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] [2022-02-20 19:59:23,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:59:23,375 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:23,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1224514590, now seen corresponding path program 1 times [2022-02-20 19:59:23,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:23,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989911513] [2022-02-20 19:59:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {7103#(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); {7064#true} is VALID [2022-02-20 19:59:23,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7064#true} {7064#true} #1661#return; {7064#true} is VALID [2022-02-20 19:59:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {7104#(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); {7064#true} is VALID [2022-02-20 19:59:23,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume !(0 == ~q_write_ev~0); {7064#true} is VALID [2022-02-20 19:59:23,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7064#true} {7064#true} #1663#return; {7064#true} is VALID [2022-02-20 19:59:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {7064#true} havoc ~__retres1~0; {7064#true} is VALID [2022-02-20 19:59:23,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume !(1 == ~p_dw_pc~0); {7064#true} is VALID [2022-02-20 19:59:23,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} ~__retres1~0 := 0; {7120#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:23,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {7120#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:23,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:23,495 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7064#true} #1657#return; {7112#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:23,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {7064#true} havoc ~__retres1~1; {7064#true} is VALID [2022-02-20 19:59:23,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume !(1 == ~c_dr_pc~0); {7064#true} is VALID [2022-02-20 19:59:23,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} ~__retres1~1 := 0; {7064#true} is VALID [2022-02-20 19:59:23,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {7064#true} #res := ~__retres1~1; {7064#true} is VALID [2022-02-20 19:59:23,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,499 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7064#true} {7065#false} #1659#return; {7065#false} is VALID [2022-02-20 19:59:23,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {7105#(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; {7064#true} is VALID [2022-02-20 19:59:23,499 INFO L272 TraceCheckUtils]: 1: Hoare triple {7064#true} call #t~ret8 := is_do_write_p_triggered(); {7064#true} is VALID [2022-02-20 19:59:23,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} havoc ~__retres1~0; {7064#true} is VALID [2022-02-20 19:59:23,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {7064#true} assume !(1 == ~p_dw_pc~0); {7064#true} is VALID [2022-02-20 19:59:23,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {7064#true} ~__retres1~0 := 0; {7120#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:23,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {7120#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:23,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:23,501 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7064#true} #1657#return; {7112#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:23,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {7112#(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; {7113#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:23,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {7113#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7065#false} is VALID [2022-02-20 19:59:23,503 INFO L272 TraceCheckUtils]: 10: Hoare triple {7065#false} call #t~ret9 := is_do_read_c_triggered(); {7064#true} is VALID [2022-02-20 19:59:23,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {7064#true} havoc ~__retres1~1; {7064#true} is VALID [2022-02-20 19:59:23,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {7064#true} assume !(1 == ~c_dr_pc~0); {7064#true} is VALID [2022-02-20 19:59:23,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {7064#true} ~__retres1~1 := 0; {7064#true} is VALID [2022-02-20 19:59:23,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {7064#true} #res := ~__retres1~1; {7064#true} is VALID [2022-02-20 19:59:23,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,504 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7064#true} {7065#false} #1659#return; {7065#false} is VALID [2022-02-20 19:59:23,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {7065#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7065#false} is VALID [2022-02-20 19:59:23,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {7065#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7065#false} is VALID [2022-02-20 19:59:23,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {7065#false} assume true; {7065#false} is VALID [2022-02-20 19:59:23,504 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7065#false} {7064#true} #1665#return; {7065#false} is VALID [2022-02-20 19:59:23,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {7104#(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); {7064#true} is VALID [2022-02-20 19:59:23,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7064#true} is VALID [2022-02-20 19:59:23,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7064#true} {7065#false} #1667#return; {7065#false} is VALID [2022-02-20 19:59:23,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:23,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {7064#true} havoc ~__retres1~2; {7064#true} is VALID [2022-02-20 19:59:23,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7064#true} is VALID [2022-02-20 19:59:23,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} #res := ~__retres1~2; {7064#true} is VALID [2022-02-20 19:59:23,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,513 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7064#true} {7065#false} #1669#return; {7065#false} is VALID [2022-02-20 19:59:23,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {7064#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {7064#true} is VALID [2022-02-20 19:59:23,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {7064#true} is VALID [2022-02-20 19:59:23,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {7064#true} is VALID [2022-02-20 19:59:23,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {7064#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {7064#true} is VALID [2022-02-20 19:59:23,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {7064#true} call update_channels1(); {7103#(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:23,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {7103#(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); {7064#true} is VALID [2022-02-20 19:59:23,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,515 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7064#true} {7064#true} #1661#return; {7064#true} is VALID [2022-02-20 19:59:23,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {7064#true} assume { :begin_inline_init_threads1 } true; {7064#true} is VALID [2022-02-20 19:59:23,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {7064#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7064#true} is VALID [2022-02-20 19:59:23,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {7064#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7064#true} is VALID [2022-02-20 19:59:23,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {7064#true} assume { :end_inline_init_threads1 } true; {7064#true} is VALID [2022-02-20 19:59:23,516 INFO L272 TraceCheckUtils]: 12: Hoare triple {7064#true} call fire_delta_events1(); {7104#(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:23,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {7104#(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); {7064#true} is VALID [2022-02-20 19:59:23,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {7064#true} assume !(0 == ~q_write_ev~0); {7064#true} is VALID [2022-02-20 19:59:23,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,516 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7064#true} {7064#true} #1663#return; {7064#true} is VALID [2022-02-20 19:59:23,517 INFO L272 TraceCheckUtils]: 17: Hoare triple {7064#true} call activate_threads1(); {7105#(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:23,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {7105#(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; {7064#true} is VALID [2022-02-20 19:59:23,517 INFO L272 TraceCheckUtils]: 19: Hoare triple {7064#true} call #t~ret8 := is_do_write_p_triggered(); {7064#true} is VALID [2022-02-20 19:59:23,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {7064#true} havoc ~__retres1~0; {7064#true} is VALID [2022-02-20 19:59:23,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {7064#true} assume !(1 == ~p_dw_pc~0); {7064#true} is VALID [2022-02-20 19:59:23,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {7064#true} ~__retres1~0 := 0; {7120#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:59:23,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {7120#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:23,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:59:23,519 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7121#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7064#true} #1657#return; {7112#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:59:23,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {7112#(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; {7113#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:59:23,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {7113#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7065#false} is VALID [2022-02-20 19:59:23,520 INFO L272 TraceCheckUtils]: 28: Hoare triple {7065#false} call #t~ret9 := is_do_read_c_triggered(); {7064#true} is VALID [2022-02-20 19:59:23,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {7064#true} havoc ~__retres1~1; {7064#true} is VALID [2022-02-20 19:59:23,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {7064#true} assume !(1 == ~c_dr_pc~0); {7064#true} is VALID [2022-02-20 19:59:23,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {7064#true} ~__retres1~1 := 0; {7064#true} is VALID [2022-02-20 19:59:23,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {7064#true} #res := ~__retres1~1; {7064#true} is VALID [2022-02-20 19:59:23,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,521 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7064#true} {7065#false} #1659#return; {7065#false} is VALID [2022-02-20 19:59:23,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {7065#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7065#false} is VALID [2022-02-20 19:59:23,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {7065#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7065#false} is VALID [2022-02-20 19:59:23,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {7065#false} assume true; {7065#false} is VALID [2022-02-20 19:59:23,522 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7065#false} {7064#true} #1665#return; {7065#false} is VALID [2022-02-20 19:59:23,522 INFO L272 TraceCheckUtils]: 39: Hoare triple {7065#false} call reset_delta_events1(); {7104#(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:23,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {7104#(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); {7064#true} is VALID [2022-02-20 19:59:23,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {7064#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7064#true} is VALID [2022-02-20 19:59:23,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,522 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7064#true} {7065#false} #1667#return; {7065#false} is VALID [2022-02-20 19:59:23,523 INFO L290 TraceCheckUtils]: 44: Hoare triple {7065#false} assume !false; {7065#false} is VALID [2022-02-20 19:59:23,523 INFO L290 TraceCheckUtils]: 45: Hoare triple {7065#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; {7065#false} is VALID [2022-02-20 19:59:23,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {7065#false} assume !false; {7065#false} is VALID [2022-02-20 19:59:23,523 INFO L272 TraceCheckUtils]: 47: Hoare triple {7065#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7064#true} is VALID [2022-02-20 19:59:23,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {7064#true} havoc ~__retres1~2; {7064#true} is VALID [2022-02-20 19:59:23,523 INFO L290 TraceCheckUtils]: 49: Hoare triple {7064#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7064#true} is VALID [2022-02-20 19:59:23,523 INFO L290 TraceCheckUtils]: 50: Hoare triple {7064#true} #res := ~__retres1~2; {7064#true} is VALID [2022-02-20 19:59:23,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-02-20 19:59:23,524 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7064#true} {7065#false} #1669#return; {7065#false} is VALID [2022-02-20 19:59:23,524 INFO L290 TraceCheckUtils]: 53: Hoare triple {7065#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; {7065#false} is VALID [2022-02-20 19:59:23,524 INFO L290 TraceCheckUtils]: 54: Hoare triple {7065#false} assume 0 != eval1_~tmp___1~0#1; {7065#false} is VALID [2022-02-20 19:59:23,524 INFO L290 TraceCheckUtils]: 55: Hoare triple {7065#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {7065#false} is VALID [2022-02-20 19:59:23,524 INFO L290 TraceCheckUtils]: 56: Hoare triple {7065#false} assume !(0 != eval1_~tmp~2#1); {7065#false} is VALID [2022-02-20 19:59:23,524 INFO L272 TraceCheckUtils]: 57: Hoare triple {7065#false} call error1(); {7065#false} is VALID [2022-02-20 19:59:23,525 INFO L290 TraceCheckUtils]: 58: Hoare triple {7065#false} assume !false; {7065#false} is VALID [2022-02-20 19:59:23,525 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,525 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:23,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989911513] [2022-02-20 19:59:23,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989911513] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:23,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:23,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:23,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488594099] [2022-02-20 19:59:23,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:23,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:23,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:23,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:23,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:23,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:23,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:23,564 INFO L87 Difference]: Start difference. First operand 616 states and 912 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:26,758 INFO L93 Difference]: Finished difference Result 918 states and 1327 transitions. [2022-02-20 19:59:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:26,758 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 803 transitions. [2022-02-20 19:59:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 803 transitions. [2022-02-20 19:59:26,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 803 transitions. [2022-02-20 19:59:27,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 803 edges. 803 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:27,336 INFO L225 Difference]: With dead ends: 918 [2022-02-20 19:59:27,337 INFO L226 Difference]: Without dead ends: 650 [2022-02-20 19:59:27,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:59:27,343 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 848 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:27,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 2515 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-02-20 19:59:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 621. [2022-02-20 19:59:27,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:27,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 650 states. Second operand has 621 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 535 states have internal predecessors, (782), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:59:27,377 INFO L74 IsIncluded]: Start isIncluded. First operand 650 states. Second operand has 621 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 535 states have internal predecessors, (782), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:59:27,378 INFO L87 Difference]: Start difference. First operand 650 states. Second operand has 621 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 535 states have internal predecessors, (782), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:59:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:27,397 INFO L93 Difference]: Finished difference Result 650 states and 956 transitions. [2022-02-20 19:59:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 956 transitions. [2022-02-20 19:59:27,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:27,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:27,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 621 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 535 states have internal predecessors, (782), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) Second operand 650 states. [2022-02-20 19:59:27,402 INFO L87 Difference]: Start difference. First operand has 621 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 535 states have internal predecessors, (782), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) Second operand 650 states. [2022-02-20 19:59:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:27,423 INFO L93 Difference]: Finished difference Result 650 states and 956 transitions. [2022-02-20 19:59:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 956 transitions. [2022-02-20 19:59:27,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:27,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:27,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:27,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 535 states have internal predecessors, (782), 61 states have call successors, (61), 28 states have call predecessors, (61), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:59:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 915 transitions. [2022-02-20 19:59:27,470 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 915 transitions. Word has length 59 [2022-02-20 19:59:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:27,471 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 915 transitions. [2022-02-20 19:59:27,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 915 transitions. [2022-02-20 19:59:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:27,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:27,473 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] [2022-02-20 19:59:27,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:59:27,473 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:27,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:27,473 INFO L85 PathProgramCache]: Analyzing trace with hash -949754976, now seen corresponding path program 1 times [2022-02-20 19:59:27,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:27,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124398357] [2022-02-20 19:59:27,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:27,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {10529#(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); {10490#true} is VALID [2022-02-20 19:59:27,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10490#true} {10490#true} #1661#return; {10490#true} is VALID [2022-02-20 19:59:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {10530#(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); {10490#true} is VALID [2022-02-20 19:59:27,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {10490#true} assume !(0 == ~q_write_ev~0); {10490#true} is VALID [2022-02-20 19:59:27,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10490#true} {10490#true} #1663#return; {10490#true} is VALID [2022-02-20 19:59:27,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {10490#true} havoc ~__retres1~0; {10490#true} is VALID [2022-02-20 19:59:27,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {10490#true} assume !(1 == ~p_dw_pc~0); {10490#true} is VALID [2022-02-20 19:59:27,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {10490#true} ~__retres1~0 := 0; {10490#true} is VALID [2022-02-20 19:59:27,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {10490#true} #res := ~__retres1~0; {10490#true} is VALID [2022-02-20 19:59:27,583 INFO L290 TraceCheckUtils]: 4: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,584 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10490#true} {10490#true} #1657#return; {10490#true} is VALID [2022-02-20 19:59:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {10490#true} havoc ~__retres1~1; {10490#true} is VALID [2022-02-20 19:59:27,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {10490#true} assume !(1 == ~c_dr_pc~0); {10490#true} is VALID [2022-02-20 19:59:27,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {10490#true} ~__retres1~1 := 0; {10546#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:27,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {10546#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:27,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:27,624 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10490#true} #1659#return; {10544#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:27,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {10531#(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; {10490#true} is VALID [2022-02-20 19:59:27,625 INFO L272 TraceCheckUtils]: 1: Hoare triple {10490#true} call #t~ret8 := is_do_write_p_triggered(); {10490#true} is VALID [2022-02-20 19:59:27,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {10490#true} havoc ~__retres1~0; {10490#true} is VALID [2022-02-20 19:59:27,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {10490#true} assume !(1 == ~p_dw_pc~0); {10490#true} is VALID [2022-02-20 19:59:27,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {10490#true} ~__retres1~0 := 0; {10490#true} is VALID [2022-02-20 19:59:27,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {10490#true} #res := ~__retres1~0; {10490#true} is VALID [2022-02-20 19:59:27,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,626 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10490#true} {10490#true} #1657#return; {10490#true} is VALID [2022-02-20 19:59:27,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {10490#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10490#true} is VALID [2022-02-20 19:59:27,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {10490#true} assume !(0 != ~tmp~1); {10490#true} is VALID [2022-02-20 19:59:27,626 INFO L272 TraceCheckUtils]: 10: Hoare triple {10490#true} call #t~ret9 := is_do_read_c_triggered(); {10490#true} is VALID [2022-02-20 19:59:27,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {10490#true} havoc ~__retres1~1; {10490#true} is VALID [2022-02-20 19:59:27,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {10490#true} assume !(1 == ~c_dr_pc~0); {10490#true} is VALID [2022-02-20 19:59:27,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {10490#true} ~__retres1~1 := 0; {10546#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:27,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {10546#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:27,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:27,628 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10490#true} #1659#return; {10544#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:27,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {10544#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10545#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:27,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {10545#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10491#false} is VALID [2022-02-20 19:59:27,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {10491#false} assume true; {10491#false} is VALID [2022-02-20 19:59:27,629 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10491#false} {10490#true} #1665#return; {10491#false} is VALID [2022-02-20 19:59:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {10530#(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); {10490#true} is VALID [2022-02-20 19:59:27,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {10490#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10490#true} is VALID [2022-02-20 19:59:27,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10490#true} {10491#false} #1667#return; {10491#false} is VALID [2022-02-20 19:59:27,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:27,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {10490#true} havoc ~__retres1~2; {10490#true} is VALID [2022-02-20 19:59:27,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {10490#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10490#true} is VALID [2022-02-20 19:59:27,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {10490#true} #res := ~__retres1~2; {10490#true} is VALID [2022-02-20 19:59:27,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,639 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10490#true} {10491#false} #1669#return; {10491#false} is VALID [2022-02-20 19:59:27,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {10490#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {10490#true} is VALID [2022-02-20 19:59:27,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {10490#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {10490#true} is VALID [2022-02-20 19:59:27,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {10490#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {10490#true} is VALID [2022-02-20 19:59:27,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {10490#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {10490#true} is VALID [2022-02-20 19:59:27,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {10490#true} call update_channels1(); {10529#(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:27,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {10529#(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); {10490#true} is VALID [2022-02-20 19:59:27,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,649 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10490#true} {10490#true} #1661#return; {10490#true} is VALID [2022-02-20 19:59:27,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {10490#true} assume { :begin_inline_init_threads1 } true; {10490#true} is VALID [2022-02-20 19:59:27,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {10490#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10490#true} is VALID [2022-02-20 19:59:27,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {10490#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10490#true} is VALID [2022-02-20 19:59:27,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {10490#true} assume { :end_inline_init_threads1 } true; {10490#true} is VALID [2022-02-20 19:59:27,651 INFO L272 TraceCheckUtils]: 12: Hoare triple {10490#true} call fire_delta_events1(); {10530#(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:27,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {10530#(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); {10490#true} is VALID [2022-02-20 19:59:27,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {10490#true} assume !(0 == ~q_write_ev~0); {10490#true} is VALID [2022-02-20 19:59:27,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,652 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10490#true} {10490#true} #1663#return; {10490#true} is VALID [2022-02-20 19:59:27,652 INFO L272 TraceCheckUtils]: 17: Hoare triple {10490#true} call activate_threads1(); {10531#(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:27,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {10531#(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; {10490#true} is VALID [2022-02-20 19:59:27,653 INFO L272 TraceCheckUtils]: 19: Hoare triple {10490#true} call #t~ret8 := is_do_write_p_triggered(); {10490#true} is VALID [2022-02-20 19:59:27,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {10490#true} havoc ~__retres1~0; {10490#true} is VALID [2022-02-20 19:59:27,653 INFO L290 TraceCheckUtils]: 21: Hoare triple {10490#true} assume !(1 == ~p_dw_pc~0); {10490#true} is VALID [2022-02-20 19:59:27,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {10490#true} ~__retres1~0 := 0; {10490#true} is VALID [2022-02-20 19:59:27,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {10490#true} #res := ~__retres1~0; {10490#true} is VALID [2022-02-20 19:59:27,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,654 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10490#true} {10490#true} #1657#return; {10490#true} is VALID [2022-02-20 19:59:27,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {10490#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10490#true} is VALID [2022-02-20 19:59:27,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {10490#true} assume !(0 != ~tmp~1); {10490#true} is VALID [2022-02-20 19:59:27,654 INFO L272 TraceCheckUtils]: 28: Hoare triple {10490#true} call #t~ret9 := is_do_read_c_triggered(); {10490#true} is VALID [2022-02-20 19:59:27,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {10490#true} havoc ~__retres1~1; {10490#true} is VALID [2022-02-20 19:59:27,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {10490#true} assume !(1 == ~c_dr_pc~0); {10490#true} is VALID [2022-02-20 19:59:27,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {10490#true} ~__retres1~1 := 0; {10546#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:59:27,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {10546#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:27,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:59:27,656 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10547#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10490#true} #1659#return; {10544#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:59:27,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {10544#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10545#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:59:27,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {10545#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10491#false} is VALID [2022-02-20 19:59:27,657 INFO L290 TraceCheckUtils]: 37: Hoare triple {10491#false} assume true; {10491#false} is VALID [2022-02-20 19:59:27,657 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10491#false} {10490#true} #1665#return; {10491#false} is VALID [2022-02-20 19:59:27,658 INFO L272 TraceCheckUtils]: 39: Hoare triple {10491#false} call reset_delta_events1(); {10530#(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:27,658 INFO L290 TraceCheckUtils]: 40: Hoare triple {10530#(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); {10490#true} is VALID [2022-02-20 19:59:27,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {10490#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10490#true} is VALID [2022-02-20 19:59:27,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,658 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10490#true} {10491#false} #1667#return; {10491#false} is VALID [2022-02-20 19:59:27,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {10491#false} assume !false; {10491#false} is VALID [2022-02-20 19:59:27,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {10491#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; {10491#false} is VALID [2022-02-20 19:59:27,659 INFO L290 TraceCheckUtils]: 46: Hoare triple {10491#false} assume !false; {10491#false} is VALID [2022-02-20 19:59:27,659 INFO L272 TraceCheckUtils]: 47: Hoare triple {10491#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10490#true} is VALID [2022-02-20 19:59:27,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {10490#true} havoc ~__retres1~2; {10490#true} is VALID [2022-02-20 19:59:27,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {10490#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10490#true} is VALID [2022-02-20 19:59:27,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {10490#true} #res := ~__retres1~2; {10490#true} is VALID [2022-02-20 19:59:27,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {10490#true} assume true; {10490#true} is VALID [2022-02-20 19:59:27,660 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10490#true} {10491#false} #1669#return; {10491#false} is VALID [2022-02-20 19:59:27,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {10491#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; {10491#false} is VALID [2022-02-20 19:59:27,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {10491#false} assume 0 != eval1_~tmp___1~0#1; {10491#false} is VALID [2022-02-20 19:59:27,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {10491#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {10491#false} is VALID [2022-02-20 19:59:27,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {10491#false} assume !(0 != eval1_~tmp~2#1); {10491#false} is VALID [2022-02-20 19:59:27,660 INFO L272 TraceCheckUtils]: 57: Hoare triple {10491#false} call error1(); {10491#false} is VALID [2022-02-20 19:59:27,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {10491#false} assume !false; {10491#false} is VALID [2022-02-20 19:59:27,661 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:27,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:27,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124398357] [2022-02-20 19:59:27,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124398357] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:27,662 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:27,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:59:27,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662981098] [2022-02-20 19:59:27,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:27,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:27,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:27,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:27,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:27,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:59:27,694 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:27,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:59:27,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:59:27,695 INFO L87 Difference]: Start difference. First operand 621 states and 915 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:30,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:30,956 INFO L93 Difference]: Finished difference Result 940 states and 1349 transitions. [2022-02-20 19:59:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:30,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 807 transitions. [2022-02-20 19:59:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 807 transitions. [2022-02-20 19:59:30,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 807 transitions. [2022-02-20 19:59:31,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 807 edges. 807 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:31,499 INFO L225 Difference]: With dead ends: 940 [2022-02-20 19:59:31,499 INFO L226 Difference]: Without dead ends: 667 [2022-02-20 19:59:31,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:59:31,507 INFO L933 BasicCegarLoop]: 631 mSDtfsCounter, 849 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:31,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 2512 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:59:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-02-20 19:59:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 636. [2022-02-20 19:59:31,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:31,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 636 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 547 states have internal predecessors, (794), 61 states have call successors, (61), 28 states have call predecessors, (61), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:59:31,537 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 636 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 547 states have internal predecessors, (794), 61 states have call successors, (61), 28 states have call predecessors, (61), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:59:31,538 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 636 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 547 states have internal predecessors, (794), 61 states have call successors, (61), 28 states have call predecessors, (61), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:59:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:31,558 INFO L93 Difference]: Finished difference Result 667 states and 974 transitions. [2022-02-20 19:59:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 974 transitions. [2022-02-20 19:59:31,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:31,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:31,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 636 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 547 states have internal predecessors, (794), 61 states have call successors, (61), 28 states have call predecessors, (61), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) Second operand 667 states. [2022-02-20 19:59:31,563 INFO L87 Difference]: Start difference. First operand has 636 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 547 states have internal predecessors, (794), 61 states have call successors, (61), 28 states have call predecessors, (61), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) Second operand 667 states. [2022-02-20 19:59:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:31,582 INFO L93 Difference]: Finished difference Result 667 states and 974 transitions. [2022-02-20 19:59:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 974 transitions. [2022-02-20 19:59:31,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:31,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:31,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:31,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 547 states have internal predecessors, (794), 61 states have call successors, (61), 28 states have call predecessors, (61), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:59:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 930 transitions. [2022-02-20 19:59:31,617 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 930 transitions. Word has length 59 [2022-02-20 19:59:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:31,618 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 930 transitions. [2022-02-20 19:59:31,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 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:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 930 transitions. [2022-02-20 19:59:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:31,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:31,620 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] [2022-02-20 19:59:31,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:59:31,621 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:31,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:31,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1539773986, now seen corresponding path program 1 times [2022-02-20 19:59:31,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:31,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863344112] [2022-02-20 19:59:31,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {14036#(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); {14037#(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:31,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {14037#(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:31,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13998#(= ~q_write_ev~0 ~q_read_ev~0)} #1661#return; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {14037#(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); {14037#(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:31,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {14037#(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:31,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {14037#(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:31,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13998#(= ~q_write_ev~0 ~q_read_ev~0)} #1663#return; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {13996#true} havoc ~__retres1~0; {13996#true} is VALID [2022-02-20 19:59:31,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {13996#true} assume !(1 == ~p_dw_pc~0); {13996#true} is VALID [2022-02-20 19:59:31,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {13996#true} ~__retres1~0 := 0; {13996#true} is VALID [2022-02-20 19:59:31,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {13996#true} #res := ~__retres1~0; {13996#true} is VALID [2022-02-20 19:59:31,703 INFO L290 TraceCheckUtils]: 4: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,703 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13996#true} {13996#true} #1657#return; {13996#true} is VALID [2022-02-20 19:59:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {13996#true} havoc ~__retres1~1; {13996#true} is VALID [2022-02-20 19:59:31,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {13996#true} assume !(1 == ~c_dr_pc~0); {13996#true} is VALID [2022-02-20 19:59:31,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {13996#true} ~__retres1~1 := 0; {13996#true} is VALID [2022-02-20 19:59:31,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {13996#true} #res := ~__retres1~1; {13996#true} is VALID [2022-02-20 19:59:31,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,706 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13996#true} {13996#true} #1659#return; {13996#true} is VALID [2022-02-20 19:59:31,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {14038#(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; {13996#true} is VALID [2022-02-20 19:59:31,706 INFO L272 TraceCheckUtils]: 1: Hoare triple {13996#true} call #t~ret8 := is_do_write_p_triggered(); {13996#true} is VALID [2022-02-20 19:59:31,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {13996#true} havoc ~__retres1~0; {13996#true} is VALID [2022-02-20 19:59:31,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {13996#true} assume !(1 == ~p_dw_pc~0); {13996#true} is VALID [2022-02-20 19:59:31,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {13996#true} ~__retres1~0 := 0; {13996#true} is VALID [2022-02-20 19:59:31,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {13996#true} #res := ~__retres1~0; {13996#true} is VALID [2022-02-20 19:59:31,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,707 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13996#true} {13996#true} #1657#return; {13996#true} is VALID [2022-02-20 19:59:31,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {13996#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13996#true} is VALID [2022-02-20 19:59:31,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {13996#true} assume !(0 != ~tmp~1); {13996#true} is VALID [2022-02-20 19:59:31,708 INFO L272 TraceCheckUtils]: 10: Hoare triple {13996#true} call #t~ret9 := is_do_read_c_triggered(); {13996#true} is VALID [2022-02-20 19:59:31,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {13996#true} havoc ~__retres1~1; {13996#true} is VALID [2022-02-20 19:59:31,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {13996#true} assume !(1 == ~c_dr_pc~0); {13996#true} is VALID [2022-02-20 19:59:31,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {13996#true} ~__retres1~1 := 0; {13996#true} is VALID [2022-02-20 19:59:31,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {13996#true} #res := ~__retres1~1; {13996#true} is VALID [2022-02-20 19:59:31,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,709 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13996#true} {13996#true} #1659#return; {13996#true} is VALID [2022-02-20 19:59:31,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {13996#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13996#true} is VALID [2022-02-20 19:59:31,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {13996#true} assume !(0 != ~tmp___0~1); {13996#true} is VALID [2022-02-20 19:59:31,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,713 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13996#true} {13998#(= ~q_write_ev~0 ~q_read_ev~0)} #1665#return; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {14037#(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); {14051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:31,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {14051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14052#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:31,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {14052#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {14052#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:31,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14052#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13998#(= ~q_write_ev~0 ~q_read_ev~0)} #1667#return; {13997#false} is VALID [2022-02-20 19:59:31,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:31,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {13996#true} havoc ~__retres1~2; {13996#true} is VALID [2022-02-20 19:59:31,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {13996#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13996#true} is VALID [2022-02-20 19:59:31,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {13996#true} #res := ~__retres1~2; {13996#true} is VALID [2022-02-20 19:59:31,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,737 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13996#true} {13997#false} #1669#return; {13997#false} is VALID [2022-02-20 19:59:31,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {13996#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {13996#true} is VALID [2022-02-20 19:59:31,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {13996#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {13996#true} is VALID [2022-02-20 19:59:31,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {13996#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {13998#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {13998#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {14036#(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:31,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {14036#(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); {14037#(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:31,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {14037#(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:31,740 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13998#(= ~q_write_ev~0 ~q_read_ev~0)} #1661#return; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {13998#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {13998#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {13998#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {13998#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,741 INFO L272 TraceCheckUtils]: 12: Hoare triple {13998#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {14037#(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:31,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {14037#(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); {14037#(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:31,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {14037#(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:31,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {14037#(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:31,742 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14037#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13998#(= ~q_write_ev~0 ~q_read_ev~0)} #1663#return; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,743 INFO L272 TraceCheckUtils]: 17: Hoare triple {13998#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {14038#(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:31,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {14038#(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; {13996#true} is VALID [2022-02-20 19:59:31,743 INFO L272 TraceCheckUtils]: 19: Hoare triple {13996#true} call #t~ret8 := is_do_write_p_triggered(); {13996#true} is VALID [2022-02-20 19:59:31,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {13996#true} havoc ~__retres1~0; {13996#true} is VALID [2022-02-20 19:59:31,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {13996#true} assume !(1 == ~p_dw_pc~0); {13996#true} is VALID [2022-02-20 19:59:31,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {13996#true} ~__retres1~0 := 0; {13996#true} is VALID [2022-02-20 19:59:31,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {13996#true} #res := ~__retres1~0; {13996#true} is VALID [2022-02-20 19:59:31,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,746 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13996#true} {13996#true} #1657#return; {13996#true} is VALID [2022-02-20 19:59:31,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {13996#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13996#true} is VALID [2022-02-20 19:59:31,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {13996#true} assume !(0 != ~tmp~1); {13996#true} is VALID [2022-02-20 19:59:31,746 INFO L272 TraceCheckUtils]: 28: Hoare triple {13996#true} call #t~ret9 := is_do_read_c_triggered(); {13996#true} is VALID [2022-02-20 19:59:31,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {13996#true} havoc ~__retres1~1; {13996#true} is VALID [2022-02-20 19:59:31,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {13996#true} assume !(1 == ~c_dr_pc~0); {13996#true} is VALID [2022-02-20 19:59:31,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {13996#true} ~__retres1~1 := 0; {13996#true} is VALID [2022-02-20 19:59:31,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {13996#true} #res := ~__retres1~1; {13996#true} is VALID [2022-02-20 19:59:31,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,747 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13996#true} {13996#true} #1659#return; {13996#true} is VALID [2022-02-20 19:59:31,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {13996#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13996#true} is VALID [2022-02-20 19:59:31,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {13996#true} assume !(0 != ~tmp___0~1); {13996#true} is VALID [2022-02-20 19:59:31,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,747 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13996#true} {13998#(= ~q_write_ev~0 ~q_read_ev~0)} #1665#return; {13998#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:59:31,748 INFO L272 TraceCheckUtils]: 39: Hoare triple {13998#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {14037#(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:31,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {14037#(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); {14051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:59:31,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {14051#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14052#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:31,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {14052#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {14052#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:59:31,749 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14052#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13998#(= ~q_write_ev~0 ~q_read_ev~0)} #1667#return; {13997#false} is VALID [2022-02-20 19:59:31,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {13997#false} assume !false; {13997#false} is VALID [2022-02-20 19:59:31,749 INFO L290 TraceCheckUtils]: 45: Hoare triple {13997#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; {13997#false} is VALID [2022-02-20 19:59:31,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {13997#false} assume !false; {13997#false} is VALID [2022-02-20 19:59:31,750 INFO L272 TraceCheckUtils]: 47: Hoare triple {13997#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13996#true} is VALID [2022-02-20 19:59:31,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {13996#true} havoc ~__retres1~2; {13996#true} is VALID [2022-02-20 19:59:31,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {13996#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13996#true} is VALID [2022-02-20 19:59:31,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {13996#true} #res := ~__retres1~2; {13996#true} is VALID [2022-02-20 19:59:31,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {13996#true} assume true; {13996#true} is VALID [2022-02-20 19:59:31,750 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13996#true} {13997#false} #1669#return; {13997#false} is VALID [2022-02-20 19:59:31,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {13997#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; {13997#false} is VALID [2022-02-20 19:59:31,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {13997#false} assume 0 != eval1_~tmp___1~0#1; {13997#false} is VALID [2022-02-20 19:59:31,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {13997#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {13997#false} is VALID [2022-02-20 19:59:31,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {13997#false} assume !(0 != eval1_~tmp~2#1); {13997#false} is VALID [2022-02-20 19:59:31,751 INFO L272 TraceCheckUtils]: 57: Hoare triple {13997#false} call error1(); {13997#false} is VALID [2022-02-20 19:59:31,751 INFO L290 TraceCheckUtils]: 58: Hoare triple {13997#false} assume !false; {13997#false} is VALID [2022-02-20 19:59:31,751 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,752 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:31,752 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863344112] [2022-02-20 19:59:31,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863344112] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:31,752 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:31,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:59:31,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210900579] [2022-02-20 19:59:31,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:31,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:31,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:31,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:31,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:31,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:59:31,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:31,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:59:31,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:31,785 INFO L87 Difference]: Start difference. First operand 636 states and 930 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:34,854 INFO L93 Difference]: Finished difference Result 1030 states and 1443 transitions. [2022-02-20 19:59:34,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:59:34,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2022-02-20 19:59:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 987 transitions. [2022-02-20 19:59:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 987 transitions. [2022-02-20 19:59:34,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 987 transitions. [2022-02-20 19:59:35,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 987 edges. 987 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:35,532 INFO L225 Difference]: With dead ends: 1030 [2022-02-20 19:59:35,533 INFO L226 Difference]: Without dead ends: 744 [2022-02-20 19:59:35,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:59:35,535 INFO L933 BasicCegarLoop]: 657 mSDtfsCounter, 1270 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:35,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1298 Valid, 2200 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:59:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-02-20 19:59:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 648. [2022-02-20 19:59:35,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:35,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 744 states. Second operand has 648 states, 548 states have (on average 1.467153284671533) internal successors, (804), 557 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:59:35,565 INFO L74 IsIncluded]: Start isIncluded. First operand 744 states. Second operand has 648 states, 548 states have (on average 1.467153284671533) internal successors, (804), 557 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:59:35,566 INFO L87 Difference]: Start difference. First operand 744 states. Second operand has 648 states, 548 states have (on average 1.467153284671533) internal successors, (804), 557 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:59:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:35,594 INFO L93 Difference]: Finished difference Result 744 states and 1062 transitions. [2022-02-20 19:59:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1062 transitions. [2022-02-20 19:59:35,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:35,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:35,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 648 states, 548 states have (on average 1.467153284671533) internal successors, (804), 557 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) Second operand 744 states. [2022-02-20 19:59:35,598 INFO L87 Difference]: Start difference. First operand has 648 states, 548 states have (on average 1.467153284671533) internal successors, (804), 557 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) Second operand 744 states. [2022-02-20 19:59:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:35,621 INFO L93 Difference]: Finished difference Result 744 states and 1062 transitions. [2022-02-20 19:59:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1062 transitions. [2022-02-20 19:59:35,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:35,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:35,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:35,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 548 states have (on average 1.467153284671533) internal successors, (804), 557 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:59:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 940 transitions. [2022-02-20 19:59:35,645 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 940 transitions. Word has length 59 [2022-02-20 19:59:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:35,645 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 940 transitions. [2022-02-20 19:59:35,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 940 transitions. [2022-02-20 19:59:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:35,646 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:35,646 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] [2022-02-20 19:59:35,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:35,646 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:35,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash -454370720, now seen corresponding path program 1 times [2022-02-20 19:59:35,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:35,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592472294] [2022-02-20 19:59:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:35,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:35,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:35,717 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:35,717 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:35,718 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:35,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:35,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:35,723 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 19:59:35,725 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:35,785 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:35,785 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:59:35,793 INFO L158 Benchmark]: Toolchain (without parser) took 23046.19ms. Allocated memory was 83.9MB in the beginning and 234.9MB in the end (delta: 151.0MB). Free memory was 52.8MB in the beginning and 171.8MB in the end (delta: -118.9MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:35,793 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 54.9MB in the end (delta: 25.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:35,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.08ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 52.6MB in the beginning and 65.3MB in the end (delta: -12.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:35,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.50ms. Allocated memory is still 102.8MB. Free memory was 65.3MB in the beginning and 59.8MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:35,794 INFO L158 Benchmark]: Boogie Preprocessor took 45.56ms. Allocated memory is still 102.8MB. Free memory was 59.8MB in the beginning and 79.7MB in the end (delta: -19.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:35,794 INFO L158 Benchmark]: RCFGBuilder took 936.45ms. Allocated memory is still 102.8MB. Free memory was 79.7MB in the beginning and 64.7MB in the end (delta: 15.0MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2022-02-20 19:59:35,794 INFO L158 Benchmark]: TraceAbstraction took 21581.71ms. Allocated memory was 102.8MB in the beginning and 234.9MB in the end (delta: 132.1MB). Free memory was 63.9MB in the beginning and 171.8MB in the end (delta: -107.9MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2022-02-20 19:59:35,796 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 54.9MB in the end (delta: 25.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.08ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 52.6MB in the beginning and 65.3MB in the end (delta: -12.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.50ms. Allocated memory is still 102.8MB. Free memory was 65.3MB in the beginning and 59.8MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.56ms. Allocated memory is still 102.8MB. Free memory was 59.8MB in the beginning and 79.7MB in the end (delta: -19.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * RCFGBuilder took 936.45ms. Allocated memory is still 102.8MB. Free memory was 79.7MB in the beginning and 64.7MB in the end (delta: 15.0MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * TraceAbstraction took 21581.71ms. Allocated memory was 102.8MB in the beginning and 234.9MB in the end (delta: 132.1MB). Free memory was 63.9MB in the beginning and 171.8MB in the end (delta: -107.9MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:59:35,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_2.cil-2+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 a110ed0c6f4923a9ada85889b347db0ba056a7cf6869bb52e907ef3e34294094 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:37,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:37,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:37,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:37,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:37,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:37,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:37,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:37,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:37,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:37,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:37,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:37,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:37,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:37,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:37,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:37,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:37,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:37,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:37,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:37,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:37,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:37,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:37,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:37,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:37,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:37,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:37,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:37,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:37,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:37,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:37,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:37,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:37,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:37,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:37,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:37,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:37,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:37,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:37,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:37,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:37,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 19:59:37,676 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:37,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:37,680 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:37,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:37,681 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:37,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:37,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:37,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:37,684 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:37,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:37,685 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:37,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:37,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:37,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:37,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:37,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:37,686 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:37,686 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:37,686 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:37,686 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:37,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:37,686 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:37,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:37,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:37,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:37,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:37,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:37,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:37,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:37,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:37,699 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:37,699 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:37,699 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:37,700 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:37,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:37,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:37,700 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a110ed0c6f4923a9ada85889b347db0ba056a7cf6869bb52e907ef3e34294094 [2022-02-20 19:59:37,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:38,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:38,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:38,007 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:38,009 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:38,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c [2022-02-20 19:59:38,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed93389c/e38a8acc9b2741f7ac3cdd22ad9a39e2/FLAG12d6c9d76 [2022-02-20 19:59:38,518 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:38,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.10.cil-2.c [2022-02-20 19:59:38,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed93389c/e38a8acc9b2741f7ac3cdd22ad9a39e2/FLAG12d6c9d76 [2022-02-20 19:59:38,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ed93389c/e38a8acc9b2741f7ac3cdd22ad9a39e2 [2022-02-20 19:59:38,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:38,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:38,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:38,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:38,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:38,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:38" (1/1) ... [2022-02-20 19:59:38,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba9cc47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:38, skipping insertion in model container [2022-02-20 19:59:38,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:38" (1/1) ... [2022-02-20 19:59:38,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:38,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:39,059 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_2.cil-2+token_ring.10.cil-2.c[914,927] [2022-02-20 19:59:39,109 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_2.cil-2+token_ring.10.cil-2.c[7125,7138] [2022-02-20 19:59:39,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:39,271 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:39,285 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_2.cil-2+token_ring.10.cil-2.c[914,927] [2022-02-20 19:59:39,308 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_2.cil-2+token_ring.10.cil-2.c[7125,7138] [2022-02-20 19:59:39,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:39,393 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:39,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39 WrapperNode [2022-02-20 19:59:39,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:39,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:39,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:39,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:39,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,470 INFO L137 Inliner]: procedures = 74, calls = 88, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 890 [2022-02-20 19:59:39,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:39,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:39,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:39,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:39,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:39,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:39,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:39,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:39,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (1/1) ... [2022-02-20 19:59:39,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:39,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:39,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:59:39,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:59:39,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:39,595 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:39,596 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:39,598 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:39,598 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:39,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:39,598 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:39,742 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:39,744 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:40,401 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:40,416 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:40,416 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 19:59:40,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:40 BoogieIcfgContainer [2022-02-20 19:59:40,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:40,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:40,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:40,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:40,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:38" (1/3) ... [2022-02-20 19:59:40,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cf513f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:40, skipping insertion in model container [2022-02-20 19:59:40,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:39" (2/3) ... [2022-02-20 19:59:40,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41cf513f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:40, skipping insertion in model container [2022-02-20 19:59:40,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:40" (3/3) ... [2022-02-20 19:59:40,425 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.10.cil-2.c [2022-02-20 19:59:40,428 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:40,428 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:40,473 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:40,485 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:59:40,485 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 434 states, 378 states have (on average 1.6322751322751323) internal successors, (617), 385 states have internal predecessors, (617), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2022-02-20 19:59:40,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:40,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:40,523 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] [2022-02-20 19:59:40,523 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:40,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:40,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1937637408, now seen corresponding path program 1 times [2022-02-20 19:59:40,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:40,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931243692] [2022-02-20 19:59:40,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:40,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:40,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:40,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:40,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 19:59:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:40,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:40,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {437#true} is VALID [2022-02-20 19:59:40,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1; {437#true} is VALID [2022-02-20 19:59:40,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#true} assume 0bv32 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {448#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {448#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {448#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {448#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {455#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {455#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {455#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {455#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,929 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {455#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {448#(= (_ bv2 32) ~q_read_ev~0)} #1661#return; {448#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {448#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {448#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {448#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {448#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {448#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {448#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {448#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,932 INFO L272 TraceCheckUtils]: 12: Hoare triple {448#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {455#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:40,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {483#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:40,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {483#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {483#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:40,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {483#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {483#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:40,933 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {483#(= |old(~q_read_ev~0)| (_ bv0 32))} {448#(= (_ bv2 32) ~q_read_ev~0)} #1663#return; {438#false} is VALID [2022-02-20 19:59:40,934 INFO L272 TraceCheckUtils]: 17: Hoare triple {438#false} call activate_threads1(); {438#false} is VALID [2022-02-20 19:59:40,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {438#false} havoc ~tmp~1;havoc ~tmp___0~1; {438#false} is VALID [2022-02-20 19:59:40,934 INFO L272 TraceCheckUtils]: 19: Hoare triple {438#false} call #t~ret8 := is_do_write_p_triggered(); {438#false} is VALID [2022-02-20 19:59:40,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {438#false} havoc ~__retres1~0; {438#false} is VALID [2022-02-20 19:59:40,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {438#false} assume !(1bv32 == ~p_dw_pc~0); {438#false} is VALID [2022-02-20 19:59:40,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {438#false} ~__retres1~0 := 0bv32; {438#false} is VALID [2022-02-20 19:59:40,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {438#false} #res := ~__retres1~0; {438#false} is VALID [2022-02-20 19:59:40,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {438#false} assume true; {438#false} is VALID [2022-02-20 19:59:40,935 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {438#false} {438#false} #1657#return; {438#false} is VALID [2022-02-20 19:59:40,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {438#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {438#false} is VALID [2022-02-20 19:59:40,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {438#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {438#false} is VALID [2022-02-20 19:59:40,936 INFO L272 TraceCheckUtils]: 28: Hoare triple {438#false} call #t~ret9 := is_do_read_c_triggered(); {438#false} is VALID [2022-02-20 19:59:40,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {438#false} havoc ~__retres1~1; {438#false} is VALID [2022-02-20 19:59:40,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {438#false} assume !(1bv32 == ~c_dr_pc~0); {438#false} is VALID [2022-02-20 19:59:40,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {438#false} ~__retres1~1 := 0bv32; {438#false} is VALID [2022-02-20 19:59:40,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {438#false} #res := ~__retres1~1; {438#false} is VALID [2022-02-20 19:59:40,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {438#false} assume true; {438#false} is VALID [2022-02-20 19:59:40,937 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {438#false} {438#false} #1659#return; {438#false} is VALID [2022-02-20 19:59:40,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {438#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {438#false} is VALID [2022-02-20 19:59:40,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {438#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {438#false} is VALID [2022-02-20 19:59:40,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {438#false} assume true; {438#false} is VALID [2022-02-20 19:59:40,938 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {438#false} {438#false} #1665#return; {438#false} is VALID [2022-02-20 19:59:40,938 INFO L272 TraceCheckUtils]: 39: Hoare triple {438#false} call reset_delta_events1(); {438#false} is VALID [2022-02-20 19:59:40,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {438#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {438#false} is VALID [2022-02-20 19:59:40,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {438#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {438#false} is VALID [2022-02-20 19:59:40,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {438#false} assume true; {438#false} is VALID [2022-02-20 19:59:40,939 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {438#false} {438#false} #1667#return; {438#false} is VALID [2022-02-20 19:59:40,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 19:59:40,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {438#false} start_simulation1_~kernel_st~0#1 := 1bv32;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; {438#false} is VALID [2022-02-20 19:59:40,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 19:59:40,940 INFO L272 TraceCheckUtils]: 47: Hoare triple {438#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {438#false} is VALID [2022-02-20 19:59:40,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {438#false} havoc ~__retres1~2; {438#false} is VALID [2022-02-20 19:59:40,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {438#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {438#false} is VALID [2022-02-20 19:59:40,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {438#false} #res := ~__retres1~2; {438#false} is VALID [2022-02-20 19:59:40,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {438#false} assume true; {438#false} is VALID [2022-02-20 19:59:40,941 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {438#false} {438#false} #1669#return; {438#false} is VALID [2022-02-20 19:59:40,941 INFO L290 TraceCheckUtils]: 53: Hoare triple {438#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {438#false} is VALID [2022-02-20 19:59:40,941 INFO L290 TraceCheckUtils]: 54: Hoare triple {438#false} assume 0bv32 != eval1_~tmp___1~0#1; {438#false} is VALID [2022-02-20 19:59:40,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {438#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {438#false} is VALID [2022-02-20 19:59:40,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {438#false} assume !(0bv32 != eval1_~tmp~2#1); {438#false} is VALID [2022-02-20 19:59:40,942 INFO L272 TraceCheckUtils]: 57: Hoare triple {438#false} call error1(); {438#false} is VALID [2022-02-20 19:59:40,942 INFO L290 TraceCheckUtils]: 58: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 19:59:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:40,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:40,944 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:40,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931243692] [2022-02-20 19:59:40,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931243692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:40,944 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:40,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:40,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309573889] [2022-02-20 19:59:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:40,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:40,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:40,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:41,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:41,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:41,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:41,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:41,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:41,024 INFO L87 Difference]: Start difference. First operand has 434 states, 378 states have (on average 1.6322751322751323) internal successors, (617), 385 states have internal predecessors, (617), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:43,445 INFO L93 Difference]: Finished difference Result 946 states and 1508 transitions. [2022-02-20 19:59:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:43,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1508 transitions. [2022-02-20 19:59:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1508 transitions. [2022-02-20 19:59:43,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1508 transitions. [2022-02-20 19:59:44,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1508 edges. 1508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:44,605 INFO L225 Difference]: With dead ends: 946 [2022-02-20 19:59:44,605 INFO L226 Difference]: Without dead ends: 528 [2022-02-20 19:59:44,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:44,611 INFO L933 BasicCegarLoop]: 657 mSDtfsCounter, 438 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:44,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 1650 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-02-20 19:59:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 520. [2022-02-20 19:59:44,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:44,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 528 states. Second operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:59:44,661 INFO L74 IsIncluded]: Start isIncluded. First operand 528 states. Second operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:59:44,662 INFO L87 Difference]: Start difference. First operand 528 states. Second operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:59:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:44,693 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2022-02-20 19:59:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 787 transitions. [2022-02-20 19:59:44,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:44,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:44,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 528 states. [2022-02-20 19:59:44,703 INFO L87 Difference]: Start difference. First operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 528 states. [2022-02-20 19:59:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:44,722 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2022-02-20 19:59:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 787 transitions. [2022-02-20 19:59:44,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:44,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:44,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:44,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 446 states have (on average 1.515695067264574) internal successors, (676), 453 states have internal predecessors, (676), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:59:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 778 transitions. [2022-02-20 19:59:44,749 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 778 transitions. Word has length 59 [2022-02-20 19:59:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:44,749 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 778 transitions. [2022-02-20 19:59:44,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 778 transitions. [2022-02-20 19:59:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:44,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:44,751 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] [2022-02-20 19:59:44,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:44,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:44,959 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:44,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2118000928, now seen corresponding path program 1 times [2022-02-20 19:59:44,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:44,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871512288] [2022-02-20 19:59:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:44,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:44,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:44,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 19:59:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:45,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:45,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {3619#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {3619#true} is VALID [2022-02-20 19:59:45,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {3619#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1; {3619#true} is VALID [2022-02-20 19:59:45,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {3619#true} assume 0bv32 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {3630#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {3630#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {3630#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {3630#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,228 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {3630#(= (_ bv2 32) ~q_write_ev~0)} #1661#return; {3630#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {3630#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {3630#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {3630#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {3630#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {3630#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {3630#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {3630#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {3630#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {3630#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:45,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {3637#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {3668#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:45,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {3668#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {3668#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:45,233 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3668#(= |old(~q_write_ev~0)| (_ bv0 32))} {3630#(= (_ bv2 32) ~q_write_ev~0)} #1663#return; {3620#false} is VALID [2022-02-20 19:59:45,233 INFO L272 TraceCheckUtils]: 17: Hoare triple {3620#false} call activate_threads1(); {3620#false} is VALID [2022-02-20 19:59:45,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {3620#false} havoc ~tmp~1;havoc ~tmp___0~1; {3620#false} is VALID [2022-02-20 19:59:45,233 INFO L272 TraceCheckUtils]: 19: Hoare triple {3620#false} call #t~ret8 := is_do_write_p_triggered(); {3620#false} is VALID [2022-02-20 19:59:45,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {3620#false} havoc ~__retres1~0; {3620#false} is VALID [2022-02-20 19:59:45,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {3620#false} assume !(1bv32 == ~p_dw_pc~0); {3620#false} is VALID [2022-02-20 19:59:45,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {3620#false} ~__retres1~0 := 0bv32; {3620#false} is VALID [2022-02-20 19:59:45,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {3620#false} #res := ~__retres1~0; {3620#false} is VALID [2022-02-20 19:59:45,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {3620#false} assume true; {3620#false} is VALID [2022-02-20 19:59:45,234 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3620#false} {3620#false} #1657#return; {3620#false} is VALID [2022-02-20 19:59:45,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {3620#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {3620#false} is VALID [2022-02-20 19:59:45,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {3620#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {3620#false} is VALID [2022-02-20 19:59:45,234 INFO L272 TraceCheckUtils]: 28: Hoare triple {3620#false} call #t~ret9 := is_do_read_c_triggered(); {3620#false} is VALID [2022-02-20 19:59:45,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {3620#false} havoc ~__retres1~1; {3620#false} is VALID [2022-02-20 19:59:45,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {3620#false} assume !(1bv32 == ~c_dr_pc~0); {3620#false} is VALID [2022-02-20 19:59:45,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {3620#false} ~__retres1~1 := 0bv32; {3620#false} is VALID [2022-02-20 19:59:45,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {3620#false} #res := ~__retres1~1; {3620#false} is VALID [2022-02-20 19:59:45,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {3620#false} assume true; {3620#false} is VALID [2022-02-20 19:59:45,235 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3620#false} {3620#false} #1659#return; {3620#false} is VALID [2022-02-20 19:59:45,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {3620#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {3620#false} is VALID [2022-02-20 19:59:45,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {3620#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {3620#false} is VALID [2022-02-20 19:59:45,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {3620#false} assume true; {3620#false} is VALID [2022-02-20 19:59:45,236 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3620#false} {3620#false} #1665#return; {3620#false} is VALID [2022-02-20 19:59:45,236 INFO L272 TraceCheckUtils]: 39: Hoare triple {3620#false} call reset_delta_events1(); {3620#false} is VALID [2022-02-20 19:59:45,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {3620#false} assume !(1bv32 == ~q_read_ev~0); {3620#false} is VALID [2022-02-20 19:59:45,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {3620#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {3620#false} is VALID [2022-02-20 19:59:45,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {3620#false} assume true; {3620#false} is VALID [2022-02-20 19:59:45,237 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3620#false} {3620#false} #1667#return; {3620#false} is VALID [2022-02-20 19:59:45,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2022-02-20 19:59:45,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {3620#false} start_simulation1_~kernel_st~0#1 := 1bv32;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; {3620#false} is VALID [2022-02-20 19:59:45,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2022-02-20 19:59:45,237 INFO L272 TraceCheckUtils]: 47: Hoare triple {3620#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3620#false} is VALID [2022-02-20 19:59:45,238 INFO L290 TraceCheckUtils]: 48: Hoare triple {3620#false} havoc ~__retres1~2; {3620#false} is VALID [2022-02-20 19:59:45,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {3620#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {3620#false} is VALID [2022-02-20 19:59:45,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {3620#false} #res := ~__retres1~2; {3620#false} is VALID [2022-02-20 19:59:45,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {3620#false} assume true; {3620#false} is VALID [2022-02-20 19:59:45,238 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3620#false} {3620#false} #1669#return; {3620#false} is VALID [2022-02-20 19:59:45,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {3620#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {3620#false} is VALID [2022-02-20 19:59:45,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {3620#false} assume 0bv32 != eval1_~tmp___1~0#1; {3620#false} is VALID [2022-02-20 19:59:45,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {3620#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3620#false} is VALID [2022-02-20 19:59:45,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {3620#false} assume !(0bv32 != eval1_~tmp~2#1); {3620#false} is VALID [2022-02-20 19:59:45,239 INFO L272 TraceCheckUtils]: 57: Hoare triple {3620#false} call error1(); {3620#false} is VALID [2022-02-20 19:59:45,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2022-02-20 19:59:45,240 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:45,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:45,240 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:45,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871512288] [2022-02-20 19:59:45,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871512288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:45,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:45,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:45,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893402123] [2022-02-20 19:59:45,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:45,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:45,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:45,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:45,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:45,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:45,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:45,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:45,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:45,289 INFO L87 Difference]: Start difference. First operand 520 states and 778 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:47,334 INFO L93 Difference]: Finished difference Result 914 states and 1334 transitions. [2022-02-20 19:59:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:47,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2022-02-20 19:59:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2022-02-20 19:59:47,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 915 transitions. [2022-02-20 19:59:47,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 915 edges. 915 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:48,020 INFO L225 Difference]: With dead ends: 914 [2022-02-20 19:59:48,020 INFO L226 Difference]: Without dead ends: 734 [2022-02-20 19:59:48,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:48,023 INFO L933 BasicCegarLoop]: 652 mSDtfsCounter, 425 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:48,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 1623 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:59:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2022-02-20 19:59:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 725. [2022-02-20 19:59:48,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:48,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 734 states. Second operand has 725 states, 607 states have (on average 1.4695222405271828) internal successors, (892), 622 states have internal predecessors, (892), 72 states have call successors, (72), 35 states have call predecessors, (72), 44 states have return successors, (94), 72 states have call predecessors, (94), 69 states have call successors, (94) [2022-02-20 19:59:48,070 INFO L74 IsIncluded]: Start isIncluded. First operand 734 states. Second operand has 725 states, 607 states have (on average 1.4695222405271828) internal successors, (892), 622 states have internal predecessors, (892), 72 states have call successors, (72), 35 states have call predecessors, (72), 44 states have return successors, (94), 72 states have call predecessors, (94), 69 states have call successors, (94) [2022-02-20 19:59:48,073 INFO L87 Difference]: Start difference. First operand 734 states. Second operand has 725 states, 607 states have (on average 1.4695222405271828) internal successors, (892), 622 states have internal predecessors, (892), 72 states have call successors, (72), 35 states have call predecessors, (72), 44 states have return successors, (94), 72 states have call predecessors, (94), 69 states have call successors, (94) [2022-02-20 19:59:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:48,109 INFO L93 Difference]: Finished difference Result 734 states and 1068 transitions. [2022-02-20 19:59:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1068 transitions. [2022-02-20 19:59:48,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:48,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:48,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 725 states, 607 states have (on average 1.4695222405271828) internal successors, (892), 622 states have internal predecessors, (892), 72 states have call successors, (72), 35 states have call predecessors, (72), 44 states have return successors, (94), 72 states have call predecessors, (94), 69 states have call successors, (94) Second operand 734 states. [2022-02-20 19:59:48,116 INFO L87 Difference]: Start difference. First operand has 725 states, 607 states have (on average 1.4695222405271828) internal successors, (892), 622 states have internal predecessors, (892), 72 states have call successors, (72), 35 states have call predecessors, (72), 44 states have return successors, (94), 72 states have call predecessors, (94), 69 states have call successors, (94) Second operand 734 states. [2022-02-20 19:59:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:48,139 INFO L93 Difference]: Finished difference Result 734 states and 1068 transitions. [2022-02-20 19:59:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1068 transitions. [2022-02-20 19:59:48,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:48,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:48,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:48,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 607 states have (on average 1.4695222405271828) internal successors, (892), 622 states have internal predecessors, (892), 72 states have call successors, (72), 35 states have call predecessors, (72), 44 states have return successors, (94), 72 states have call predecessors, (94), 69 states have call successors, (94) [2022-02-20 19:59:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1058 transitions. [2022-02-20 19:59:48,171 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1058 transitions. Word has length 59 [2022-02-20 19:59:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:48,172 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1058 transitions. [2022-02-20 19:59:48,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1058 transitions. [2022-02-20 19:59:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:48,173 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:48,173 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] [2022-02-20 19:59:48,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:48,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:48,381 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1076308000, now seen corresponding path program 1 times [2022-02-20 19:59:48,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:48,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663116054] [2022-02-20 19:59:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:48,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:48,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:48,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:48,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 19:59:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:48,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:48,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {7464#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {7464#true} is VALID [2022-02-20 19:59:48,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {7464#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1; {7464#true} is VALID [2022-02-20 19:59:48,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {7464#true} assume 0bv32 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {7464#true} is VALID [2022-02-20 19:59:48,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {7464#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {7464#true} is VALID [2022-02-20 19:59:48,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {7464#true} call update_channels1(); {7464#true} is VALID [2022-02-20 19:59:48,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {7464#true} assume !(1bv32 == ~q_req_up~0); {7464#true} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {7464#true} assume true; {7464#true} is VALID [2022-02-20 19:59:48,633 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7464#true} {7464#true} #1661#return; {7464#true} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {7464#true} assume { :begin_inline_init_threads1 } true; {7464#true} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {7464#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {7464#true} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {7464#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {7464#true} is VALID [2022-02-20 19:59:48,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {7464#true} assume { :end_inline_init_threads1 } true; {7464#true} is VALID [2022-02-20 19:59:48,634 INFO L272 TraceCheckUtils]: 12: Hoare triple {7464#true} call fire_delta_events1(); {7464#true} is VALID [2022-02-20 19:59:48,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {7464#true} assume !(0bv32 == ~q_read_ev~0); {7464#true} is VALID [2022-02-20 19:59:48,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {7464#true} assume !(0bv32 == ~q_write_ev~0); {7464#true} is VALID [2022-02-20 19:59:48,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {7464#true} assume true; {7464#true} is VALID [2022-02-20 19:59:48,634 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7464#true} {7464#true} #1663#return; {7464#true} is VALID [2022-02-20 19:59:48,634 INFO L272 TraceCheckUtils]: 17: Hoare triple {7464#true} call activate_threads1(); {7464#true} is VALID [2022-02-20 19:59:48,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {7464#true} havoc ~tmp~1;havoc ~tmp___0~1; {7464#true} is VALID [2022-02-20 19:59:48,635 INFO L272 TraceCheckUtils]: 19: Hoare triple {7464#true} call #t~ret8 := is_do_write_p_triggered(); {7464#true} is VALID [2022-02-20 19:59:48,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {7464#true} havoc ~__retres1~0; {7464#true} is VALID [2022-02-20 19:59:48,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {7464#true} assume !(1bv32 == ~p_dw_pc~0); {7464#true} is VALID [2022-02-20 19:59:48,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {7464#true} ~__retres1~0 := 0bv32; {7535#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:48,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {7535#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {7539#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:48,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {7539#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {7539#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:48,637 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7539#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {7464#true} #1657#return; {7546#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:48,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {7546#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {7550#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:48,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {7550#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {7465#false} is VALID [2022-02-20 19:59:48,639 INFO L272 TraceCheckUtils]: 28: Hoare triple {7465#false} call #t~ret9 := is_do_read_c_triggered(); {7465#false} is VALID [2022-02-20 19:59:48,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {7465#false} havoc ~__retres1~1; {7465#false} is VALID [2022-02-20 19:59:48,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {7465#false} assume !(1bv32 == ~c_dr_pc~0); {7465#false} is VALID [2022-02-20 19:59:48,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {7465#false} ~__retres1~1 := 0bv32; {7465#false} is VALID [2022-02-20 19:59:48,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {7465#false} #res := ~__retres1~1; {7465#false} is VALID [2022-02-20 19:59:48,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {7465#false} assume true; {7465#false} is VALID [2022-02-20 19:59:48,641 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7465#false} {7465#false} #1659#return; {7465#false} is VALID [2022-02-20 19:59:48,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {7465#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {7465#false} is VALID [2022-02-20 19:59:48,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {7465#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {7465#false} is VALID [2022-02-20 19:59:48,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {7465#false} assume true; {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7465#false} {7464#true} #1665#return; {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L272 TraceCheckUtils]: 39: Hoare triple {7465#false} call reset_delta_events1(); {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {7465#false} assume !(1bv32 == ~q_read_ev~0); {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {7465#false} assume !(1bv32 == ~q_write_ev~0); {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {7465#false} assume true; {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7465#false} {7465#false} #1667#return; {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {7465#false} assume !false; {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {7465#false} start_simulation1_~kernel_st~0#1 := 1bv32;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; {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {7465#false} assume !false; {7465#false} is VALID [2022-02-20 19:59:48,642 INFO L272 TraceCheckUtils]: 47: Hoare triple {7465#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {7465#false} havoc ~__retres1~2; {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {7465#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L290 TraceCheckUtils]: 50: Hoare triple {7465#false} #res := ~__retres1~2; {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L290 TraceCheckUtils]: 51: Hoare triple {7465#false} assume true; {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7465#false} {7465#false} #1669#return; {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {7465#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {7465#false} assume 0bv32 != eval1_~tmp___1~0#1; {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L290 TraceCheckUtils]: 55: Hoare triple {7465#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L290 TraceCheckUtils]: 56: Hoare triple {7465#false} assume !(0bv32 != eval1_~tmp~2#1); {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L272 TraceCheckUtils]: 57: Hoare triple {7465#false} call error1(); {7465#false} is VALID [2022-02-20 19:59:48,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {7465#false} assume !false; {7465#false} is VALID [2022-02-20 19:59:48,644 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:48,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:48,644 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:48,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663116054] [2022-02-20 19:59:48,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663116054] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:48,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:48,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:48,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834991990] [2022-02-20 19:59:48,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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 59 [2022-02-20 19:59:48,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:48,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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:48,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:48,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:48,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:48,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:48,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:48,682 INFO L87 Difference]: Start difference. First operand 725 states and 1058 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,082 INFO L93 Difference]: Finished difference Result 1116 states and 1591 transitions. [2022-02-20 19:59:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:50,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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 59 [2022-02-20 19:59:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2022-02-20 19:59:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2022-02-20 19:59:50,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 780 transitions. [2022-02-20 19:59:50,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 780 edges. 780 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:50,555 INFO L225 Difference]: With dead ends: 1116 [2022-02-20 19:59:50,555 INFO L226 Difference]: Without dead ends: 745 [2022-02-20 19:59:50,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:50,557 INFO L933 BasicCegarLoop]: 644 mSDtfsCounter, 7 mSDsluCounter, 2570 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3214 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:50,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 3214 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-02-20 19:59:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 735. [2022-02-20 19:59:50,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:50,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 745 states. Second operand has 735 states, 615 states have (on average 1.4601626016260163) internal successors, (898), 630 states have internal predecessors, (898), 72 states have call successors, (72), 35 states have call predecessors, (72), 46 states have return successors, (96), 74 states have call predecessors, (96), 69 states have call successors, (96) [2022-02-20 19:59:50,577 INFO L74 IsIncluded]: Start isIncluded. First operand 745 states. Second operand has 735 states, 615 states have (on average 1.4601626016260163) internal successors, (898), 630 states have internal predecessors, (898), 72 states have call successors, (72), 35 states have call predecessors, (72), 46 states have return successors, (96), 74 states have call predecessors, (96), 69 states have call successors, (96) [2022-02-20 19:59:50,578 INFO L87 Difference]: Start difference. First operand 745 states. Second operand has 735 states, 615 states have (on average 1.4601626016260163) internal successors, (898), 630 states have internal predecessors, (898), 72 states have call successors, (72), 35 states have call predecessors, (72), 46 states have return successors, (96), 74 states have call predecessors, (96), 69 states have call successors, (96) [2022-02-20 19:59:50,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,598 INFO L93 Difference]: Finished difference Result 745 states and 1082 transitions. [2022-02-20 19:59:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1082 transitions. [2022-02-20 19:59:50,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:50,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:50,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 735 states, 615 states have (on average 1.4601626016260163) internal successors, (898), 630 states have internal predecessors, (898), 72 states have call successors, (72), 35 states have call predecessors, (72), 46 states have return successors, (96), 74 states have call predecessors, (96), 69 states have call successors, (96) Second operand 745 states. [2022-02-20 19:59:50,613 INFO L87 Difference]: Start difference. First operand has 735 states, 615 states have (on average 1.4601626016260163) internal successors, (898), 630 states have internal predecessors, (898), 72 states have call successors, (72), 35 states have call predecessors, (72), 46 states have return successors, (96), 74 states have call predecessors, (96), 69 states have call successors, (96) Second operand 745 states. [2022-02-20 19:59:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:50,634 INFO L93 Difference]: Finished difference Result 745 states and 1082 transitions. [2022-02-20 19:59:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1082 transitions. [2022-02-20 19:59:50,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:50,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:50,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:50,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 615 states have (on average 1.4601626016260163) internal successors, (898), 630 states have internal predecessors, (898), 72 states have call successors, (72), 35 states have call predecessors, (72), 46 states have return successors, (96), 74 states have call predecessors, (96), 69 states have call successors, (96) [2022-02-20 19:59:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1066 transitions. [2022-02-20 19:59:50,663 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1066 transitions. Word has length 59 [2022-02-20 19:59:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:50,663 INFO L470 AbstractCegarLoop]: Abstraction has 735 states and 1066 transitions. [2022-02-20 19:59:50,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1066 transitions. [2022-02-20 19:59:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:50,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:50,665 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] [2022-02-20 19:59:50,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:50,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:50,876 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1351067614, now seen corresponding path program 1 times [2022-02-20 19:59:50,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:50,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527555426] [2022-02-20 19:59:50,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:50,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:50,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:50,878 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:50,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 19:59:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:50,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:51,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:51,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {11610#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~t5_pc~0 := 0bv32;~t6_pc~0 := 0bv32;~t7_pc~0 := 0bv32;~t8_pc~0 := 0bv32;~t9_pc~0 := 0bv32;~t10_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~t5_st~0 := 0bv32;~t6_st~0 := 0bv32;~t7_st~0 := 0bv32;~t8_st~0 := 0bv32;~t9_st~0 := 0bv32;~t10_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~t5_i~0 := 0bv32;~t6_i~0 := 0bv32;~t7_i~0 := 0bv32;~t8_i~0 := 0bv32;~t9_i~0 := 0bv32;~t10_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~T5_E~0 := 2bv32;~T6_E~0 := 2bv32;~T7_E~0 := 2bv32;~T8_E~0 := 2bv32;~T9_E~0 := 2bv32;~T10_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~E_5~0 := 2bv32;~E_6~0 := 2bv32;~E_7~0 := 2bv32;~E_8~0 := 2bv32;~E_9~0 := 2bv32;~E_10~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {11610#true} is VALID [2022-02-20 19:59:51,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {11610#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1; {11610#true} is VALID [2022-02-20 19:59:51,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {11610#true} assume 0bv32 != main_#t~nondet46#1;havoc main_#t~nondet46#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~q_free~0 := 1bv32;~q_write_ev~0 := 2bv32;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 1bv32;~c_num_read~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 1bv32; {11610#true} is VALID [2022-02-20 19:59:51,132 INFO L290 TraceCheckUtils]: 3: Hoare triple {11610#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {11610#true} is VALID [2022-02-20 19:59:51,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {11610#true} call update_channels1(); {11610#true} is VALID [2022-02-20 19:59:51,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {11610#true} assume !(1bv32 == ~q_req_up~0); {11610#true} is VALID [2022-02-20 19:59:51,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-02-20 19:59:51,132 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11610#true} {11610#true} #1661#return; {11610#true} is VALID [2022-02-20 19:59:51,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {11610#true} assume { :begin_inline_init_threads1 } true; {11610#true} is VALID [2022-02-20 19:59:51,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {11610#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {11610#true} is VALID [2022-02-20 19:59:51,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {11610#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {11610#true} is VALID [2022-02-20 19:59:51,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {11610#true} assume { :end_inline_init_threads1 } true; {11610#true} is VALID [2022-02-20 19:59:51,133 INFO L272 TraceCheckUtils]: 12: Hoare triple {11610#true} call fire_delta_events1(); {11610#true} is VALID [2022-02-20 19:59:51,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {11610#true} assume !(0bv32 == ~q_read_ev~0); {11610#true} is VALID [2022-02-20 19:59:51,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {11610#true} assume !(0bv32 == ~q_write_ev~0); {11610#true} is VALID [2022-02-20 19:59:51,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-02-20 19:59:51,133 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11610#true} {11610#true} #1663#return; {11610#true} is VALID [2022-02-20 19:59:51,133 INFO L272 TraceCheckUtils]: 17: Hoare triple {11610#true} call activate_threads1(); {11610#true} is VALID [2022-02-20 19:59:51,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {11610#true} havoc ~tmp~1;havoc ~tmp___0~1; {11610#true} is VALID [2022-02-20 19:59:51,134 INFO L272 TraceCheckUtils]: 19: Hoare triple {11610#true} call #t~ret8 := is_do_write_p_triggered(); {11610#true} is VALID [2022-02-20 19:59:51,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {11610#true} havoc ~__retres1~0; {11610#true} is VALID [2022-02-20 19:59:51,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {11610#true} assume !(1bv32 == ~p_dw_pc~0); {11610#true} is VALID [2022-02-20 19:59:51,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {11610#true} ~__retres1~0 := 0bv32; {11610#true} is VALID [2022-02-20 19:59:51,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {11610#true} #res := ~__retres1~0; {11610#true} is VALID [2022-02-20 19:59:51,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {11610#true} assume true; {11610#true} is VALID [2022-02-20 19:59:51,134 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11610#true} {11610#true} #1657#return; {11610#true} is VALID [2022-02-20 19:59:51,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {11610#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {11610#true} is VALID [2022-02-20 19:59:51,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {11610#true} assume !(0bv32 != ~tmp~1); {11610#true} is VALID [2022-02-20 19:59:51,135 INFO L272 TraceCheckUtils]: 28: Hoare triple {11610#true} call #t~ret9 := is_do_read_c_triggered(); {11610#true} is VALID [2022-02-20 19:59:51,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {11610#true} havoc ~__retres1~1; {11610#true} is VALID [2022-02-20 19:59:51,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {11610#true} assume !(1bv32 == ~c_dr_pc~0); {11610#true} is VALID [2022-02-20 19:59:51,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {11610#true} ~__retres1~1 := 0bv32; {11708#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 19:59:51,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {11708#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {11712#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:51,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {11712#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {11712#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:51,137 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11712#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {11610#true} #1659#return; {11719#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:51,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {11719#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {11723#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 19:59:51,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {11723#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {11611#false} is VALID [2022-02-20 19:59:51,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {11611#false} assume true; {11611#false} is VALID [2022-02-20 19:59:51,138 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11611#false} {11610#true} #1665#return; {11611#false} is VALID [2022-02-20 19:59:51,138 INFO L272 TraceCheckUtils]: 39: Hoare triple {11611#false} call reset_delta_events1(); {11611#false} is VALID [2022-02-20 19:59:51,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {11611#false} assume !(1bv32 == ~q_read_ev~0); {11611#false} is VALID [2022-02-20 19:59:51,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {11611#false} assume !(1bv32 == ~q_write_ev~0); {11611#false} is VALID [2022-02-20 19:59:51,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {11611#false} assume true; {11611#false} is VALID [2022-02-20 19:59:51,138 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11611#false} {11611#false} #1667#return; {11611#false} is VALID [2022-02-20 19:59:51,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {11611#false} assume !false; {11611#false} is VALID [2022-02-20 19:59:51,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {11611#false} start_simulation1_~kernel_st~0#1 := 1bv32;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; {11611#false} is VALID [2022-02-20 19:59:51,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {11611#false} assume !false; {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L272 TraceCheckUtils]: 47: Hoare triple {11611#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {11611#false} havoc ~__retres1~2; {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {11611#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {11611#false} #res := ~__retres1~2; {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {11611#false} assume true; {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11611#false} {11611#false} #1669#return; {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {11611#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {11611#false} assume 0bv32 != eval1_~tmp___1~0#1; {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L290 TraceCheckUtils]: 55: Hoare triple {11611#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {11611#false} is VALID [2022-02-20 19:59:51,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {11611#false} assume !(0bv32 != eval1_~tmp~2#1); {11611#false} is VALID [2022-02-20 19:59:51,140 INFO L272 TraceCheckUtils]: 57: Hoare triple {11611#false} call error1(); {11611#false} is VALID [2022-02-20 19:59:51,140 INFO L290 TraceCheckUtils]: 58: Hoare triple {11611#false} assume !false; {11611#false} is VALID [2022-02-20 19:59:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:51,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:51,140 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:51,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527555426] [2022-02-20 19:59:51,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527555426] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:51,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:51,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:51,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956780375] [2022-02-20 19:59:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:51,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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 59 [2022-02-20 19:59:51,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:51,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:51,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:51,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:51,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:51,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:51,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:51,182 INFO L87 Difference]: Start difference. First operand 735 states and 1066 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:52,639 INFO L93 Difference]: Finished difference Result 1130 states and 1597 transitions. [2022-02-20 19:59:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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 59 [2022-02-20 19:59:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2022-02-20 19:59:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 775 transitions. [2022-02-20 19:59:52,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 775 transitions. [2022-02-20 19:59:53,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 775 edges. 775 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:53,174 INFO L225 Difference]: With dead ends: 1130 [2022-02-20 19:59:53,175 INFO L226 Difference]: Without dead ends: 749 [2022-02-20 19:59:53,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:53,176 INFO L933 BasicCegarLoop]: 644 mSDtfsCounter, 4 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:53,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 3215 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-02-20 19:59:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 745. [2022-02-20 19:59:53,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:53,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 749 states. Second operand has 745 states, 623 states have (on average 1.4510433386837882) internal successors, (904), 638 states have internal predecessors, (904), 72 states have call successors, (72), 35 states have call predecessors, (72), 48 states have return successors, (98), 76 states have call predecessors, (98), 69 states have call successors, (98) [2022-02-20 19:59:53,196 INFO L74 IsIncluded]: Start isIncluded. First operand 749 states. Second operand has 745 states, 623 states have (on average 1.4510433386837882) internal successors, (904), 638 states have internal predecessors, (904), 72 states have call successors, (72), 35 states have call predecessors, (72), 48 states have return successors, (98), 76 states have call predecessors, (98), 69 states have call successors, (98) [2022-02-20 19:59:53,197 INFO L87 Difference]: Start difference. First operand 749 states. Second operand has 745 states, 623 states have (on average 1.4510433386837882) internal successors, (904), 638 states have internal predecessors, (904), 72 states have call successors, (72), 35 states have call predecessors, (72), 48 states have return successors, (98), 76 states have call predecessors, (98), 69 states have call successors, (98) [2022-02-20 19:59:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:53,217 INFO L93 Difference]: Finished difference Result 749 states and 1080 transitions. [2022-02-20 19:59:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1080 transitions. [2022-02-20 19:59:53,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:53,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:53,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 623 states have (on average 1.4510433386837882) internal successors, (904), 638 states have internal predecessors, (904), 72 states have call successors, (72), 35 states have call predecessors, (72), 48 states have return successors, (98), 76 states have call predecessors, (98), 69 states have call successors, (98) Second operand 749 states. [2022-02-20 19:59:53,223 INFO L87 Difference]: Start difference. First operand has 745 states, 623 states have (on average 1.4510433386837882) internal successors, (904), 638 states have internal predecessors, (904), 72 states have call successors, (72), 35 states have call predecessors, (72), 48 states have return successors, (98), 76 states have call predecessors, (98), 69 states have call successors, (98) Second operand 749 states. [2022-02-20 19:59:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:53,245 INFO L93 Difference]: Finished difference Result 749 states and 1080 transitions. [2022-02-20 19:59:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1080 transitions. [2022-02-20 19:59:53,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:53,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:53,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:53,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 623 states have (on average 1.4510433386837882) internal successors, (904), 638 states have internal predecessors, (904), 72 states have call successors, (72), 35 states have call predecessors, (72), 48 states have return successors, (98), 76 states have call predecessors, (98), 69 states have call successors, (98) [2022-02-20 19:59:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1074 transitions. [2022-02-20 19:59:53,277 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1074 transitions. Word has length 59 [2022-02-20 19:59:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:53,278 INFO L470 AbstractCegarLoop]: Abstraction has 745 states and 1074 transitions. [2022-02-20 19:59:53,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 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:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1074 transitions. [2022-02-20 19:59:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:53,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:53,279 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] [2022-02-20 19:59:53,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:53,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:53,488 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -454370720, now seen corresponding path program 1 times [2022-02-20 19:59:53,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:53,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732075663] [2022-02-20 19:59:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:53,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:53,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:53,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 19:59:53,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 19:59:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:53,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:53,729 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:53,730 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:53,730 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:53,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:53,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:53,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:53,946 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 19:59:53,948 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:54,025 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:54,026 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:59:54,029 INFO L158 Benchmark]: Toolchain (without parser) took 15141.31ms. Allocated memory was 54.5MB in the beginning and 174.1MB in the end (delta: 119.5MB). Free memory was 30.5MB in the beginning and 113.6MB in the end (delta: -83.1MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,029 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 54.5MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:54,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.88ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.3MB in the beginning and 39.1MB in the end (delta: -8.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.50ms. Allocated memory is still 67.1MB. Free memory was 39.1MB in the beginning and 33.9MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,032 INFO L158 Benchmark]: Boogie Preprocessor took 46.50ms. Allocated memory is still 67.1MB. Free memory was 33.9MB in the beginning and 29.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,033 INFO L158 Benchmark]: RCFGBuilder took 900.37ms. Allocated memory is still 67.1MB. Free memory was 29.1MB in the beginning and 37.2MB in the end (delta: -8.2MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,035 INFO L158 Benchmark]: TraceAbstraction took 13607.50ms. Allocated memory was 67.1MB in the beginning and 174.1MB in the end (delta: 107.0MB). Free memory was 36.9MB in the beginning and 113.6MB in the end (delta: -76.7MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2022-02-20 19:59:54,038 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 54.5MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.88ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.3MB in the beginning and 39.1MB in the end (delta: -8.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.50ms. Allocated memory is still 67.1MB. Free memory was 39.1MB in the beginning and 33.9MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.50ms. Allocated memory is still 67.1MB. Free memory was 33.9MB in the beginning and 29.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 900.37ms. Allocated memory is still 67.1MB. Free memory was 29.1MB in the beginning and 37.2MB in the end (delta: -8.2MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13607.50ms. Allocated memory was 67.1MB in the beginning and 174.1MB in the end (delta: 107.0MB). Free memory was 36.9MB in the beginning and 113.6MB in the end (delta: -76.7MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:59:54,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator