./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:32,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:32,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:32,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:32,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:32,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:32,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:32,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:32,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:32,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:32,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:32,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:32,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:32,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:32,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:32,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:32,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:32,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:32,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:32,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:32,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:32,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:32,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:32,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:32,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:32,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:32,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:32,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:32,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:32,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:32,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:32,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:32,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:32,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:32,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:32,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:32,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:32,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:32,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:32,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:32,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:32,430 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:58:32,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:32,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:32,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:32,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:32,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:32,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:32,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:32,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:32,460 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:32,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:32,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:32,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:32,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:32,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:32,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:32,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:32,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:32,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:32,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:32,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:32,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:32,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:32,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:32,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:32,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:32,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:32,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:32,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:32,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:32,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:32,466 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:32,466 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:32,466 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:32,466 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 -> c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c [2022-02-20 19:58:32,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:32,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:32,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:32,718 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:32,718 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:32,719 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.02.cil-1.c [2022-02-20 19:58:32,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954300cd4/0b9f860bcd0c4cbb9ffdfd6f58e2ccbd/FLAG90e725add [2022-02-20 19:58:33,138 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:33,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2022-02-20 19:58:33,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954300cd4/0b9f860bcd0c4cbb9ffdfd6f58e2ccbd/FLAG90e725add [2022-02-20 19:58:33,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/954300cd4/0b9f860bcd0c4cbb9ffdfd6f58e2ccbd [2022-02-20 19:58:33,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:33,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:33,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:33,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:33,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:33,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c24a0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33, skipping insertion in model container [2022-02-20 19:58:33,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:33,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:33,351 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.02.cil-1.c[914,927] [2022-02-20 19:58:33,395 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.02.cil-1.c[7125,7138] [2022-02-20 19:58:33,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:33,453 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:33,462 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.02.cil-1.c[914,927] [2022-02-20 19:58:33,491 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.02.cil-1.c[7125,7138] [2022-02-20 19:58:33,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:33,544 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:33,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33 WrapperNode [2022-02-20 19:58:33,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:33,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:33,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:33,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:33,550 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:58:33" (1/1) ... [2022-02-20 19:58:33,559 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:58:33" (1/1) ... [2022-02-20 19:58:33,611 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 461 [2022-02-20 19:58:33,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:33,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:33,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:33,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:33,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:33,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:33,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:33,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:33,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33" (1/1) ... [2022-02-20 19:58:33,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:33,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:33,695 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:58:33,697 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:58:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:33,721 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:33,722 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:33,722 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:33,722 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:33,722 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:33,723 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:33,723 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:33,723 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:33,727 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:33,727 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:33,727 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:33,728 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:33,728 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:33,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:33,728 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:33,729 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:33,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:33,729 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:33,729 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:33,804 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:33,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:34,331 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:34,340 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:34,344 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 19:58:34,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:34 BoogieIcfgContainer [2022-02-20 19:58:34,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:34,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:34,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:34,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:34,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:33" (1/3) ... [2022-02-20 19:58:34,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1accf83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:34, skipping insertion in model container [2022-02-20 19:58:34,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:33" (2/3) ... [2022-02-20 19:58:34,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1accf83d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:34, skipping insertion in model container [2022-02-20 19:58:34,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:34" (3/3) ... [2022-02-20 19:58:34,356 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2022-02-20 19:58:34,364 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:34,364 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:34,398 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:34,403 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:58:34,403 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:58:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:34,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:34,436 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:58:34,437 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 381071048, now seen corresponding path program 1 times [2022-02-20 19:58:34,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:34,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94785261] [2022-02-20 19:58:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:34,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:34,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:34,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(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); {237#true} is VALID [2022-02-20 19:58:34,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {237#true} {239#(= ~p_dw_i~0 1)} #765#return; {239#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:58:34,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:34,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {278#(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; {237#true} is VALID [2022-02-20 19:58:34,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume !(0 == ~q_write_ev~0); {237#true} is VALID [2022-02-20 19:58:34,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {237#true} {238#false} #767#return; {238#false} is VALID [2022-02-20 19:58:34,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:34,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#true} havoc ~__retres1~0; {237#true} is VALID [2022-02-20 19:58:34,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume 1 == ~p_dw_pc~0; {237#true} is VALID [2022-02-20 19:58:34,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {237#true} is VALID [2022-02-20 19:58:34,730 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#true} #res := ~__retres1~0; {237#true} is VALID [2022-02-20 19:58:34,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,731 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {237#true} {237#true} #761#return; {237#true} is VALID [2022-02-20 19:58:34,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:34,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#true} havoc ~__retres1~1; {237#true} is VALID [2022-02-20 19:58:34,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume 1 == ~c_dr_pc~0; {237#true} is VALID [2022-02-20 19:58:34,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {237#true} is VALID [2022-02-20 19:58:34,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#true} #res := ~__retres1~1; {237#true} is VALID [2022-02-20 19:58:34,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,742 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {237#true} {237#true} #763#return; {237#true} is VALID [2022-02-20 19:58:34,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {279#(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; {237#true} is VALID [2022-02-20 19:58:34,742 INFO L272 TraceCheckUtils]: 1: Hoare triple {237#true} call #t~ret8 := is_do_write_p_triggered(); {237#true} is VALID [2022-02-20 19:58:34,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} havoc ~__retres1~0; {237#true} is VALID [2022-02-20 19:58:34,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#true} assume 1 == ~p_dw_pc~0; {237#true} is VALID [2022-02-20 19:58:34,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {237#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {237#true} is VALID [2022-02-20 19:58:34,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {237#true} #res := ~__retres1~0; {237#true} is VALID [2022-02-20 19:58:34,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,745 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {237#true} {237#true} #761#return; {237#true} is VALID [2022-02-20 19:58:34,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {237#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {237#true} is VALID [2022-02-20 19:58:34,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {237#true} is VALID [2022-02-20 19:58:34,745 INFO L272 TraceCheckUtils]: 10: Hoare triple {237#true} call #t~ret9 := is_do_read_c_triggered(); {237#true} is VALID [2022-02-20 19:58:34,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#true} havoc ~__retres1~1; {237#true} is VALID [2022-02-20 19:58:34,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {237#true} assume 1 == ~c_dr_pc~0; {237#true} is VALID [2022-02-20 19:58:34,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {237#true} is VALID [2022-02-20 19:58:34,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {237#true} #res := ~__retres1~1; {237#true} is VALID [2022-02-20 19:58:34,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,747 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {237#true} {237#true} #763#return; {237#true} is VALID [2022-02-20 19:58:34,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {237#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {237#true} is VALID [2022-02-20 19:58:34,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {237#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {237#true} is VALID [2022-02-20 19:58:34,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,749 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {237#true} {238#false} #769#return; {238#false} is VALID [2022-02-20 19:58:34,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:34,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {278#(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; {237#true} is VALID [2022-02-20 19:58:34,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {237#true} is VALID [2022-02-20 19:58:34,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {237#true} {238#false} #771#return; {238#false} is VALID [2022-02-20 19:58:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:34,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#true} havoc ~__retres1~2; {237#true} is VALID [2022-02-20 19:58:34,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {237#true} is VALID [2022-02-20 19:58:34,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} #res := ~__retres1~2; {237#true} is VALID [2022-02-20 19:58:34,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,779 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {237#true} {238#false} #773#return; {238#false} is VALID [2022-02-20 19:58:34,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {237#true} is VALID [2022-02-20 19:58:34,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {237#true} is VALID [2022-02-20 19:58:34,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {239#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:58:34,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {239#(= ~p_dw_i~0 1)} 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; {239#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:58:34,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#(= ~p_dw_i~0 1)} call update_channels1(); {277#(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:58:34,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#(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); {237#true} is VALID [2022-02-20 19:58:34,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,788 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {237#true} {239#(= ~p_dw_i~0 1)} #765#return; {239#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:58:34,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#(= ~p_dw_i~0 1)} assume { :begin_inline_init_threads1 } true; {239#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:58:34,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#(= ~p_dw_i~0 1)} assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; {238#false} is VALID [2022-02-20 19:58:34,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {238#false} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {238#false} is VALID [2022-02-20 19:58:34,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {238#false} assume { :end_inline_init_threads1 } true; {238#false} is VALID [2022-02-20 19:58:34,790 INFO L272 TraceCheckUtils]: 12: Hoare triple {238#false} call fire_delta_events1(); {278#(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:58:34,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {278#(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; {237#true} is VALID [2022-02-20 19:58:34,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {237#true} assume !(0 == ~q_write_ev~0); {237#true} is VALID [2022-02-20 19:58:34,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,791 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {237#true} {238#false} #767#return; {238#false} is VALID [2022-02-20 19:58:34,791 INFO L272 TraceCheckUtils]: 17: Hoare triple {238#false} call activate_threads1(); {279#(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:58:34,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {279#(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; {237#true} is VALID [2022-02-20 19:58:34,791 INFO L272 TraceCheckUtils]: 19: Hoare triple {237#true} call #t~ret8 := is_do_write_p_triggered(); {237#true} is VALID [2022-02-20 19:58:34,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {237#true} havoc ~__retres1~0; {237#true} is VALID [2022-02-20 19:58:34,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {237#true} assume 1 == ~p_dw_pc~0; {237#true} is VALID [2022-02-20 19:58:34,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {237#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {237#true} is VALID [2022-02-20 19:58:34,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {237#true} #res := ~__retres1~0; {237#true} is VALID [2022-02-20 19:58:34,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,793 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {237#true} {237#true} #761#return; {237#true} is VALID [2022-02-20 19:58:34,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {237#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {237#true} is VALID [2022-02-20 19:58:34,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {237#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {237#true} is VALID [2022-02-20 19:58:34,794 INFO L272 TraceCheckUtils]: 28: Hoare triple {237#true} call #t~ret9 := is_do_read_c_triggered(); {237#true} is VALID [2022-02-20 19:58:34,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {237#true} havoc ~__retres1~1; {237#true} is VALID [2022-02-20 19:58:34,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {237#true} assume 1 == ~c_dr_pc~0; {237#true} is VALID [2022-02-20 19:58:34,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {237#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {237#true} is VALID [2022-02-20 19:58:34,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {237#true} #res := ~__retres1~1; {237#true} is VALID [2022-02-20 19:58:34,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,795 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {237#true} {237#true} #763#return; {237#true} is VALID [2022-02-20 19:58:34,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {237#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {237#true} is VALID [2022-02-20 19:58:34,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {237#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {237#true} is VALID [2022-02-20 19:58:34,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,797 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {237#true} {238#false} #769#return; {238#false} is VALID [2022-02-20 19:58:34,797 INFO L272 TraceCheckUtils]: 39: Hoare triple {238#false} call reset_delta_events1(); {278#(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:58:34,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {278#(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; {237#true} is VALID [2022-02-20 19:58:34,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {237#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {237#true} is VALID [2022-02-20 19:58:34,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,798 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {237#true} {238#false} #771#return; {238#false} is VALID [2022-02-20 19:58:34,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {238#false} assume !false; {238#false} is VALID [2022-02-20 19:58:34,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {238#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; {238#false} is VALID [2022-02-20 19:58:34,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {238#false} assume !false; {238#false} is VALID [2022-02-20 19:58:34,799 INFO L272 TraceCheckUtils]: 47: Hoare triple {238#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {237#true} is VALID [2022-02-20 19:58:34,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {237#true} havoc ~__retres1~2; {237#true} is VALID [2022-02-20 19:58:34,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {237#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {237#true} is VALID [2022-02-20 19:58:34,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {237#true} #res := ~__retres1~2; {237#true} is VALID [2022-02-20 19:58:34,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {237#true} assume true; {237#true} is VALID [2022-02-20 19:58:34,806 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {237#true} {238#false} #773#return; {238#false} is VALID [2022-02-20 19:58:34,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {238#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; {238#false} is VALID [2022-02-20 19:58:34,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {238#false} assume 0 != eval1_~tmp___1~0#1; {238#false} is VALID [2022-02-20 19:58:34,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {238#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; {238#false} is VALID [2022-02-20 19:58:34,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {238#false} assume !(0 != eval1_~tmp~2#1); {238#false} is VALID [2022-02-20 19:58:34,808 INFO L272 TraceCheckUtils]: 57: Hoare triple {238#false} call error1(); {238#false} is VALID [2022-02-20 19:58:34,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {238#false} assume !false; {238#false} is VALID [2022-02-20 19:58:34,809 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:58:34,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:34,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94785261] [2022-02-20 19:58:34,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94785261] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:34,811 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:34,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:34,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160866294] [2022-02-20 19:58:34,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:34,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:58:34,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:34,827 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), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:34,891 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:58:34,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:34,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:34,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:34,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:34,924 INFO L87 Difference]: Start difference. First operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:36,266 INFO L93 Difference]: Finished difference Result 469 states and 703 transitions. [2022-02-20 19:58:36,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:58:36,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-02-20 19:58:36,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 703 transitions. [2022-02-20 19:58:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 703 transitions. [2022-02-20 19:58:36,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 703 transitions. [2022-02-20 19:58:36,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 703 edges. 703 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:36,881 INFO L225 Difference]: With dead ends: 469 [2022-02-20 19:58:36,881 INFO L226 Difference]: Without dead ends: 242 [2022-02-20 19:58:36,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:36,888 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 459 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:36,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 708 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-02-20 19:58:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 224. [2022-02-20 19:58:36,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:36,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:58:36,932 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:58:36,934 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:58:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:36,948 INFO L93 Difference]: Finished difference Result 242 states and 345 transitions. [2022-02-20 19:58:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2022-02-20 19:58:36,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:36,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:36,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 242 states. [2022-02-20 19:58:36,953 INFO L87 Difference]: Start difference. First operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 242 states. [2022-02-20 19:58:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:36,966 INFO L93 Difference]: Finished difference Result 242 states and 345 transitions. [2022-02-20 19:58:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2022-02-20 19:58:36,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:36,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:36,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:36,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:58:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 317 transitions. [2022-02-20 19:58:36,980 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 317 transitions. Word has length 59 [2022-02-20 19:58:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:36,980 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 317 transitions. [2022-02-20 19:58:36,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2022-02-20 19:58:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:36,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:36,982 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:58:36,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:36,983 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:36,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash 862151306, now seen corresponding path program 1 times [2022-02-20 19:58:36,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:36,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813952461] [2022-02-20 19:58:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {1786#(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); {1787#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:37,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {1787#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:37,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1787#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {1748#(= ~q_read_ev~0 2)} #765#return; {1748#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:37,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {1788#(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; {1789#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:37,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1789#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {1789#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:37,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {1789#(= |old(~q_read_ev~0)| 0)} assume true; {1789#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:37,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1789#(= |old(~q_read_ev~0)| 0)} {1748#(= ~q_read_ev~0 2)} #767#return; {1747#false} is VALID [2022-02-20 19:58:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#true} havoc ~__retres1~0; {1746#true} is VALID [2022-02-20 19:58:37,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#true} assume 1 == ~p_dw_pc~0; {1746#true} is VALID [2022-02-20 19:58:37,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {1746#true} is VALID [2022-02-20 19:58:37,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {1746#true} #res := ~__retres1~0; {1746#true} is VALID [2022-02-20 19:58:37,126 INFO L290 TraceCheckUtils]: 4: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,126 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1746#true} {1746#true} #761#return; {1746#true} is VALID [2022-02-20 19:58:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#true} havoc ~__retres1~1; {1746#true} is VALID [2022-02-20 19:58:37,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#true} assume 1 == ~c_dr_pc~0; {1746#true} is VALID [2022-02-20 19:58:37,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {1746#true} is VALID [2022-02-20 19:58:37,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {1746#true} #res := ~__retres1~1; {1746#true} is VALID [2022-02-20 19:58:37,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,152 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1746#true} {1746#true} #763#return; {1746#true} is VALID [2022-02-20 19:58:37,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {1790#(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; {1746#true} is VALID [2022-02-20 19:58:37,152 INFO L272 TraceCheckUtils]: 1: Hoare triple {1746#true} call #t~ret8 := is_do_write_p_triggered(); {1746#true} is VALID [2022-02-20 19:58:37,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#true} havoc ~__retres1~0; {1746#true} is VALID [2022-02-20 19:58:37,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {1746#true} assume 1 == ~p_dw_pc~0; {1746#true} is VALID [2022-02-20 19:58:37,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {1746#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {1746#true} is VALID [2022-02-20 19:58:37,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {1746#true} #res := ~__retres1~0; {1746#true} is VALID [2022-02-20 19:58:37,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,156 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1746#true} {1746#true} #761#return; {1746#true} is VALID [2022-02-20 19:58:37,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {1746#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {1746#true} is VALID [2022-02-20 19:58:37,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {1746#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {1746#true} is VALID [2022-02-20 19:58:37,157 INFO L272 TraceCheckUtils]: 10: Hoare triple {1746#true} call #t~ret9 := is_do_read_c_triggered(); {1746#true} is VALID [2022-02-20 19:58:37,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {1746#true} havoc ~__retres1~1; {1746#true} is VALID [2022-02-20 19:58:37,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {1746#true} assume 1 == ~c_dr_pc~0; {1746#true} is VALID [2022-02-20 19:58:37,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {1746#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {1746#true} is VALID [2022-02-20 19:58:37,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {1746#true} #res := ~__retres1~1; {1746#true} is VALID [2022-02-20 19:58:37,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,158 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1746#true} {1746#true} #763#return; {1746#true} is VALID [2022-02-20 19:58:37,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {1746#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {1746#true} is VALID [2022-02-20 19:58:37,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {1746#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {1746#true} is VALID [2022-02-20 19:58:37,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,159 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1746#true} {1747#false} #769#return; {1747#false} is VALID [2022-02-20 19:58:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {1788#(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; {1746#true} is VALID [2022-02-20 19:58:37,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {1746#true} is VALID [2022-02-20 19:58:37,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1746#true} {1747#false} #771#return; {1747#false} is VALID [2022-02-20 19:58:37,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:37,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#true} havoc ~__retres1~2; {1746#true} is VALID [2022-02-20 19:58:37,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1746#true} is VALID [2022-02-20 19:58:37,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#true} #res := ~__retres1~2; {1746#true} is VALID [2022-02-20 19:58:37,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,169 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1746#true} {1747#false} #773#return; {1747#false} is VALID [2022-02-20 19:58:37,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {1746#true} is VALID [2022-02-20 19:58:37,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {1746#true} is VALID [2022-02-20 19:58:37,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {1748#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:37,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {1748#(= ~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; {1748#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:37,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {1748#(= ~q_read_ev~0 2)} call update_channels1(); {1786#(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:58:37,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {1786#(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); {1787#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:37,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {1787#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {1787#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:37,173 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1787#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {1748#(= ~q_read_ev~0 2)} #765#return; {1748#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:37,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {1748#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {1748#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:37,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {1748#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {1748#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:37,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {1748#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {1748#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:37,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {1748#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {1748#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:37,175 INFO L272 TraceCheckUtils]: 12: Hoare triple {1748#(= ~q_read_ev~0 2)} call fire_delta_events1(); {1788#(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:58:37,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {1788#(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; {1789#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:37,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {1789#(= |old(~q_read_ev~0)| 0)} assume !(0 == ~q_write_ev~0); {1789#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:37,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {1789#(= |old(~q_read_ev~0)| 0)} assume true; {1789#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:37,177 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1789#(= |old(~q_read_ev~0)| 0)} {1748#(= ~q_read_ev~0 2)} #767#return; {1747#false} is VALID [2022-02-20 19:58:37,177 INFO L272 TraceCheckUtils]: 17: Hoare triple {1747#false} call activate_threads1(); {1790#(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:58:37,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {1790#(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; {1746#true} is VALID [2022-02-20 19:58:37,178 INFO L272 TraceCheckUtils]: 19: Hoare triple {1746#true} call #t~ret8 := is_do_write_p_triggered(); {1746#true} is VALID [2022-02-20 19:58:37,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {1746#true} havoc ~__retres1~0; {1746#true} is VALID [2022-02-20 19:58:37,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {1746#true} assume 1 == ~p_dw_pc~0; {1746#true} is VALID [2022-02-20 19:58:37,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {1746#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {1746#true} is VALID [2022-02-20 19:58:37,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {1746#true} #res := ~__retres1~0; {1746#true} is VALID [2022-02-20 19:58:37,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,179 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1746#true} {1746#true} #761#return; {1746#true} is VALID [2022-02-20 19:58:37,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {1746#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {1746#true} is VALID [2022-02-20 19:58:37,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {1746#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {1746#true} is VALID [2022-02-20 19:58:37,180 INFO L272 TraceCheckUtils]: 28: Hoare triple {1746#true} call #t~ret9 := is_do_read_c_triggered(); {1746#true} is VALID [2022-02-20 19:58:37,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {1746#true} havoc ~__retres1~1; {1746#true} is VALID [2022-02-20 19:58:37,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {1746#true} assume 1 == ~c_dr_pc~0; {1746#true} is VALID [2022-02-20 19:58:37,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {1746#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {1746#true} is VALID [2022-02-20 19:58:37,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {1746#true} #res := ~__retres1~1; {1746#true} is VALID [2022-02-20 19:58:37,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,181 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1746#true} {1746#true} #763#return; {1746#true} is VALID [2022-02-20 19:58:37,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {1746#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {1746#true} is VALID [2022-02-20 19:58:37,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {1746#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {1746#true} is VALID [2022-02-20 19:58:37,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,182 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1746#true} {1747#false} #769#return; {1747#false} is VALID [2022-02-20 19:58:37,182 INFO L272 TraceCheckUtils]: 39: Hoare triple {1747#false} call reset_delta_events1(); {1788#(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:58:37,182 INFO L290 TraceCheckUtils]: 40: Hoare triple {1788#(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; {1746#true} is VALID [2022-02-20 19:58:37,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {1746#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {1746#true} is VALID [2022-02-20 19:58:37,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,183 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1746#true} {1747#false} #771#return; {1747#false} is VALID [2022-02-20 19:58:37,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {1747#false} assume !false; {1747#false} is VALID [2022-02-20 19:58:37,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {1747#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; {1747#false} is VALID [2022-02-20 19:58:37,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {1747#false} assume !false; {1747#false} is VALID [2022-02-20 19:58:37,183 INFO L272 TraceCheckUtils]: 47: Hoare triple {1747#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {1746#true} is VALID [2022-02-20 19:58:37,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {1746#true} havoc ~__retres1~2; {1746#true} is VALID [2022-02-20 19:58:37,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {1746#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {1746#true} is VALID [2022-02-20 19:58:37,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {1746#true} #res := ~__retres1~2; {1746#true} is VALID [2022-02-20 19:58:37,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {1746#true} assume true; {1746#true} is VALID [2022-02-20 19:58:37,184 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1746#true} {1747#false} #773#return; {1747#false} is VALID [2022-02-20 19:58:37,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {1747#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; {1747#false} is VALID [2022-02-20 19:58:37,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {1747#false} assume 0 != eval1_~tmp___1~0#1; {1747#false} is VALID [2022-02-20 19:58:37,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {1747#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; {1747#false} is VALID [2022-02-20 19:58:37,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {1747#false} assume !(0 != eval1_~tmp~2#1); {1747#false} is VALID [2022-02-20 19:58:37,185 INFO L272 TraceCheckUtils]: 57: Hoare triple {1747#false} call error1(); {1747#false} is VALID [2022-02-20 19:58:37,185 INFO L290 TraceCheckUtils]: 58: Hoare triple {1747#false} assume !false; {1747#false} is VALID [2022-02-20 19:58:37,186 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:58:37,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:37,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813952461] [2022-02-20 19:58:37,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813952461] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:37,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:37,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:37,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105881721] [2022-02-20 19:58:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:37,189 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:58:37,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:37,189 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:58:37,232 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:58:37,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:37,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:37,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:37,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:37,234 INFO L87 Difference]: Start difference. First operand 224 states and 317 transitions. 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:58:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:39,177 INFO L93 Difference]: Finished difference Result 449 states and 633 transitions. [2022-02-20 19:58:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:39,178 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:58:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:39,178 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:58:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 633 transitions. [2022-02-20 19:58:39,188 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:58:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 633 transitions. [2022-02-20 19:58:39,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 633 transitions. [2022-02-20 19:58:39,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:39,724 INFO L225 Difference]: With dead ends: 449 [2022-02-20 19:58:39,724 INFO L226 Difference]: Without dead ends: 360 [2022-02-20 19:58:39,725 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:58:39,726 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 596 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:39,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 891 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:58:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-02-20 19:58:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 320. [2022-02-20 19:58:39,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:39,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:58:39,758 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:58:39,759 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:58:39,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:39,777 INFO L93 Difference]: Finished difference Result 360 states and 503 transitions. [2022-02-20 19:58:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 503 transitions. [2022-02-20 19:58:39,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:39,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:39,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) Second operand 360 states. [2022-02-20 19:58:39,781 INFO L87 Difference]: Start difference. First operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) Second operand 360 states. [2022-02-20 19:58:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:39,797 INFO L93 Difference]: Finished difference Result 360 states and 503 transitions. [2022-02-20 19:58:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 503 transitions. [2022-02-20 19:58:39,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:39,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:39,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:39,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:58:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2022-02-20 19:58:39,814 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 59 [2022-02-20 19:58:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:39,815 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2022-02-20 19:58:39,815 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:58:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2022-02-20 19:58:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:39,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:39,817 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:58:39,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:39,817 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:39,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1624800937, now seen corresponding path program 1 times [2022-02-20 19:58:39,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:39,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242275432] [2022-02-20 19:58:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {3643#(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); {3604#true} is VALID [2022-02-20 19:58:39,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:39,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3604#true} {3604#true} #765#return; {3604#true} is VALID [2022-02-20 19:58:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {3644#(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); {3604#true} is VALID [2022-02-20 19:58:39,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {3604#true} assume !(0 == ~q_write_ev~0); {3604#true} is VALID [2022-02-20 19:58:39,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:39,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3604#true} {3604#true} #767#return; {3604#true} is VALID [2022-02-20 19:58:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {3604#true} havoc ~__retres1~0; {3604#true} is VALID [2022-02-20 19:58:39,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {3604#true} assume !(1 == ~p_dw_pc~0); {3604#true} is VALID [2022-02-20 19:58:39,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {3604#true} ~__retres1~0 := 0; {3660#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:39,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {3660#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,974 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {3604#true} #761#return; {3652#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {3604#true} havoc ~__retres1~1; {3604#true} is VALID [2022-02-20 19:58:39,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {3604#true} assume 1 == ~c_dr_pc~0; {3604#true} is VALID [2022-02-20 19:58:39,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {3604#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3604#true} is VALID [2022-02-20 19:58:39,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {3604#true} #res := ~__retres1~1; {3604#true} is VALID [2022-02-20 19:58:39,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:39,980 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3604#true} {3605#false} #763#return; {3605#false} is VALID [2022-02-20 19:58:39,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {3645#(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; {3604#true} is VALID [2022-02-20 19:58:39,980 INFO L272 TraceCheckUtils]: 1: Hoare triple {3604#true} call #t~ret8 := is_do_write_p_triggered(); {3604#true} is VALID [2022-02-20 19:58:39,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {3604#true} havoc ~__retres1~0; {3604#true} is VALID [2022-02-20 19:58:39,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {3604#true} assume !(1 == ~p_dw_pc~0); {3604#true} is VALID [2022-02-20 19:58:39,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {3604#true} ~__retres1~0 := 0; {3660#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:39,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {3660#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,988 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {3604#true} #761#return; {3652#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:39,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {3652#(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; {3653#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:39,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {3653#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3605#false} is VALID [2022-02-20 19:58:39,989 INFO L272 TraceCheckUtils]: 10: Hoare triple {3605#false} call #t~ret9 := is_do_read_c_triggered(); {3604#true} is VALID [2022-02-20 19:58:39,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {3604#true} havoc ~__retres1~1; {3604#true} is VALID [2022-02-20 19:58:39,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {3604#true} assume 1 == ~c_dr_pc~0; {3604#true} is VALID [2022-02-20 19:58:39,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {3604#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3604#true} is VALID [2022-02-20 19:58:39,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {3604#true} #res := ~__retres1~1; {3604#true} is VALID [2022-02-20 19:58:39,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:39,990 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3604#true} {3605#false} #763#return; {3605#false} is VALID [2022-02-20 19:58:39,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {3605#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3605#false} is VALID [2022-02-20 19:58:39,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {3605#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3605#false} is VALID [2022-02-20 19:58:39,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {3605#false} assume true; {3605#false} is VALID [2022-02-20 19:58:39,991 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3605#false} {3604#true} #769#return; {3605#false} is VALID [2022-02-20 19:58:39,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {3644#(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); {3604#true} is VALID [2022-02-20 19:58:39,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {3604#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3604#true} is VALID [2022-02-20 19:58:39,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:39,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3604#true} {3605#false} #771#return; {3605#false} is VALID [2022-02-20 19:58:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {3604#true} havoc ~__retres1~2; {3604#true} is VALID [2022-02-20 19:58:40,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {3604#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3604#true} is VALID [2022-02-20 19:58:40,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {3604#true} #res := ~__retres1~2; {3604#true} is VALID [2022-02-20 19:58:40,000 INFO L290 TraceCheckUtils]: 3: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:40,001 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3604#true} {3605#false} #773#return; {3605#false} is VALID [2022-02-20 19:58:40,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {3604#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {3604#true} is VALID [2022-02-20 19:58:40,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {3604#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {3604#true} is VALID [2022-02-20 19:58:40,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {3604#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {3604#true} is VALID [2022-02-20 19:58:40,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {3604#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; {3604#true} is VALID [2022-02-20 19:58:40,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {3604#true} call update_channels1(); {3643#(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:58:40,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {3643#(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); {3604#true} is VALID [2022-02-20 19:58:40,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:40,003 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3604#true} {3604#true} #765#return; {3604#true} is VALID [2022-02-20 19:58:40,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {3604#true} assume { :begin_inline_init_threads1 } true; {3604#true} is VALID [2022-02-20 19:58:40,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {3604#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3604#true} is VALID [2022-02-20 19:58:40,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {3604#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3604#true} is VALID [2022-02-20 19:58:40,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {3604#true} assume { :end_inline_init_threads1 } true; {3604#true} is VALID [2022-02-20 19:58:40,004 INFO L272 TraceCheckUtils]: 12: Hoare triple {3604#true} call fire_delta_events1(); {3644#(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:58:40,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {3644#(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); {3604#true} is VALID [2022-02-20 19:58:40,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {3604#true} assume !(0 == ~q_write_ev~0); {3604#true} is VALID [2022-02-20 19:58:40,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:40,005 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3604#true} {3604#true} #767#return; {3604#true} is VALID [2022-02-20 19:58:40,005 INFO L272 TraceCheckUtils]: 17: Hoare triple {3604#true} call activate_threads1(); {3645#(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:58:40,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {3645#(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; {3604#true} is VALID [2022-02-20 19:58:40,006 INFO L272 TraceCheckUtils]: 19: Hoare triple {3604#true} call #t~ret8 := is_do_write_p_triggered(); {3604#true} is VALID [2022-02-20 19:58:40,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {3604#true} havoc ~__retres1~0; {3604#true} is VALID [2022-02-20 19:58:40,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {3604#true} assume !(1 == ~p_dw_pc~0); {3604#true} is VALID [2022-02-20 19:58:40,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {3604#true} ~__retres1~0 := 0; {3660#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:40,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {3660#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:40,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:40,008 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3661#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {3604#true} #761#return; {3652#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:40,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {3652#(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; {3653#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:40,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {3653#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3605#false} is VALID [2022-02-20 19:58:40,009 INFO L272 TraceCheckUtils]: 28: Hoare triple {3605#false} call #t~ret9 := is_do_read_c_triggered(); {3604#true} is VALID [2022-02-20 19:58:40,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {3604#true} havoc ~__retres1~1; {3604#true} is VALID [2022-02-20 19:58:40,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {3604#true} assume 1 == ~c_dr_pc~0; {3604#true} is VALID [2022-02-20 19:58:40,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {3604#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3604#true} is VALID [2022-02-20 19:58:40,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {3604#true} #res := ~__retres1~1; {3604#true} is VALID [2022-02-20 19:58:40,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:40,010 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3604#true} {3605#false} #763#return; {3605#false} is VALID [2022-02-20 19:58:40,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {3605#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3605#false} is VALID [2022-02-20 19:58:40,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {3605#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3605#false} is VALID [2022-02-20 19:58:40,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {3605#false} assume true; {3605#false} is VALID [2022-02-20 19:58:40,011 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3605#false} {3604#true} #769#return; {3605#false} is VALID [2022-02-20 19:58:40,011 INFO L272 TraceCheckUtils]: 39: Hoare triple {3605#false} call reset_delta_events1(); {3644#(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:58:40,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {3644#(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); {3604#true} is VALID [2022-02-20 19:58:40,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {3604#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3604#true} is VALID [2022-02-20 19:58:40,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:40,012 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3604#true} {3605#false} #771#return; {3605#false} is VALID [2022-02-20 19:58:40,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {3605#false} assume !false; {3605#false} is VALID [2022-02-20 19:58:40,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {3605#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; {3605#false} is VALID [2022-02-20 19:58:40,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {3605#false} assume !false; {3605#false} is VALID [2022-02-20 19:58:40,013 INFO L272 TraceCheckUtils]: 47: Hoare triple {3605#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3604#true} is VALID [2022-02-20 19:58:40,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {3604#true} havoc ~__retres1~2; {3604#true} is VALID [2022-02-20 19:58:40,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {3604#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3604#true} is VALID [2022-02-20 19:58:40,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {3604#true} #res := ~__retres1~2; {3604#true} is VALID [2022-02-20 19:58:40,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {3604#true} assume true; {3604#true} is VALID [2022-02-20 19:58:40,013 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3604#true} {3605#false} #773#return; {3605#false} is VALID [2022-02-20 19:58:40,014 INFO L290 TraceCheckUtils]: 53: Hoare triple {3605#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; {3605#false} is VALID [2022-02-20 19:58:40,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {3605#false} assume 0 != eval1_~tmp___1~0#1; {3605#false} is VALID [2022-02-20 19:58:40,014 INFO L290 TraceCheckUtils]: 55: Hoare triple {3605#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; {3605#false} is VALID [2022-02-20 19:58:40,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {3605#false} assume !(0 != eval1_~tmp~2#1); {3605#false} is VALID [2022-02-20 19:58:40,014 INFO L272 TraceCheckUtils]: 57: Hoare triple {3605#false} call error1(); {3605#false} is VALID [2022-02-20 19:58:40,014 INFO L290 TraceCheckUtils]: 58: Hoare triple {3605#false} assume !false; {3605#false} is VALID [2022-02-20 19:58:40,015 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:58:40,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:40,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242275432] [2022-02-20 19:58:40,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242275432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:40,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:40,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:40,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604519716] [2022-02-20 19:58:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:40,017 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:58:40,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:40,018 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:58:40,055 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:58:40,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:40,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:40,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:40,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:40,058 INFO L87 Difference]: Start difference. First operand 320 states and 448 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:58:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:42,153 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2022-02-20 19:58:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:42,154 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:58:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:42,154 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:58:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 474 transitions. [2022-02-20 19:58:42,162 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:58:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 474 transitions. [2022-02-20 19:58:42,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 474 transitions. [2022-02-20 19:58:42,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:42,495 INFO L225 Difference]: With dead ends: 535 [2022-02-20 19:58:42,495 INFO L226 Difference]: Without dead ends: 357 [2022-02-20 19:58:42,496 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:58:42,497 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 250 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:42,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 1371 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:58:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-02-20 19:58:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 325. [2022-02-20 19:58:42,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:42,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:58:42,534 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:58:42,535 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:58:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:42,549 INFO L93 Difference]: Finished difference Result 357 states and 498 transitions. [2022-02-20 19:58:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 498 transitions. [2022-02-20 19:58:42,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:42,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:42,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) Second operand 357 states. [2022-02-20 19:58:42,553 INFO L87 Difference]: Start difference. First operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) Second operand 357 states. [2022-02-20 19:58:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:42,567 INFO L93 Difference]: Finished difference Result 357 states and 498 transitions. [2022-02-20 19:58:42,568 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 498 transitions. [2022-02-20 19:58:42,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:42,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:42,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:42,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:58:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 452 transitions. [2022-02-20 19:58:42,585 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 452 transitions. Word has length 59 [2022-02-20 19:58:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:42,585 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 452 transitions. [2022-02-20 19:58:42,586 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:58:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 452 transitions. [2022-02-20 19:58:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:42,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:42,587 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:58:42,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:42,587 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1899560551, now seen corresponding path program 1 times [2022-02-20 19:58:42,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:42,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000886805] [2022-02-20 19:58:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {5610#(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); {5611#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:42,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {5611#(not (= |old(~q_req_up~0)| 1))} assume true; {5611#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:42,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5611#(not (= |old(~q_req_up~0)| 1))} {5571#(= ~c_dr_pc~0 ~q_req_up~0)} #765#return; {5575#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {5612#(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); {5568#true} is VALID [2022-02-20 19:58:42,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {5568#true} assume !(0 == ~q_write_ev~0); {5568#true} is VALID [2022-02-20 19:58:42,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-02-20 19:58:42,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5568#true} {5575#(not (= ~c_dr_pc~0 1))} #767#return; {5575#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:42,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {5568#true} havoc ~__retres1~0; {5568#true} is VALID [2022-02-20 19:58:42,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {5568#true} assume !(1 == ~p_dw_pc~0); {5568#true} is VALID [2022-02-20 19:58:42,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {5568#true} ~__retres1~0 := 0; {5568#true} is VALID [2022-02-20 19:58:42,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {5568#true} #res := ~__retres1~0; {5568#true} is VALID [2022-02-20 19:58:42,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-02-20 19:58:42,684 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5568#true} {5568#true} #761#return; {5568#true} is VALID [2022-02-20 19:58:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {5568#true} havoc ~__retres1~1; {5568#true} is VALID [2022-02-20 19:58:42,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {5568#true} assume 1 == ~c_dr_pc~0; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,700 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} {5568#true} #763#return; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {5613#(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; {5568#true} is VALID [2022-02-20 19:58:42,700 INFO L272 TraceCheckUtils]: 1: Hoare triple {5568#true} call #t~ret8 := is_do_write_p_triggered(); {5568#true} is VALID [2022-02-20 19:58:42,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {5568#true} havoc ~__retres1~0; {5568#true} is VALID [2022-02-20 19:58:42,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {5568#true} assume !(1 == ~p_dw_pc~0); {5568#true} is VALID [2022-02-20 19:58:42,701 INFO L290 TraceCheckUtils]: 4: Hoare triple {5568#true} ~__retres1~0 := 0; {5568#true} is VALID [2022-02-20 19:58:42,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {5568#true} #res := ~__retres1~0; {5568#true} is VALID [2022-02-20 19:58:42,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-02-20 19:58:42,701 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5568#true} {5568#true} #761#return; {5568#true} is VALID [2022-02-20 19:58:42,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {5568#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5568#true} is VALID [2022-02-20 19:58:42,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {5568#true} assume !(0 != ~tmp~1); {5568#true} is VALID [2022-02-20 19:58:42,702 INFO L272 TraceCheckUtils]: 10: Hoare triple {5568#true} call #t~ret9 := is_do_read_c_triggered(); {5568#true} is VALID [2022-02-20 19:58:42,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {5568#true} havoc ~__retres1~1; {5568#true} is VALID [2022-02-20 19:58:42,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {5568#true} assume 1 == ~c_dr_pc~0; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,704 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} {5568#true} #763#return; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,705 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} {5575#(not (= ~c_dr_pc~0 1))} #769#return; {5569#false} is VALID [2022-02-20 19:58:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {5612#(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); {5568#true} is VALID [2022-02-20 19:58:42,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {5568#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5568#true} is VALID [2022-02-20 19:58:42,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-02-20 19:58:42,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5568#true} {5569#false} #771#return; {5569#false} is VALID [2022-02-20 19:58:42,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:42,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {5568#true} havoc ~__retres1~2; {5568#true} is VALID [2022-02-20 19:58:42,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {5568#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5568#true} is VALID [2022-02-20 19:58:42,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {5568#true} #res := ~__retres1~2; {5568#true} is VALID [2022-02-20 19:58:42,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-02-20 19:58:42,713 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5568#true} {5569#false} #773#return; {5569#false} is VALID [2022-02-20 19:58:42,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {5568#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {5570#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:42,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {5570#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:42,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {5570#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {5571#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:42,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {5571#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~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; {5571#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:42,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {5571#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {5610#(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:58:42,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {5610#(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); {5611#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:42,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {5611#(not (= |old(~q_req_up~0)| 1))} assume true; {5611#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:42,717 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5611#(not (= |old(~q_req_up~0)| 1))} {5571#(= ~c_dr_pc~0 ~q_req_up~0)} #765#return; {5575#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:42,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {5575#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {5575#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:42,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {5575#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5575#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:42,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {5575#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5575#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:42,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {5575#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {5575#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:42,719 INFO L272 TraceCheckUtils]: 12: Hoare triple {5575#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {5612#(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:58:42,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {5612#(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); {5568#true} is VALID [2022-02-20 19:58:42,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {5568#true} assume !(0 == ~q_write_ev~0); {5568#true} is VALID [2022-02-20 19:58:42,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-02-20 19:58:42,720 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5568#true} {5575#(not (= ~c_dr_pc~0 1))} #767#return; {5575#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:42,721 INFO L272 TraceCheckUtils]: 17: Hoare triple {5575#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {5613#(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:58:42,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {5613#(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; {5568#true} is VALID [2022-02-20 19:58:42,721 INFO L272 TraceCheckUtils]: 19: Hoare triple {5568#true} call #t~ret8 := is_do_write_p_triggered(); {5568#true} is VALID [2022-02-20 19:58:42,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {5568#true} havoc ~__retres1~0; {5568#true} is VALID [2022-02-20 19:58:42,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {5568#true} assume !(1 == ~p_dw_pc~0); {5568#true} is VALID [2022-02-20 19:58:42,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {5568#true} ~__retres1~0 := 0; {5568#true} is VALID [2022-02-20 19:58:42,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {5568#true} #res := ~__retres1~0; {5568#true} is VALID [2022-02-20 19:58:42,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-02-20 19:58:42,722 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5568#true} {5568#true} #761#return; {5568#true} is VALID [2022-02-20 19:58:42,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {5568#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {5568#true} is VALID [2022-02-20 19:58:42,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {5568#true} assume !(0 != ~tmp~1); {5568#true} is VALID [2022-02-20 19:58:42,722 INFO L272 TraceCheckUtils]: 28: Hoare triple {5568#true} call #t~ret9 := is_do_read_c_triggered(); {5568#true} is VALID [2022-02-20 19:58:42,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {5568#true} havoc ~__retres1~1; {5568#true} is VALID [2022-02-20 19:58:42,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {5568#true} assume 1 == ~c_dr_pc~0; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,725 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} {5568#true} #763#return; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:42,726 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5626#(= (+ (- 1) ~c_dr_pc~0) 0)} {5575#(not (= ~c_dr_pc~0 1))} #769#return; {5569#false} is VALID [2022-02-20 19:58:42,726 INFO L272 TraceCheckUtils]: 39: Hoare triple {5569#false} call reset_delta_events1(); {5612#(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:58:42,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {5612#(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); {5568#true} is VALID [2022-02-20 19:58:42,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {5568#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5568#true} is VALID [2022-02-20 19:58:42,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-02-20 19:58:42,727 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5568#true} {5569#false} #771#return; {5569#false} is VALID [2022-02-20 19:58:42,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {5569#false} assume !false; {5569#false} is VALID [2022-02-20 19:58:42,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {5569#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; {5569#false} is VALID [2022-02-20 19:58:42,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {5569#false} assume !false; {5569#false} is VALID [2022-02-20 19:58:42,728 INFO L272 TraceCheckUtils]: 47: Hoare triple {5569#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5568#true} is VALID [2022-02-20 19:58:42,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {5568#true} havoc ~__retres1~2; {5568#true} is VALID [2022-02-20 19:58:42,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {5568#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5568#true} is VALID [2022-02-20 19:58:42,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {5568#true} #res := ~__retres1~2; {5568#true} is VALID [2022-02-20 19:58:42,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-02-20 19:58:42,729 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5568#true} {5569#false} #773#return; {5569#false} is VALID [2022-02-20 19:58:42,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {5569#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; {5569#false} is VALID [2022-02-20 19:58:42,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {5569#false} assume 0 != eval1_~tmp___1~0#1; {5569#false} is VALID [2022-02-20 19:58:42,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {5569#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; {5569#false} is VALID [2022-02-20 19:58:42,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {5569#false} assume !(0 != eval1_~tmp~2#1); {5569#false} is VALID [2022-02-20 19:58:42,729 INFO L272 TraceCheckUtils]: 57: Hoare triple {5569#false} call error1(); {5569#false} is VALID [2022-02-20 19:58:42,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {5569#false} assume !false; {5569#false} is VALID [2022-02-20 19:58:42,730 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:58:42,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:42,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000886805] [2022-02-20 19:58:42,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000886805] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:42,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:42,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:42,731 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719048121] [2022-02-20 19:58:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:42,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-02-20 19:58:42,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:42,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:42,772 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:58:42,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:42,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:42,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:42,774 INFO L87 Difference]: Start difference. First operand 325 states and 452 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:47,662 INFO L93 Difference]: Finished difference Result 1239 states and 1680 transitions. [2022-02-20 19:58:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:47,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-02-20 19:58:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1001 transitions. [2022-02-20 19:58:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1001 transitions. [2022-02-20 19:58:47,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1001 transitions. [2022-02-20 19:58:48,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1001 edges. 1001 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:48,570 INFO L225 Difference]: With dead ends: 1239 [2022-02-20 19:58:48,570 INFO L226 Difference]: Without dead ends: 1044 [2022-02-20 19:58:48,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:58:48,573 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 1853 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1869 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:48,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1869 Valid, 1646 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 19:58:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2022-02-20 19:58:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 906. [2022-02-20 19:58:48,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:48,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1044 states. Second operand has 906 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 735 states have internal predecessors, (980), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:58:48,644 INFO L74 IsIncluded]: Start isIncluded. First operand 1044 states. Second operand has 906 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 735 states have internal predecessors, (980), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:58:48,646 INFO L87 Difference]: Start difference. First operand 1044 states. Second operand has 906 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 735 states have internal predecessors, (980), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:58:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,708 INFO L93 Difference]: Finished difference Result 1044 states and 1349 transitions. [2022-02-20 19:58:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1349 transitions. [2022-02-20 19:58:48,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 906 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 735 states have internal predecessors, (980), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) Second operand 1044 states. [2022-02-20 19:58:48,721 INFO L87 Difference]: Start difference. First operand has 906 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 735 states have internal predecessors, (980), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) Second operand 1044 states. [2022-02-20 19:58:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,785 INFO L93 Difference]: Finished difference Result 1044 states and 1349 transitions. [2022-02-20 19:58:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1349 transitions. [2022-02-20 19:58:48,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:48,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 735 states have internal predecessors, (980), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-02-20 19:58:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1193 transitions. [2022-02-20 19:58:48,855 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1193 transitions. Word has length 59 [2022-02-20 19:58:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:48,855 INFO L470 AbstractCegarLoop]: Abstraction has 906 states and 1193 transitions. [2022-02-20 19:58:48,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:58:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1193 transitions. [2022-02-20 19:58:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:48,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:48,858 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:58:48,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:48,858 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash 927885864, now seen corresponding path program 1 times [2022-02-20 19:58:48,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:48,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916769235] [2022-02-20 19:58:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {10727#(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); {10688#true} is VALID [2022-02-20 19:58:48,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:48,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10688#true} {10688#true} #765#return; {10688#true} is VALID [2022-02-20 19:58:48,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {10728#(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); {10688#true} is VALID [2022-02-20 19:58:48,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {10688#true} assume !(0 == ~q_write_ev~0); {10688#true} is VALID [2022-02-20 19:58:48,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:48,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10688#true} {10688#true} #767#return; {10688#true} is VALID [2022-02-20 19:58:48,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {10688#true} havoc ~__retres1~0; {10688#true} is VALID [2022-02-20 19:58:48,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {10688#true} assume !(1 == ~p_dw_pc~0); {10688#true} is VALID [2022-02-20 19:58:48,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {10688#true} ~__retres1~0 := 0; {10688#true} is VALID [2022-02-20 19:58:48,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {10688#true} #res := ~__retres1~0; {10688#true} is VALID [2022-02-20 19:58:48,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:48,959 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10688#true} {10688#true} #761#return; {10688#true} is VALID [2022-02-20 19:58:48,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {10688#true} havoc ~__retres1~1; {10688#true} is VALID [2022-02-20 19:58:48,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {10688#true} assume !(1 == ~c_dr_pc~0); {10688#true} is VALID [2022-02-20 19:58:48,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {10688#true} ~__retres1~1 := 0; {10744#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:48,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {10744#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,000 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10688#true} #763#return; {10742#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:49,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {10729#(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; {10688#true} is VALID [2022-02-20 19:58:49,001 INFO L272 TraceCheckUtils]: 1: Hoare triple {10688#true} call #t~ret8 := is_do_write_p_triggered(); {10688#true} is VALID [2022-02-20 19:58:49,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {10688#true} havoc ~__retres1~0; {10688#true} is VALID [2022-02-20 19:58:49,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {10688#true} assume !(1 == ~p_dw_pc~0); {10688#true} is VALID [2022-02-20 19:58:49,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {10688#true} ~__retres1~0 := 0; {10688#true} is VALID [2022-02-20 19:58:49,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {10688#true} #res := ~__retres1~0; {10688#true} is VALID [2022-02-20 19:58:49,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:49,002 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10688#true} {10688#true} #761#return; {10688#true} is VALID [2022-02-20 19:58:49,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {10688#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10688#true} is VALID [2022-02-20 19:58:49,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {10688#true} assume !(0 != ~tmp~1); {10688#true} is VALID [2022-02-20 19:58:49,002 INFO L272 TraceCheckUtils]: 10: Hoare triple {10688#true} call #t~ret9 := is_do_read_c_triggered(); {10688#true} is VALID [2022-02-20 19:58:49,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {10688#true} havoc ~__retres1~1; {10688#true} is VALID [2022-02-20 19:58:49,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {10688#true} assume !(1 == ~c_dr_pc~0); {10688#true} is VALID [2022-02-20 19:58:49,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {10688#true} ~__retres1~1 := 0; {10744#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:49,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {10744#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,004 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10688#true} #763#return; {10742#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:49,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {10742#(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; {10743#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:49,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {10743#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10689#false} is VALID [2022-02-20 19:58:49,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {10689#false} assume true; {10689#false} is VALID [2022-02-20 19:58:49,006 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10689#false} {10688#true} #769#return; {10689#false} is VALID [2022-02-20 19:58:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {10728#(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); {10688#true} is VALID [2022-02-20 19:58:49,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {10688#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10688#true} is VALID [2022-02-20 19:58:49,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:49,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10688#true} {10689#false} #771#return; {10689#false} is VALID [2022-02-20 19:58:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:49,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {10688#true} havoc ~__retres1~2; {10688#true} is VALID [2022-02-20 19:58:49,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {10688#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10688#true} is VALID [2022-02-20 19:58:49,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {10688#true} #res := ~__retres1~2; {10688#true} is VALID [2022-02-20 19:58:49,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:49,024 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10688#true} {10689#false} #773#return; {10689#false} is VALID [2022-02-20 19:58:49,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {10688#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {10688#true} is VALID [2022-02-20 19:58:49,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {10688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {10688#true} is VALID [2022-02-20 19:58:49,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {10688#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {10688#true} is VALID [2022-02-20 19:58:49,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {10688#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; {10688#true} is VALID [2022-02-20 19:58:49,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {10688#true} call update_channels1(); {10727#(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:58:49,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {10727#(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); {10688#true} is VALID [2022-02-20 19:58:49,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:49,026 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10688#true} {10688#true} #765#return; {10688#true} is VALID [2022-02-20 19:58:49,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {10688#true} assume { :begin_inline_init_threads1 } true; {10688#true} is VALID [2022-02-20 19:58:49,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {10688#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10688#true} is VALID [2022-02-20 19:58:49,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {10688#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10688#true} is VALID [2022-02-20 19:58:49,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {10688#true} assume { :end_inline_init_threads1 } true; {10688#true} is VALID [2022-02-20 19:58:49,027 INFO L272 TraceCheckUtils]: 12: Hoare triple {10688#true} call fire_delta_events1(); {10728#(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:58:49,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {10728#(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); {10688#true} is VALID [2022-02-20 19:58:49,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {10688#true} assume !(0 == ~q_write_ev~0); {10688#true} is VALID [2022-02-20 19:58:49,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:49,028 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10688#true} {10688#true} #767#return; {10688#true} is VALID [2022-02-20 19:58:49,029 INFO L272 TraceCheckUtils]: 17: Hoare triple {10688#true} call activate_threads1(); {10729#(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:58:49,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {10729#(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; {10688#true} is VALID [2022-02-20 19:58:49,031 INFO L272 TraceCheckUtils]: 19: Hoare triple {10688#true} call #t~ret8 := is_do_write_p_triggered(); {10688#true} is VALID [2022-02-20 19:58:49,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {10688#true} havoc ~__retres1~0; {10688#true} is VALID [2022-02-20 19:58:49,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {10688#true} assume !(1 == ~p_dw_pc~0); {10688#true} is VALID [2022-02-20 19:58:49,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {10688#true} ~__retres1~0 := 0; {10688#true} is VALID [2022-02-20 19:58:49,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {10688#true} #res := ~__retres1~0; {10688#true} is VALID [2022-02-20 19:58:49,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:49,032 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10688#true} {10688#true} #761#return; {10688#true} is VALID [2022-02-20 19:58:49,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {10688#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10688#true} is VALID [2022-02-20 19:58:49,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {10688#true} assume !(0 != ~tmp~1); {10688#true} is VALID [2022-02-20 19:58:49,033 INFO L272 TraceCheckUtils]: 28: Hoare triple {10688#true} call #t~ret9 := is_do_read_c_triggered(); {10688#true} is VALID [2022-02-20 19:58:49,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {10688#true} havoc ~__retres1~1; {10688#true} is VALID [2022-02-20 19:58:49,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {10688#true} assume !(1 == ~c_dr_pc~0); {10688#true} is VALID [2022-02-20 19:58:49,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {10688#true} ~__retres1~1 := 0; {10744#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:49,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {10744#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:49,040 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10745#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10688#true} #763#return; {10742#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:49,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {10742#(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; {10743#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:49,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {10743#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10689#false} is VALID [2022-02-20 19:58:49,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {10689#false} assume true; {10689#false} is VALID [2022-02-20 19:58:49,041 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10689#false} {10688#true} #769#return; {10689#false} is VALID [2022-02-20 19:58:49,042 INFO L272 TraceCheckUtils]: 39: Hoare triple {10689#false} call reset_delta_events1(); {10728#(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:58:49,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {10728#(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); {10688#true} is VALID [2022-02-20 19:58:49,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {10688#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10688#true} is VALID [2022-02-20 19:58:49,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:49,042 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10688#true} {10689#false} #771#return; {10689#false} is VALID [2022-02-20 19:58:49,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {10689#false} assume !false; {10689#false} is VALID [2022-02-20 19:58:49,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {10689#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; {10689#false} is VALID [2022-02-20 19:58:49,043 INFO L290 TraceCheckUtils]: 46: Hoare triple {10689#false} assume !false; {10689#false} is VALID [2022-02-20 19:58:49,043 INFO L272 TraceCheckUtils]: 47: Hoare triple {10689#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10688#true} is VALID [2022-02-20 19:58:49,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {10688#true} havoc ~__retres1~2; {10688#true} is VALID [2022-02-20 19:58:49,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {10688#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10688#true} is VALID [2022-02-20 19:58:49,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {10688#true} #res := ~__retres1~2; {10688#true} is VALID [2022-02-20 19:58:49,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {10688#true} assume true; {10688#true} is VALID [2022-02-20 19:58:49,044 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10688#true} {10689#false} #773#return; {10689#false} is VALID [2022-02-20 19:58:49,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {10689#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; {10689#false} is VALID [2022-02-20 19:58:49,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {10689#false} assume 0 != eval1_~tmp___1~0#1; {10689#false} is VALID [2022-02-20 19:58:49,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {10689#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; {10689#false} is VALID [2022-02-20 19:58:49,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {10689#false} assume !(0 != eval1_~tmp~2#1); {10689#false} is VALID [2022-02-20 19:58:49,044 INFO L272 TraceCheckUtils]: 57: Hoare triple {10689#false} call error1(); {10689#false} is VALID [2022-02-20 19:58:49,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {10689#false} assume !false; {10689#false} is VALID [2022-02-20 19:58:49,045 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:58:49,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:49,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916769235] [2022-02-20 19:58:49,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916769235] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:49,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:49,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:49,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011144912] [2022-02-20 19:58:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:49,048 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:58:49,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:49,049 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:58:49,083 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:58:49,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:49,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:49,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:49,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:49,084 INFO L87 Difference]: Start difference. First operand 906 states and 1193 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:58:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,385 INFO L93 Difference]: Finished difference Result 1788 states and 2337 transitions. [2022-02-20 19:58:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:51,385 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:58:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:51,386 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:58:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 474 transitions. [2022-02-20 19:58:51,393 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:58:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 474 transitions. [2022-02-20 19:58:51,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 474 transitions. [2022-02-20 19:58:51,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:51,806 INFO L225 Difference]: With dead ends: 1788 [2022-02-20 19:58:51,806 INFO L226 Difference]: Without dead ends: 1018 [2022-02-20 19:58:51,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:51,809 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 250 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:51,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 1368 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:58:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-02-20 19:58:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 926. [2022-02-20 19:58:51,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:51,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1018 states. Second operand has 926 states, 736 states have (on average 1.346467391304348) internal successors, (991), 751 states have internal predecessors, (991), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:58:51,874 INFO L74 IsIncluded]: Start isIncluded. First operand 1018 states. Second operand has 926 states, 736 states have (on average 1.346467391304348) internal successors, (991), 751 states have internal predecessors, (991), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:58:51,876 INFO L87 Difference]: Start difference. First operand 1018 states. Second operand has 926 states, 736 states have (on average 1.346467391304348) internal successors, (991), 751 states have internal predecessors, (991), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:58:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,935 INFO L93 Difference]: Finished difference Result 1018 states and 1320 transitions. [2022-02-20 19:58:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1320 transitions. [2022-02-20 19:58:51,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:51,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:51,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 926 states, 736 states have (on average 1.346467391304348) internal successors, (991), 751 states have internal predecessors, (991), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) Second operand 1018 states. [2022-02-20 19:58:51,943 INFO L87 Difference]: Start difference. First operand has 926 states, 736 states have (on average 1.346467391304348) internal successors, (991), 751 states have internal predecessors, (991), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) Second operand 1018 states. [2022-02-20 19:58:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:52,011 INFO L93 Difference]: Finished difference Result 1018 states and 1320 transitions. [2022-02-20 19:58:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1320 transitions. [2022-02-20 19:58:52,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:52,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:52,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:52,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 736 states have (on average 1.346467391304348) internal successors, (991), 751 states have internal predecessors, (991), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-02-20 19:58:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1208 transitions. [2022-02-20 19:58:52,089 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1208 transitions. Word has length 59 [2022-02-20 19:58:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:52,089 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1208 transitions. [2022-02-20 19:58:52,090 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:58:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1208 transitions. [2022-02-20 19:58:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:52,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:52,091 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:58:52,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:52,091 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:52,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash -877552470, now seen corresponding path program 1 times [2022-02-20 19:58:52,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:52,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200336454] [2022-02-20 19:58:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {16502#(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); {16503#(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:58:52,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {16503#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16503#(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:58:52,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16503#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16464#(= ~q_write_ev~0 ~q_read_ev~0)} #765#return; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {16503#(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); {16503#(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:58:52,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {16503#(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); {16503#(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:58:52,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {16503#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16503#(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:58:52,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16503#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16464#(= ~q_write_ev~0 ~q_read_ev~0)} #767#return; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {16462#true} havoc ~__retres1~0; {16462#true} is VALID [2022-02-20 19:58:52,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {16462#true} assume !(1 == ~p_dw_pc~0); {16462#true} is VALID [2022-02-20 19:58:52,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {16462#true} ~__retres1~0 := 0; {16462#true} is VALID [2022-02-20 19:58:52,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {16462#true} #res := ~__retres1~0; {16462#true} is VALID [2022-02-20 19:58:52,188 INFO L290 TraceCheckUtils]: 4: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,189 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16462#true} {16462#true} #761#return; {16462#true} is VALID [2022-02-20 19:58:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {16462#true} havoc ~__retres1~1; {16462#true} is VALID [2022-02-20 19:58:52,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {16462#true} assume !(1 == ~c_dr_pc~0); {16462#true} is VALID [2022-02-20 19:58:52,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {16462#true} ~__retres1~1 := 0; {16462#true} is VALID [2022-02-20 19:58:52,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {16462#true} #res := ~__retres1~1; {16462#true} is VALID [2022-02-20 19:58:52,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,194 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16462#true} {16462#true} #763#return; {16462#true} is VALID [2022-02-20 19:58:52,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {16504#(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; {16462#true} is VALID [2022-02-20 19:58:52,194 INFO L272 TraceCheckUtils]: 1: Hoare triple {16462#true} call #t~ret8 := is_do_write_p_triggered(); {16462#true} is VALID [2022-02-20 19:58:52,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {16462#true} havoc ~__retres1~0; {16462#true} is VALID [2022-02-20 19:58:52,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {16462#true} assume !(1 == ~p_dw_pc~0); {16462#true} is VALID [2022-02-20 19:58:52,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {16462#true} ~__retres1~0 := 0; {16462#true} is VALID [2022-02-20 19:58:52,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {16462#true} #res := ~__retres1~0; {16462#true} is VALID [2022-02-20 19:58:52,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,195 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16462#true} {16462#true} #761#return; {16462#true} is VALID [2022-02-20 19:58:52,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {16462#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16462#true} is VALID [2022-02-20 19:58:52,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {16462#true} assume !(0 != ~tmp~1); {16462#true} is VALID [2022-02-20 19:58:52,195 INFO L272 TraceCheckUtils]: 10: Hoare triple {16462#true} call #t~ret9 := is_do_read_c_triggered(); {16462#true} is VALID [2022-02-20 19:58:52,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {16462#true} havoc ~__retres1~1; {16462#true} is VALID [2022-02-20 19:58:52,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {16462#true} assume !(1 == ~c_dr_pc~0); {16462#true} is VALID [2022-02-20 19:58:52,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {16462#true} ~__retres1~1 := 0; {16462#true} is VALID [2022-02-20 19:58:52,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {16462#true} #res := ~__retres1~1; {16462#true} is VALID [2022-02-20 19:58:52,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,196 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16462#true} {16462#true} #763#return; {16462#true} is VALID [2022-02-20 19:58:52,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {16462#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16462#true} is VALID [2022-02-20 19:58:52,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {16462#true} assume !(0 != ~tmp___0~1); {16462#true} is VALID [2022-02-20 19:58:52,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,197 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16462#true} {16464#(= ~q_write_ev~0 ~q_read_ev~0)} #769#return; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {16503#(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); {16517#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:52,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {16517#(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; {16518#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:52,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {16518#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {16518#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:52,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16518#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {16464#(= ~q_write_ev~0 ~q_read_ev~0)} #771#return; {16463#false} is VALID [2022-02-20 19:58:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:52,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {16462#true} havoc ~__retres1~2; {16462#true} is VALID [2022-02-20 19:58:52,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {16462#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16462#true} is VALID [2022-02-20 19:58:52,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {16462#true} #res := ~__retres1~2; {16462#true} is VALID [2022-02-20 19:58:52,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,226 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16462#true} {16463#false} #773#return; {16463#false} is VALID [2022-02-20 19:58:52,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {16462#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; {16462#true} is VALID [2022-02-20 19:58:52,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {16462#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {16462#true} is VALID [2022-02-20 19:58:52,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {16462#true} assume 0 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {16464#(= ~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; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {16464#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {16502#(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:58:52,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {16502#(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); {16503#(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:58:52,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {16503#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16503#(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:58:52,229 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16503#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16464#(= ~q_write_ev~0 ~q_read_ev~0)} #765#return; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {16464#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {16464#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {16464#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {16464#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {16464#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {16503#(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:58:52,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {16503#(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); {16503#(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:58:52,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {16503#(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); {16503#(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:58:52,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {16503#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {16503#(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:58:52,232 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16503#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {16464#(= ~q_write_ev~0 ~q_read_ev~0)} #767#return; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,233 INFO L272 TraceCheckUtils]: 17: Hoare triple {16464#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {16504#(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:58:52,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {16504#(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; {16462#true} is VALID [2022-02-20 19:58:52,233 INFO L272 TraceCheckUtils]: 19: Hoare triple {16462#true} call #t~ret8 := is_do_write_p_triggered(); {16462#true} is VALID [2022-02-20 19:58:52,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {16462#true} havoc ~__retres1~0; {16462#true} is VALID [2022-02-20 19:58:52,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {16462#true} assume !(1 == ~p_dw_pc~0); {16462#true} is VALID [2022-02-20 19:58:52,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {16462#true} ~__retres1~0 := 0; {16462#true} is VALID [2022-02-20 19:58:52,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {16462#true} #res := ~__retres1~0; {16462#true} is VALID [2022-02-20 19:58:52,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,234 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16462#true} {16462#true} #761#return; {16462#true} is VALID [2022-02-20 19:58:52,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {16462#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16462#true} is VALID [2022-02-20 19:58:52,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {16462#true} assume !(0 != ~tmp~1); {16462#true} is VALID [2022-02-20 19:58:52,235 INFO L272 TraceCheckUtils]: 28: Hoare triple {16462#true} call #t~ret9 := is_do_read_c_triggered(); {16462#true} is VALID [2022-02-20 19:58:52,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {16462#true} havoc ~__retres1~1; {16462#true} is VALID [2022-02-20 19:58:52,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {16462#true} assume !(1 == ~c_dr_pc~0); {16462#true} is VALID [2022-02-20 19:58:52,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {16462#true} ~__retres1~1 := 0; {16462#true} is VALID [2022-02-20 19:58:52,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {16462#true} #res := ~__retres1~1; {16462#true} is VALID [2022-02-20 19:58:52,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,236 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16462#true} {16462#true} #763#return; {16462#true} is VALID [2022-02-20 19:58:52,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {16462#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16462#true} is VALID [2022-02-20 19:58:52,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {16462#true} assume !(0 != ~tmp___0~1); {16462#true} is VALID [2022-02-20 19:58:52,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,238 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16462#true} {16464#(= ~q_write_ev~0 ~q_read_ev~0)} #769#return; {16464#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:52,239 INFO L272 TraceCheckUtils]: 39: Hoare triple {16464#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {16503#(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:58:52,239 INFO L290 TraceCheckUtils]: 40: Hoare triple {16503#(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); {16517#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:52,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {16517#(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; {16518#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:52,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {16518#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {16518#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:52,241 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16518#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {16464#(= ~q_write_ev~0 ~q_read_ev~0)} #771#return; {16463#false} is VALID [2022-02-20 19:58:52,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {16463#false} assume !false; {16463#false} is VALID [2022-02-20 19:58:52,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {16463#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; {16463#false} is VALID [2022-02-20 19:58:52,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {16463#false} assume !false; {16463#false} is VALID [2022-02-20 19:58:52,241 INFO L272 TraceCheckUtils]: 47: Hoare triple {16463#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {16462#true} is VALID [2022-02-20 19:58:52,241 INFO L290 TraceCheckUtils]: 48: Hoare triple {16462#true} havoc ~__retres1~2; {16462#true} is VALID [2022-02-20 19:58:52,241 INFO L290 TraceCheckUtils]: 49: Hoare triple {16462#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16462#true} is VALID [2022-02-20 19:58:52,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {16462#true} #res := ~__retres1~2; {16462#true} is VALID [2022-02-20 19:58:52,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {16462#true} assume true; {16462#true} is VALID [2022-02-20 19:58:52,242 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16462#true} {16463#false} #773#return; {16463#false} is VALID [2022-02-20 19:58:52,242 INFO L290 TraceCheckUtils]: 53: Hoare triple {16463#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; {16463#false} is VALID [2022-02-20 19:58:52,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {16463#false} assume 0 != eval1_~tmp___1~0#1; {16463#false} is VALID [2022-02-20 19:58:52,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {16463#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; {16463#false} is VALID [2022-02-20 19:58:52,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {16463#false} assume !(0 != eval1_~tmp~2#1); {16463#false} is VALID [2022-02-20 19:58:52,243 INFO L272 TraceCheckUtils]: 57: Hoare triple {16463#false} call error1(); {16463#false} is VALID [2022-02-20 19:58:52,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {16463#false} assume !false; {16463#false} is VALID [2022-02-20 19:58:52,243 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:58:52,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:52,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200336454] [2022-02-20 19:58:52,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200336454] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:52,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:52,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:52,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197951864] [2022-02-20 19:58:52,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:52,245 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:58:52,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:52,245 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:58:52,282 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:58:52,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:52,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:52,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:52,284 INFO L87 Difference]: Start difference. First operand 926 states and 1208 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:58:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:54,971 INFO L93 Difference]: Finished difference Result 2496 states and 3157 transitions. [2022-02-20 19:58:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:54,972 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:58:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:54,972 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:58:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 641 transitions. [2022-02-20 19:58:54,978 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:58:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 641 transitions. [2022-02-20 19:58:54,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 641 transitions. [2022-02-20 19:58:55,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 641 edges. 641 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:55,618 INFO L225 Difference]: With dead ends: 2496 [2022-02-20 19:58:55,618 INFO L226 Difference]: Without dead ends: 1707 [2022-02-20 19:58:55,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:55,620 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 637 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:55,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 1090 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-02-20 19:58:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1374. [2022-02-20 19:58:55,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:55,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1707 states. Second operand has 1374 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1113 states have internal predecessors, (1440), 145 states have call successors, (145), 113 states have call predecessors, (145), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:58:55,726 INFO L74 IsIncluded]: Start isIncluded. First operand 1707 states. Second operand has 1374 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1113 states have internal predecessors, (1440), 145 states have call successors, (145), 113 states have call predecessors, (145), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:58:55,728 INFO L87 Difference]: Start difference. First operand 1707 states. Second operand has 1374 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1113 states have internal predecessors, (1440), 145 states have call successors, (145), 113 states have call predecessors, (145), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:58:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,886 INFO L93 Difference]: Finished difference Result 1707 states and 2133 transitions. [2022-02-20 19:58:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2133 transitions. [2022-02-20 19:58:55,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:55,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:55,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 1374 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1113 states have internal predecessors, (1440), 145 states have call successors, (145), 113 states have call predecessors, (145), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) Second operand 1707 states. [2022-02-20 19:58:55,896 INFO L87 Difference]: Start difference. First operand has 1374 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1113 states have internal predecessors, (1440), 145 states have call successors, (145), 113 states have call predecessors, (145), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) Second operand 1707 states. [2022-02-20 19:58:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,051 INFO L93 Difference]: Finished difference Result 1707 states and 2133 transitions. [2022-02-20 19:58:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2133 transitions. [2022-02-20 19:58:56,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:56,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:56,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:56,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1113 states have internal predecessors, (1440), 145 states have call successors, (145), 113 states have call predecessors, (145), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-02-20 19:58:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1775 transitions. [2022-02-20 19:58:56,221 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1775 transitions. Word has length 59 [2022-02-20 19:58:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:56,221 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 1775 transitions. [2022-02-20 19:58:56,222 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:58:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1775 transitions. [2022-02-20 19:58:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:56,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:56,224 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:58:56,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:56,224 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1423270120, now seen corresponding path program 1 times [2022-02-20 19:58:56,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:56,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205694959] [2022-02-20 19:58:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:56,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:58:56,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:58:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:58:56,287 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:58:56,288 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:58:56,289 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:58:56,290 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:58:56,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:56,293 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:56,295 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:58:56,330 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:58:56,331 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:58:56,340 INFO L158 Benchmark]: Toolchain (without parser) took 23165.76ms. Allocated memory was 102.8MB in the beginning and 180.4MB in the end (delta: 77.6MB). Free memory was 63.8MB in the beginning and 93.8MB in the end (delta: -29.9MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-02-20 19:58:56,340 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 81.3MB in the beginning and 81.2MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:58:56,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.48ms. Allocated memory is still 102.8MB. Free memory was 63.5MB in the beginning and 71.1MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 19:58:56,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.09ms. Allocated memory is still 102.8MB. Free memory was 71.1MB in the beginning and 67.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:58:56,341 INFO L158 Benchmark]: Boogie Preprocessor took 45.86ms. Allocated memory is still 102.8MB. Free memory was 67.8MB in the beginning and 65.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:58:56,341 INFO L158 Benchmark]: RCFGBuilder took 690.34ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 65.3MB in the beginning and 96.7MB in the end (delta: -31.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2022-02-20 19:58:56,342 INFO L158 Benchmark]: TraceAbstraction took 21987.27ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 96.7MB in the beginning and 93.8MB in the end (delta: 2.9MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2022-02-20 19:58:56,345 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.19ms. Allocated memory is still 102.8MB. Free memory was 81.3MB in the beginning and 81.2MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.48ms. Allocated memory is still 102.8MB. Free memory was 63.5MB in the beginning and 71.1MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.09ms. Allocated memory is still 102.8MB. Free memory was 71.1MB in the beginning and 67.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.86ms. Allocated memory is still 102.8MB. Free memory was 67.8MB in the beginning and 65.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 690.34ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 65.3MB in the beginning and 96.7MB in the end (delta: -31.4MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 21987.27ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 96.7MB in the beginning and 93.8MB in the end (delta: 2.9MB). Peak memory consumption was 62.1MB. 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:58:56,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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.02.cil-1.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 c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:58,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:58,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:58,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:58,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:58,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:58,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:58,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:58,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:58,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:58,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:58,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:58,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:58,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:58,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:58,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:58,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:58,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:58,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:58,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:58,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:58,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:58,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:58,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:58,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:58,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:58,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:58,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:58,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:58,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:58,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:58,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:58,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:58,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:58,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:58,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:58,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:58,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:58,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:58,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:58,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:58,296 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:58:58,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:58,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:58,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:58,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:58,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:58,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:58,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:58,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:58,320 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:58,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:58,320 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:58,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:58,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:58,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:58,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:58,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:58,321 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:58:58,322 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:58:58,322 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:58:58,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:58,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:58,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:58,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:58,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:58,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:58,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:58,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:58,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:58,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:58,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:58,324 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:58:58,324 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:58:58,324 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:58,326 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:58,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:58,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:58:58,326 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 -> c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c [2022-02-20 19:58:58,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:58,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:58,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:58,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:58,660 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:58,661 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.02.cil-1.c [2022-02-20 19:58:58,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f217be19e/43d08135f77b48cf802b66ad7d825216/FLAG14673c329 [2022-02-20 19:58:59,122 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:59,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2022-02-20 19:58:59,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f217be19e/43d08135f77b48cf802b66ad7d825216/FLAG14673c329 [2022-02-20 19:58:59,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f217be19e/43d08135f77b48cf802b66ad7d825216 [2022-02-20 19:58:59,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:59,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:59,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:59,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:59,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:59,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@330d5133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59, skipping insertion in model container [2022-02-20 19:58:59,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:59,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:59,336 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.02.cil-1.c[914,927] [2022-02-20 19:58:59,423 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.02.cil-1.c[7125,7138] [2022-02-20 19:58:59,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:59,516 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:59,528 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.02.cil-1.c[914,927] [2022-02-20 19:58:59,565 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.02.cil-1.c[7125,7138] [2022-02-20 19:58:59,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:59,619 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:59,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59 WrapperNode [2022-02-20 19:58:59,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:59,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:59,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:59,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:59,627 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:58:59" (1/1) ... [2022-02-20 19:58:59,656 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:58:59" (1/1) ... [2022-02-20 19:58:59,697 INFO L137 Inliner]: procedures = 58, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 442 [2022-02-20 19:58:59,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:59,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:59,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:59,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:59,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:59,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:59,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:59,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:59,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59" (1/1) ... [2022-02-20 19:58:59,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:59,784 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:58:59,788 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:58:59,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:59,810 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:59,810 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:59,810 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:59,810 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:59,811 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:59,811 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:59,811 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:59,811 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:59,811 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:59,811 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:59,812 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:59,812 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:59,812 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:58:59,812 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:59,813 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:59,813 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:59,813 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:59,813 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:59,813 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:59,814 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:59,815 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:59,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:59,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:59,816 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:59,901 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:59,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:00,466 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:00,476 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:00,477 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 19:59:00,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:00 BoogieIcfgContainer [2022-02-20 19:59:00,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:00,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:00,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:00,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:00,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:59" (1/3) ... [2022-02-20 19:59:00,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e14a739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:00, skipping insertion in model container [2022-02-20 19:59:00,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:59" (2/3) ... [2022-02-20 19:59:00,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e14a739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:00, skipping insertion in model container [2022-02-20 19:59:00,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:00" (3/3) ... [2022-02-20 19:59:00,484 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2022-02-20 19:59:00,488 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:00,488 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:00,527 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:00,532 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:00,532 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:59:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:00,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:00,562 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:00,562 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:00,566 INFO L85 PathProgramCache]: Analyzing trace with hash 381071048, now seen corresponding path program 1 times [2022-02-20 19:59:00,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:00,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42482117] [2022-02-20 19:59:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:00,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:00,582 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:00,583 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:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 19:59:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:01,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {237#true} is VALID [2022-02-20 19:59:01,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1; {237#true} is VALID [2022-02-20 19:59:01,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume 0bv32 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {248#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:01,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {248#(= ~p_dw_i~0 (_ bv1 32))} 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; {248#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:01,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {248#(= ~p_dw_i~0 (_ bv1 32))} call update_channels1(); {248#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:01,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {248#(= ~p_dw_i~0 (_ bv1 32))} assume !(1bv32 == ~q_req_up~0); {248#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:01,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#(= ~p_dw_i~0 (_ bv1 32))} assume true; {248#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:01,010 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {248#(= ~p_dw_i~0 (_ bv1 32))} {248#(= ~p_dw_i~0 (_ bv1 32))} #765#return; {248#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:01,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {248#(= ~p_dw_i~0 (_ bv1 32))} assume { :begin_inline_init_threads1 } true; {248#(= ~p_dw_i~0 (_ bv1 32))} is VALID [2022-02-20 19:59:01,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(= ~p_dw_i~0 (_ bv1 32))} assume !(1bv32 == ~p_dw_i~0);~p_dw_st~0 := 2bv32; {238#false} is VALID [2022-02-20 19:59:01,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {238#false} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {238#false} is VALID [2022-02-20 19:59:01,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {238#false} assume { :end_inline_init_threads1 } true; {238#false} is VALID [2022-02-20 19:59:01,012 INFO L272 TraceCheckUtils]: 12: Hoare triple {238#false} call fire_delta_events1(); {238#false} is VALID [2022-02-20 19:59:01,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#false} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {238#false} is VALID [2022-02-20 19:59:01,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#false} assume !(0bv32 == ~q_write_ev~0); {238#false} is VALID [2022-02-20 19:59:01,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {238#false} assume true; {238#false} is VALID [2022-02-20 19:59:01,013 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {238#false} {238#false} #767#return; {238#false} is VALID [2022-02-20 19:59:01,014 INFO L272 TraceCheckUtils]: 17: Hoare triple {238#false} call activate_threads1(); {238#false} is VALID [2022-02-20 19:59:01,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {238#false} havoc ~tmp~1;havoc ~tmp___0~1; {238#false} is VALID [2022-02-20 19:59:01,015 INFO L272 TraceCheckUtils]: 19: Hoare triple {238#false} call #t~ret8 := is_do_write_p_triggered(); {238#false} is VALID [2022-02-20 19:59:01,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {238#false} havoc ~__retres1~0; {238#false} is VALID [2022-02-20 19:59:01,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {238#false} assume 1bv32 == ~p_dw_pc~0; {238#false} is VALID [2022-02-20 19:59:01,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {238#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {238#false} is VALID [2022-02-20 19:59:01,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {238#false} #res := ~__retres1~0; {238#false} is VALID [2022-02-20 19:59:01,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {238#false} assume true; {238#false} is VALID [2022-02-20 19:59:01,018 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {238#false} {238#false} #761#return; {238#false} is VALID [2022-02-20 19:59:01,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {238#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {238#false} is VALID [2022-02-20 19:59:01,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {238#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {238#false} is VALID [2022-02-20 19:59:01,018 INFO L272 TraceCheckUtils]: 28: Hoare triple {238#false} call #t~ret9 := is_do_read_c_triggered(); {238#false} is VALID [2022-02-20 19:59:01,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {238#false} havoc ~__retres1~1; {238#false} is VALID [2022-02-20 19:59:01,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {238#false} assume 1bv32 == ~c_dr_pc~0; {238#false} is VALID [2022-02-20 19:59:01,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {238#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {238#false} is VALID [2022-02-20 19:59:01,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {238#false} #res := ~__retres1~1; {238#false} is VALID [2022-02-20 19:59:01,020 INFO L290 TraceCheckUtils]: 33: Hoare triple {238#false} assume true; {238#false} is VALID [2022-02-20 19:59:01,020 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {238#false} {238#false} #763#return; {238#false} is VALID [2022-02-20 19:59:01,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {238#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {238#false} is VALID [2022-02-20 19:59:01,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {238#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {238#false} is VALID [2022-02-20 19:59:01,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {238#false} assume true; {238#false} is VALID [2022-02-20 19:59:01,021 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {238#false} {238#false} #769#return; {238#false} is VALID [2022-02-20 19:59:01,022 INFO L272 TraceCheckUtils]: 39: Hoare triple {238#false} call reset_delta_events1(); {238#false} is VALID [2022-02-20 19:59:01,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {238#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {238#false} is VALID [2022-02-20 19:59:01,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {238#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {238#false} is VALID [2022-02-20 19:59:01,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {238#false} assume true; {238#false} is VALID [2022-02-20 19:59:01,026 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {238#false} {238#false} #771#return; {238#false} is VALID [2022-02-20 19:59:01,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {238#false} assume !false; {238#false} is VALID [2022-02-20 19:59:01,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {238#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; {238#false} is VALID [2022-02-20 19:59:01,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {238#false} assume !false; {238#false} is VALID [2022-02-20 19:59:01,028 INFO L272 TraceCheckUtils]: 47: Hoare triple {238#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {238#false} is VALID [2022-02-20 19:59:01,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {238#false} havoc ~__retres1~2; {238#false} is VALID [2022-02-20 19:59:01,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {238#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {238#false} is VALID [2022-02-20 19:59:01,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {238#false} #res := ~__retres1~2; {238#false} is VALID [2022-02-20 19:59:01,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {238#false} assume true; {238#false} is VALID [2022-02-20 19:59:01,032 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {238#false} {238#false} #773#return; {238#false} is VALID [2022-02-20 19:59:01,033 INFO L290 TraceCheckUtils]: 53: Hoare triple {238#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {238#false} is VALID [2022-02-20 19:59:01,033 INFO L290 TraceCheckUtils]: 54: Hoare triple {238#false} assume 0bv32 != eval1_~tmp___1~0#1; {238#false} is VALID [2022-02-20 19:59:01,033 INFO L290 TraceCheckUtils]: 55: Hoare triple {238#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {238#false} is VALID [2022-02-20 19:59:01,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {238#false} assume !(0bv32 != eval1_~tmp~2#1); {238#false} is VALID [2022-02-20 19:59:01,033 INFO L272 TraceCheckUtils]: 57: Hoare triple {238#false} call error1(); {238#false} is VALID [2022-02-20 19:59:01,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {238#false} assume !false; {238#false} is VALID [2022-02-20 19:59:01,034 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:01,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:01,035 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:01,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42482117] [2022-02-20 19:59:01,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42482117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:01,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:01,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:59:01,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142309432] [2022-02-20 19:59:01,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:01,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 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:01,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:01,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:01,114 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:01,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:59:01,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:01,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:59:01,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:01,152 INFO L87 Difference]: Start difference. First operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:01,648 INFO L93 Difference]: Finished difference Result 451 states and 675 transitions. [2022-02-20 19:59:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:59:01,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 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:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:01,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2022-02-20 19:59:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2022-02-20 19:59:01,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 675 transitions. [2022-02-20 19:59:02,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 675 edges. 675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:02,288 INFO L225 Difference]: With dead ends: 451 [2022-02-20 19:59:02,289 INFO L226 Difference]: Without dead ends: 224 [2022-02-20 19:59:02,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:02,295 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 129 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:02,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 514 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:02,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-02-20 19:59:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-02-20 19:59:02,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:02,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:59:02,335 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:59:02,336 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:59:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:02,348 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2022-02-20 19:59:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2022-02-20 19:59:02,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:02,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:02,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 224 states. [2022-02-20 19:59:02,353 INFO L87 Difference]: Start difference. First operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 224 states. [2022-02-20 19:59:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:02,364 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2022-02-20 19:59:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2022-02-20 19:59:02,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:02,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:02,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:02,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 19:59:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 317 transitions. [2022-02-20 19:59:02,379 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 317 transitions. Word has length 59 [2022-02-20 19:59:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:02,379 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 317 transitions. [2022-02-20 19:59:02,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2022-02-20 19:59:02,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:02,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:02,381 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:02,395 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:02,595 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:02,596 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash 862151306, now seen corresponding path program 1 times [2022-02-20 19:59:02,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:02,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617329877] [2022-02-20 19:59:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:02,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:02,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:02,599 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:02,601 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:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:02,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:02,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {1798#true} is VALID [2022-02-20 19:59:02,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1; {1798#true} is VALID [2022-02-20 19:59:02,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {1798#true} assume 0bv32 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {1809#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {1809#(= (_ 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; {1809#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {1809#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {1816#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {1816#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {1816#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {1816#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {1816#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,902 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1816#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {1809#(= (_ bv2 32) ~q_read_ev~0)} #765#return; {1809#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1809#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {1809#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {1809#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {1809#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {1809#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {1809#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {1809#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {1809#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,904 INFO L272 TraceCheckUtils]: 12: Hoare triple {1809#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {1816#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:02,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {1816#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {1844#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:02,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {1844#(= |old(~q_read_ev~0)| (_ bv0 32))} assume !(0bv32 == ~q_write_ev~0); {1844#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:02,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {1844#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {1844#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:02,906 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1844#(= |old(~q_read_ev~0)| (_ bv0 32))} {1809#(= (_ bv2 32) ~q_read_ev~0)} #767#return; {1799#false} is VALID [2022-02-20 19:59:02,906 INFO L272 TraceCheckUtils]: 17: Hoare triple {1799#false} call activate_threads1(); {1799#false} is VALID [2022-02-20 19:59:02,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {1799#false} havoc ~tmp~1;havoc ~tmp___0~1; {1799#false} is VALID [2022-02-20 19:59:02,907 INFO L272 TraceCheckUtils]: 19: Hoare triple {1799#false} call #t~ret8 := is_do_write_p_triggered(); {1799#false} is VALID [2022-02-20 19:59:02,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {1799#false} havoc ~__retres1~0; {1799#false} is VALID [2022-02-20 19:59:02,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {1799#false} assume 1bv32 == ~p_dw_pc~0; {1799#false} is VALID [2022-02-20 19:59:02,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {1799#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {1799#false} is VALID [2022-02-20 19:59:02,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {1799#false} #res := ~__retres1~0; {1799#false} is VALID [2022-02-20 19:59:02,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {1799#false} assume true; {1799#false} is VALID [2022-02-20 19:59:02,910 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1799#false} {1799#false} #761#return; {1799#false} is VALID [2022-02-20 19:59:02,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {1799#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {1799#false} is VALID [2022-02-20 19:59:02,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {1799#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {1799#false} is VALID [2022-02-20 19:59:02,911 INFO L272 TraceCheckUtils]: 28: Hoare triple {1799#false} call #t~ret9 := is_do_read_c_triggered(); {1799#false} is VALID [2022-02-20 19:59:02,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {1799#false} havoc ~__retres1~1; {1799#false} is VALID [2022-02-20 19:59:02,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {1799#false} assume 1bv32 == ~c_dr_pc~0; {1799#false} is VALID [2022-02-20 19:59:02,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {1799#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {1799#false} is VALID [2022-02-20 19:59:02,914 INFO L290 TraceCheckUtils]: 32: Hoare triple {1799#false} #res := ~__retres1~1; {1799#false} is VALID [2022-02-20 19:59:02,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {1799#false} assume true; {1799#false} is VALID [2022-02-20 19:59:02,915 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1799#false} {1799#false} #763#return; {1799#false} is VALID [2022-02-20 19:59:02,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {1799#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {1799#false} is VALID [2022-02-20 19:59:02,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {1799#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {1799#false} is VALID [2022-02-20 19:59:02,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {1799#false} assume true; {1799#false} is VALID [2022-02-20 19:59:02,915 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1799#false} {1799#false} #769#return; {1799#false} is VALID [2022-02-20 19:59:02,917 INFO L272 TraceCheckUtils]: 39: Hoare triple {1799#false} call reset_delta_events1(); {1799#false} is VALID [2022-02-20 19:59:02,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {1799#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {1799#false} is VALID [2022-02-20 19:59:02,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {1799#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {1799#false} is VALID [2022-02-20 19:59:02,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {1799#false} assume true; {1799#false} is VALID [2022-02-20 19:59:02,920 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1799#false} {1799#false} #771#return; {1799#false} is VALID [2022-02-20 19:59:02,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {1799#false} assume !false; {1799#false} is VALID [2022-02-20 19:59:02,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {1799#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; {1799#false} is VALID [2022-02-20 19:59:02,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {1799#false} assume !false; {1799#false} is VALID [2022-02-20 19:59:02,921 INFO L272 TraceCheckUtils]: 47: Hoare triple {1799#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {1799#false} is VALID [2022-02-20 19:59:02,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {1799#false} havoc ~__retres1~2; {1799#false} is VALID [2022-02-20 19:59:02,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {1799#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {1799#false} is VALID [2022-02-20 19:59:02,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {1799#false} #res := ~__retres1~2; {1799#false} is VALID [2022-02-20 19:59:02,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {1799#false} assume true; {1799#false} is VALID [2022-02-20 19:59:02,924 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1799#false} {1799#false} #773#return; {1799#false} is VALID [2022-02-20 19:59:02,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {1799#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {1799#false} is VALID [2022-02-20 19:59:02,924 INFO L290 TraceCheckUtils]: 54: Hoare triple {1799#false} assume 0bv32 != eval1_~tmp___1~0#1; {1799#false} is VALID [2022-02-20 19:59:02,926 INFO L290 TraceCheckUtils]: 55: Hoare triple {1799#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {1799#false} is VALID [2022-02-20 19:59:02,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {1799#false} assume !(0bv32 != eval1_~tmp~2#1); {1799#false} is VALID [2022-02-20 19:59:02,938 INFO L272 TraceCheckUtils]: 57: Hoare triple {1799#false} call error1(); {1799#false} is VALID [2022-02-20 19:59:02,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {1799#false} assume !false; {1799#false} is VALID [2022-02-20 19:59:02,939 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:02,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:02,939 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:02,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617329877] [2022-02-20 19:59:02,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617329877] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:02,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:02,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:02,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030808999] [2022-02-20 19:59:02,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:02,949 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:02,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:02,950 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:02,999 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:02,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:02,999 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:03,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:03,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:03,000 INFO L87 Difference]: Start difference. First operand 224 states and 317 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:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:04,251 INFO L93 Difference]: Finished difference Result 417 states and 587 transitions. [2022-02-20 19:59:04,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:04,251 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:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:04,252 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:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2022-02-20 19:59:04,260 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:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 587 transitions. [2022-02-20 19:59:04,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 587 transitions. [2022-02-20 19:59:04,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:04,745 INFO L225 Difference]: With dead ends: 417 [2022-02-20 19:59:04,747 INFO L226 Difference]: Without dead ends: 328 [2022-02-20 19:59:04,748 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:04,751 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 272 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:04,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 822 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:59:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-02-20 19:59:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2022-02-20 19:59:04,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:04,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:59:04,777 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:59:04,778 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:59:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:04,791 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2022-02-20 19:59:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 457 transitions. [2022-02-20 19:59:04,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:04,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:04,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) Second operand 328 states. [2022-02-20 19:59:04,795 INFO L87 Difference]: Start difference. First operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) Second operand 328 states. [2022-02-20 19:59:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:04,811 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2022-02-20 19:59:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 457 transitions. [2022-02-20 19:59:04,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:04,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:04,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:04,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-02-20 19:59:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2022-02-20 19:59:04,830 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 59 [2022-02-20 19:59:04,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:04,830 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2022-02-20 19:59:04,831 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:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2022-02-20 19:59:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:04,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:04,832 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:04,843 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:05,042 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:05,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:05,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1624800937, now seen corresponding path program 1 times [2022-02-20 19:59:05,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:05,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621608519] [2022-02-20 19:59:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:05,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:05,045 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:05,047 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:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:05,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:05,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {3656#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {3656#true} is VALID [2022-02-20 19:59:05,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {3656#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1; {3656#true} is VALID [2022-02-20 19:59:05,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {3656#true} assume 0bv32 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {3656#true} is VALID [2022-02-20 19:59:05,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {3656#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; {3656#true} is VALID [2022-02-20 19:59:05,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {3656#true} call update_channels1(); {3656#true} is VALID [2022-02-20 19:59:05,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {3656#true} assume !(1bv32 == ~q_req_up~0); {3656#true} is VALID [2022-02-20 19:59:05,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-02-20 19:59:05,267 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3656#true} {3656#true} #765#return; {3656#true} is VALID [2022-02-20 19:59:05,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {3656#true} assume { :begin_inline_init_threads1 } true; {3656#true} is VALID [2022-02-20 19:59:05,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {3656#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {3656#true} is VALID [2022-02-20 19:59:05,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {3656#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {3656#true} is VALID [2022-02-20 19:59:05,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {3656#true} assume { :end_inline_init_threads1 } true; {3656#true} is VALID [2022-02-20 19:59:05,267 INFO L272 TraceCheckUtils]: 12: Hoare triple {3656#true} call fire_delta_events1(); {3656#true} is VALID [2022-02-20 19:59:05,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {3656#true} assume !(0bv32 == ~q_read_ev~0); {3656#true} is VALID [2022-02-20 19:59:05,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {3656#true} assume !(0bv32 == ~q_write_ev~0); {3656#true} is VALID [2022-02-20 19:59:05,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {3656#true} assume true; {3656#true} is VALID [2022-02-20 19:59:05,268 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3656#true} {3656#true} #767#return; {3656#true} is VALID [2022-02-20 19:59:05,268 INFO L272 TraceCheckUtils]: 17: Hoare triple {3656#true} call activate_threads1(); {3656#true} is VALID [2022-02-20 19:59:05,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {3656#true} havoc ~tmp~1;havoc ~tmp___0~1; {3656#true} is VALID [2022-02-20 19:59:05,268 INFO L272 TraceCheckUtils]: 19: Hoare triple {3656#true} call #t~ret8 := is_do_write_p_triggered(); {3656#true} is VALID [2022-02-20 19:59:05,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {3656#true} havoc ~__retres1~0; {3656#true} is VALID [2022-02-20 19:59:05,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {3656#true} assume !(1bv32 == ~p_dw_pc~0); {3656#true} is VALID [2022-02-20 19:59:05,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {3656#true} ~__retres1~0 := 0bv32; {3727#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:05,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {3727#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {3731#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:05,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {3731#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {3731#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:05,273 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3731#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {3656#true} #761#return; {3738#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:05,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {3738#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {3742#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:05,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {3742#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {3657#false} is VALID [2022-02-20 19:59:05,274 INFO L272 TraceCheckUtils]: 28: Hoare triple {3657#false} call #t~ret9 := is_do_read_c_triggered(); {3657#false} is VALID [2022-02-20 19:59:05,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {3657#false} havoc ~__retres1~1; {3657#false} is VALID [2022-02-20 19:59:05,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {3657#false} assume 1bv32 == ~c_dr_pc~0; {3657#false} is VALID [2022-02-20 19:59:05,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {3657#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {3657#false} is VALID [2022-02-20 19:59:05,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {3657#false} #res := ~__retres1~1; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {3657#false} assume true; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3657#false} {3657#false} #763#return; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L290 TraceCheckUtils]: 35: Hoare triple {3657#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {3657#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {3657#false} assume true; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3657#false} {3656#true} #769#return; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L272 TraceCheckUtils]: 39: Hoare triple {3657#false} call reset_delta_events1(); {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {3657#false} assume !(1bv32 == ~q_read_ev~0); {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {3657#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {3657#false} assume true; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3657#false} {3657#false} #771#return; {3657#false} is VALID [2022-02-20 19:59:05,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 45: Hoare triple {3657#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; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 46: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L272 TraceCheckUtils]: 47: Hoare triple {3657#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 48: Hoare triple {3657#false} havoc ~__retres1~2; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {3657#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {3657#false} #res := ~__retres1~2; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {3657#false} assume true; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3657#false} {3657#false} #773#return; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 53: Hoare triple {3657#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 54: Hoare triple {3657#false} assume 0bv32 != eval1_~tmp___1~0#1; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 55: Hoare triple {3657#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {3657#false} assume !(0bv32 != eval1_~tmp~2#1); {3657#false} is VALID [2022-02-20 19:59:05,276 INFO L272 TraceCheckUtils]: 57: Hoare triple {3657#false} call error1(); {3657#false} is VALID [2022-02-20 19:59:05,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {3657#false} assume !false; {3657#false} is VALID [2022-02-20 19:59:05,277 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:05,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:05,277 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:05,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621608519] [2022-02-20 19:59:05,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621608519] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:05,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:05,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:05,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387498807] [2022-02-20 19:59:05,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:05,280 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:05,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:05,280 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:05,326 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:05,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:05,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:05,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:05,327 INFO L87 Difference]: Start difference. First operand 320 states and 448 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:06,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,151 INFO L93 Difference]: Finished difference Result 508 states and 705 transitions. [2022-02-20 19:59:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:06,151 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:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:06,152 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:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2022-02-20 19:59:06,158 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:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2022-02-20 19:59:06,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 451 transitions. [2022-02-20 19:59:06,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,481 INFO L225 Difference]: With dead ends: 508 [2022-02-20 19:59:06,481 INFO L226 Difference]: Without dead ends: 330 [2022-02-20 19:59:06,482 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:06,483 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 7 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1569 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:06,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1569 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:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-20 19:59:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 325. [2022-02-20 19:59:06,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:06,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:59:06,503 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:59:06,503 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:59:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,515 INFO L93 Difference]: Finished difference Result 330 states and 460 transitions. [2022-02-20 19:59:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 460 transitions. [2022-02-20 19:59:06,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:06,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:06,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) Second operand 330 states. [2022-02-20 19:59:06,518 INFO L87 Difference]: Start difference. First operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) Second operand 330 states. [2022-02-20 19:59:06,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,528 INFO L93 Difference]: Finished difference Result 330 states and 460 transitions. [2022-02-20 19:59:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 460 transitions. [2022-02-20 19:59:06,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:06,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:06,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:06,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-02-20 19:59:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 452 transitions. [2022-02-20 19:59:06,541 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 452 transitions. Word has length 59 [2022-02-20 19:59:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:06,541 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 452 transitions. [2022-02-20 19:59:06,541 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:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 452 transitions. [2022-02-20 19:59:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:06,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:06,543 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:06,555 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:06,752 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:06,753 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1899560551, now seen corresponding path program 1 times [2022-02-20 19:59:06,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:06,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133249505] [2022-02-20 19:59:06,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:06,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:06,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:06,755 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:06,756 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:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 19:59:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:06,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {5645#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {5645#true} is VALID [2022-02-20 19:59:06,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {5645#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1; {5645#true} is VALID [2022-02-20 19:59:06,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {5645#true} assume 0bv32 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} 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; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} call update_channels1(); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume !(1bv32 == ~q_req_up~0); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume true; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,997 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5656#(= ~c_dr_pc~0 (_ bv0 32))} {5656#(= ~c_dr_pc~0 (_ bv0 32))} #765#return; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume { :begin_inline_init_threads1 } true; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume { :end_inline_init_threads1 } true; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,999 INFO L272 TraceCheckUtils]: 12: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} call fire_delta_events1(); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:06,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume !(0bv32 == ~q_read_ev~0); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume !(0bv32 == ~q_write_ev~0); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume true; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,000 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5656#(= ~c_dr_pc~0 (_ bv0 32))} {5656#(= ~c_dr_pc~0 (_ bv0 32))} #767#return; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,001 INFO L272 TraceCheckUtils]: 17: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} call activate_threads1(); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} havoc ~tmp~1;havoc ~tmp___0~1; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,002 INFO L272 TraceCheckUtils]: 19: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} call #t~ret8 := is_do_write_p_triggered(); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} havoc ~__retres1~0; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume !(1bv32 == ~p_dw_pc~0); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} ~__retres1~0 := 0bv32; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} #res := ~__retres1~0; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume true; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,008 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5656#(= ~c_dr_pc~0 (_ bv0 32))} {5656#(= ~c_dr_pc~0 (_ bv0 32))} #761#return; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} ~tmp~1 := #t~ret8;havoc #t~ret8; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume !(0bv32 != ~tmp~1); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,010 INFO L272 TraceCheckUtils]: 28: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} call #t~ret9 := is_do_read_c_triggered(); {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} havoc ~__retres1~1; {5656#(= ~c_dr_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {5656#(= ~c_dr_pc~0 (_ bv0 32))} assume 1bv32 == ~c_dr_pc~0; {5646#false} is VALID [2022-02-20 19:59:07,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {5646#false} assume 1bv32 == ~q_write_ev~0;~__retres1~1 := 1bv32; {5646#false} is VALID [2022-02-20 19:59:07,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {5646#false} #res := ~__retres1~1; {5646#false} is VALID [2022-02-20 19:59:07,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {5646#false} assume true; {5646#false} is VALID [2022-02-20 19:59:07,011 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5646#false} {5656#(= ~c_dr_pc~0 (_ bv0 32))} #763#return; {5646#false} is VALID [2022-02-20 19:59:07,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {5646#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {5646#false} is VALID [2022-02-20 19:59:07,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {5646#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {5646#false} is VALID [2022-02-20 19:59:07,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {5646#false} assume true; {5646#false} is VALID [2022-02-20 19:59:07,012 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5646#false} {5656#(= ~c_dr_pc~0 (_ bv0 32))} #769#return; {5646#false} is VALID [2022-02-20 19:59:07,012 INFO L272 TraceCheckUtils]: 39: Hoare triple {5646#false} call reset_delta_events1(); {5646#false} is VALID [2022-02-20 19:59:07,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {5646#false} assume !(1bv32 == ~q_read_ev~0); {5646#false} is VALID [2022-02-20 19:59:07,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {5646#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {5646#false} is VALID [2022-02-20 19:59:07,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {5646#false} assume true; {5646#false} is VALID [2022-02-20 19:59:07,013 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5646#false} {5646#false} #771#return; {5646#false} is VALID [2022-02-20 19:59:07,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {5646#false} assume !false; {5646#false} is VALID [2022-02-20 19:59:07,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {5646#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; {5646#false} is VALID [2022-02-20 19:59:07,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {5646#false} assume !false; {5646#false} is VALID [2022-02-20 19:59:07,013 INFO L272 TraceCheckUtils]: 47: Hoare triple {5646#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5646#false} is VALID [2022-02-20 19:59:07,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {5646#false} havoc ~__retres1~2; {5646#false} is VALID [2022-02-20 19:59:07,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {5646#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {5646#false} is VALID [2022-02-20 19:59:07,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {5646#false} #res := ~__retres1~2; {5646#false} is VALID [2022-02-20 19:59:07,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {5646#false} assume true; {5646#false} is VALID [2022-02-20 19:59:07,014 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5646#false} {5646#false} #773#return; {5646#false} is VALID [2022-02-20 19:59:07,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {5646#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {5646#false} is VALID [2022-02-20 19:59:07,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {5646#false} assume 0bv32 != eval1_~tmp___1~0#1; {5646#false} is VALID [2022-02-20 19:59:07,019 INFO L290 TraceCheckUtils]: 55: Hoare triple {5646#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {5646#false} is VALID [2022-02-20 19:59:07,019 INFO L290 TraceCheckUtils]: 56: Hoare triple {5646#false} assume !(0bv32 != eval1_~tmp~2#1); {5646#false} is VALID [2022-02-20 19:59:07,019 INFO L272 TraceCheckUtils]: 57: Hoare triple {5646#false} call error1(); {5646#false} is VALID [2022-02-20 19:59:07,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {5646#false} assume !false; {5646#false} is VALID [2022-02-20 19:59:07,020 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:07,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:07,020 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:07,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133249505] [2022-02-20 19:59:07,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133249505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:07,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:07,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:59:07,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361428522] [2022-02-20 19:59:07,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 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:07,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:07,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:07,069 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:07,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:59:07,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:07,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:59:07,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:07,071 INFO L87 Difference]: Start difference. First operand 325 states and 452 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:07,425 INFO L93 Difference]: Finished difference Result 681 states and 927 transitions. [2022-02-20 19:59:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:59:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 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:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2022-02-20 19:59:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2022-02-20 19:59:07,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 548 transitions. [2022-02-20 19:59:07,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 548 edges. 548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:07,832 INFO L225 Difference]: With dead ends: 681 [2022-02-20 19:59:07,832 INFO L226 Difference]: Without dead ends: 498 [2022-02-20 19:59:07,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:07,834 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 279 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:07,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 442 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:07,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-02-20 19:59:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 483. [2022-02-20 19:59:07,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:07,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand has 483 states, 383 states have (on average 1.3864229765013054) internal successors, (531), 392 states have internal predecessors, (531), 58 states have call successors, (58), 35 states have call predecessors, (58), 40 states have return successors, (65), 58 states have call predecessors, (65), 55 states have call successors, (65) [2022-02-20 19:59:07,855 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand has 483 states, 383 states have (on average 1.3864229765013054) internal successors, (531), 392 states have internal predecessors, (531), 58 states have call successors, (58), 35 states have call predecessors, (58), 40 states have return successors, (65), 58 states have call predecessors, (65), 55 states have call successors, (65) [2022-02-20 19:59:07,856 INFO L87 Difference]: Start difference. First operand 498 states. Second operand has 483 states, 383 states have (on average 1.3864229765013054) internal successors, (531), 392 states have internal predecessors, (531), 58 states have call successors, (58), 35 states have call predecessors, (58), 40 states have return successors, (65), 58 states have call predecessors, (65), 55 states have call successors, (65) [2022-02-20 19:59:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:07,873 INFO L93 Difference]: Finished difference Result 498 states and 674 transitions. [2022-02-20 19:59:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 674 transitions. [2022-02-20 19:59:07,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:07,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:07,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 483 states, 383 states have (on average 1.3864229765013054) internal successors, (531), 392 states have internal predecessors, (531), 58 states have call successors, (58), 35 states have call predecessors, (58), 40 states have return successors, (65), 58 states have call predecessors, (65), 55 states have call successors, (65) Second operand 498 states. [2022-02-20 19:59:07,877 INFO L87 Difference]: Start difference. First operand has 483 states, 383 states have (on average 1.3864229765013054) internal successors, (531), 392 states have internal predecessors, (531), 58 states have call successors, (58), 35 states have call predecessors, (58), 40 states have return successors, (65), 58 states have call predecessors, (65), 55 states have call successors, (65) Second operand 498 states. [2022-02-20 19:59:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:07,894 INFO L93 Difference]: Finished difference Result 498 states and 674 transitions. [2022-02-20 19:59:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 674 transitions. [2022-02-20 19:59:07,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:07,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:07,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:07,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 383 states have (on average 1.3864229765013054) internal successors, (531), 392 states have internal predecessors, (531), 58 states have call successors, (58), 35 states have call predecessors, (58), 40 states have return successors, (65), 58 states have call predecessors, (65), 55 states have call successors, (65) [2022-02-20 19:59:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 654 transitions. [2022-02-20 19:59:07,917 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 654 transitions. Word has length 59 [2022-02-20 19:59:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:07,917 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 654 transitions. [2022-02-20 19:59:07,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 654 transitions. [2022-02-20 19:59:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:07,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:07,919 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:07,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 19:59:08,128 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:08,129 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:08,129 INFO L85 PathProgramCache]: Analyzing trace with hash 927885864, now seen corresponding path program 1 times [2022-02-20 19:59:08,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:08,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548689507] [2022-02-20 19:59:08,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:08,131 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:08,131 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:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:08,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {8414#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {8414#true} is VALID [2022-02-20 19:59:08,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {8414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1; {8414#true} is VALID [2022-02-20 19:59:08,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {8414#true} assume 0bv32 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {8414#true} is VALID [2022-02-20 19:59:08,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {8414#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; {8414#true} is VALID [2022-02-20 19:59:08,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {8414#true} call update_channels1(); {8414#true} is VALID [2022-02-20 19:59:08,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {8414#true} assume !(1bv32 == ~q_req_up~0); {8414#true} is VALID [2022-02-20 19:59:08,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {8414#true} assume true; {8414#true} is VALID [2022-02-20 19:59:08,373 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8414#true} {8414#true} #765#return; {8414#true} is VALID [2022-02-20 19:59:08,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {8414#true} assume { :begin_inline_init_threads1 } true; {8414#true} is VALID [2022-02-20 19:59:08,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {8414#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {8414#true} is VALID [2022-02-20 19:59:08,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {8414#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {8414#true} is VALID [2022-02-20 19:59:08,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {8414#true} assume { :end_inline_init_threads1 } true; {8414#true} is VALID [2022-02-20 19:59:08,373 INFO L272 TraceCheckUtils]: 12: Hoare triple {8414#true} call fire_delta_events1(); {8414#true} is VALID [2022-02-20 19:59:08,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {8414#true} assume !(0bv32 == ~q_read_ev~0); {8414#true} is VALID [2022-02-20 19:59:08,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {8414#true} assume !(0bv32 == ~q_write_ev~0); {8414#true} is VALID [2022-02-20 19:59:08,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {8414#true} assume true; {8414#true} is VALID [2022-02-20 19:59:08,374 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8414#true} {8414#true} #767#return; {8414#true} is VALID [2022-02-20 19:59:08,374 INFO L272 TraceCheckUtils]: 17: Hoare triple {8414#true} call activate_threads1(); {8414#true} is VALID [2022-02-20 19:59:08,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {8414#true} havoc ~tmp~1;havoc ~tmp___0~1; {8414#true} is VALID [2022-02-20 19:59:08,375 INFO L272 TraceCheckUtils]: 19: Hoare triple {8414#true} call #t~ret8 := is_do_write_p_triggered(); {8414#true} is VALID [2022-02-20 19:59:08,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {8414#true} havoc ~__retres1~0; {8414#true} is VALID [2022-02-20 19:59:08,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {8414#true} assume !(1bv32 == ~p_dw_pc~0); {8414#true} is VALID [2022-02-20 19:59:08,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {8414#true} ~__retres1~0 := 0bv32; {8414#true} is VALID [2022-02-20 19:59:08,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {8414#true} #res := ~__retres1~0; {8414#true} is VALID [2022-02-20 19:59:08,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {8414#true} assume true; {8414#true} is VALID [2022-02-20 19:59:08,376 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8414#true} {8414#true} #761#return; {8414#true} is VALID [2022-02-20 19:59:08,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {8414#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {8414#true} is VALID [2022-02-20 19:59:08,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {8414#true} assume !(0bv32 != ~tmp~1); {8414#true} is VALID [2022-02-20 19:59:08,376 INFO L272 TraceCheckUtils]: 28: Hoare triple {8414#true} call #t~ret9 := is_do_read_c_triggered(); {8414#true} is VALID [2022-02-20 19:59:08,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {8414#true} havoc ~__retres1~1; {8414#true} is VALID [2022-02-20 19:59:08,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {8414#true} assume !(1bv32 == ~c_dr_pc~0); {8414#true} is VALID [2022-02-20 19:59:08,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {8414#true} ~__retres1~1 := 0bv32; {8512#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 19:59:08,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {8512#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {8516#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:08,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {8516#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {8516#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:08,380 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8516#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {8414#true} #763#return; {8523#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:08,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {8523#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {8527#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 19:59:08,380 INFO L290 TraceCheckUtils]: 36: Hoare triple {8527#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {8415#false} is VALID [2022-02-20 19:59:08,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {8415#false} assume true; {8415#false} is VALID [2022-02-20 19:59:08,381 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8415#false} {8414#true} #769#return; {8415#false} is VALID [2022-02-20 19:59:08,381 INFO L272 TraceCheckUtils]: 39: Hoare triple {8415#false} call reset_delta_events1(); {8415#false} is VALID [2022-02-20 19:59:08,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {8415#false} assume !(1bv32 == ~q_read_ev~0); {8415#false} is VALID [2022-02-20 19:59:08,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {8415#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {8415#false} is VALID [2022-02-20 19:59:08,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {8415#false} assume true; {8415#false} is VALID [2022-02-20 19:59:08,381 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8415#false} {8415#false} #771#return; {8415#false} is VALID [2022-02-20 19:59:08,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {8415#false} assume !false; {8415#false} is VALID [2022-02-20 19:59:08,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {8415#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; {8415#false} is VALID [2022-02-20 19:59:08,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {8415#false} assume !false; {8415#false} is VALID [2022-02-20 19:59:08,382 INFO L272 TraceCheckUtils]: 47: Hoare triple {8415#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8415#false} is VALID [2022-02-20 19:59:08,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {8415#false} havoc ~__retres1~2; {8415#false} is VALID [2022-02-20 19:59:08,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {8415#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {8415#false} is VALID [2022-02-20 19:59:08,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {8415#false} #res := ~__retres1~2; {8415#false} is VALID [2022-02-20 19:59:08,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {8415#false} assume true; {8415#false} is VALID [2022-02-20 19:59:08,383 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8415#false} {8415#false} #773#return; {8415#false} is VALID [2022-02-20 19:59:08,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {8415#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {8415#false} is VALID [2022-02-20 19:59:08,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {8415#false} assume 0bv32 != eval1_~tmp___1~0#1; {8415#false} is VALID [2022-02-20 19:59:08,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {8415#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {8415#false} is VALID [2022-02-20 19:59:08,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {8415#false} assume !(0bv32 != eval1_~tmp~2#1); {8415#false} is VALID [2022-02-20 19:59:08,384 INFO L272 TraceCheckUtils]: 57: Hoare triple {8415#false} call error1(); {8415#false} is VALID [2022-02-20 19:59:08,384 INFO L290 TraceCheckUtils]: 58: Hoare triple {8415#false} assume !false; {8415#false} is VALID [2022-02-20 19:59:08,384 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:08,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:08,384 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:08,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548689507] [2022-02-20 19:59:08,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548689507] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:08,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:08,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:08,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702849017] [2022-02-20 19:59:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:08,386 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:08,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:08,386 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:08,430 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:08,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:08,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:08,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:08,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:08,432 INFO L87 Difference]: Start difference. First operand 483 states and 654 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:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:09,210 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions. [2022-02-20 19:59:09,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:09,210 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:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:09,211 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:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 445 transitions. [2022-02-20 19:59:09,215 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:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 445 transitions. [2022-02-20 19:59:09,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 445 transitions. [2022-02-20 19:59:09,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:09,570 INFO L225 Difference]: With dead ends: 838 [2022-02-20 19:59:09,570 INFO L226 Difference]: Without dead ends: 497 [2022-02-20 19:59:09,571 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:09,574 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 4 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1570 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:09,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1570 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:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-02-20 19:59:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 493. [2022-02-20 19:59:09,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:09,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 493 states, 391 states have (on average 1.3734015345268542) internal successors, (537), 400 states have internal predecessors, (537), 58 states have call successors, (58), 35 states have call predecessors, (58), 42 states have return successors, (67), 60 states have call predecessors, (67), 55 states have call successors, (67) [2022-02-20 19:59:09,599 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 493 states, 391 states have (on average 1.3734015345268542) internal successors, (537), 400 states have internal predecessors, (537), 58 states have call successors, (58), 35 states have call predecessors, (58), 42 states have return successors, (67), 60 states have call predecessors, (67), 55 states have call successors, (67) [2022-02-20 19:59:09,600 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 493 states, 391 states have (on average 1.3734015345268542) internal successors, (537), 400 states have internal predecessors, (537), 58 states have call successors, (58), 35 states have call predecessors, (58), 42 states have return successors, (67), 60 states have call predecessors, (67), 55 states have call successors, (67) [2022-02-20 19:59:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:09,617 INFO L93 Difference]: Finished difference Result 497 states and 666 transitions. [2022-02-20 19:59:09,617 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 666 transitions. [2022-02-20 19:59:09,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:09,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:09,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 493 states, 391 states have (on average 1.3734015345268542) internal successors, (537), 400 states have internal predecessors, (537), 58 states have call successors, (58), 35 states have call predecessors, (58), 42 states have return successors, (67), 60 states have call predecessors, (67), 55 states have call successors, (67) Second operand 497 states. [2022-02-20 19:59:09,622 INFO L87 Difference]: Start difference. First operand has 493 states, 391 states have (on average 1.3734015345268542) internal successors, (537), 400 states have internal predecessors, (537), 58 states have call successors, (58), 35 states have call predecessors, (58), 42 states have return successors, (67), 60 states have call predecessors, (67), 55 states have call successors, (67) Second operand 497 states. [2022-02-20 19:59:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:09,639 INFO L93 Difference]: Finished difference Result 497 states and 666 transitions. [2022-02-20 19:59:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 666 transitions. [2022-02-20 19:59:09,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:09,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:09,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:09,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 391 states have (on average 1.3734015345268542) internal successors, (537), 400 states have internal predecessors, (537), 58 states have call successors, (58), 35 states have call predecessors, (58), 42 states have return successors, (67), 60 states have call predecessors, (67), 55 states have call successors, (67) [2022-02-20 19:59:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 662 transitions. [2022-02-20 19:59:09,661 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 662 transitions. Word has length 59 [2022-02-20 19:59:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:09,662 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 662 transitions. [2022-02-20 19:59:09,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:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 662 transitions. [2022-02-20 19:59:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:09,664 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:09,664 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:09,677 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:09,874 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:09,875 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:09,875 INFO L85 PathProgramCache]: Analyzing trace with hash -877552470, now seen corresponding path program 1 times [2022-02-20 19:59:09,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:09,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167178827] [2022-02-20 19:59:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:09,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:09,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:09,877 INFO L229 MonitoredProcess]: Starting monitored process 7 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:09,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 19:59:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 19:59:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:10,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {11407#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;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {11407#true} is VALID [2022-02-20 19:59:10,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {11407#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1; {11407#true} is VALID [2022-02-20 19:59:10,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {11407#true} assume 0bv32 != main_#t~nondet30#1;havoc main_#t~nondet30#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {11418#(= (_ 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; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,158 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {11418#(= (_ bv2 32) ~q_write_ev~0)} #765#return; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,161 INFO L272 TraceCheckUtils]: 12: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_write_ev~0); {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,175 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {11418#(= (_ bv2 32) ~q_write_ev~0)} #767#return; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,176 INFO L272 TraceCheckUtils]: 17: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} call activate_threads1(); {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} havoc ~tmp~1;havoc ~tmp___0~1; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,177 INFO L272 TraceCheckUtils]: 19: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} call #t~ret8 := is_do_write_p_triggered(); {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} havoc ~__retres1~0; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume !(1bv32 == ~p_dw_pc~0); {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} ~__retres1~0 := 0bv32; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} #res := ~__retres1~0; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume true; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,179 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11418#(= (_ bv2 32) ~q_write_ev~0)} {11418#(= (_ bv2 32) ~q_write_ev~0)} #761#return; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} ~tmp~1 := #t~ret8;havoc #t~ret8; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume !(0bv32 != ~tmp~1); {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,180 INFO L272 TraceCheckUtils]: 28: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} call #t~ret9 := is_do_read_c_triggered(); {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} havoc ~__retres1~1; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume !(1bv32 == ~c_dr_pc~0); {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} ~__retres1~1 := 0bv32; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} #res := ~__retres1~1; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume true; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,182 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11418#(= (_ bv2 32) ~q_write_ev~0)} {11418#(= (_ bv2 32) ~q_write_ev~0)} #763#return; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume !(0bv32 != ~tmp___0~1); {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} assume true; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,183 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11418#(= (_ bv2 32) ~q_write_ev~0)} {11418#(= (_ bv2 32) ~q_write_ev~0)} #769#return; {11418#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,184 INFO L272 TraceCheckUtils]: 39: Hoare triple {11418#(= (_ bv2 32) ~q_write_ev~0)} call reset_delta_events1(); {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_read_ev~0); {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:10,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {11425#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {11537#(= |old(~q_write_ev~0)| (_ bv1 32))} is VALID [2022-02-20 19:59:10,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {11537#(= |old(~q_write_ev~0)| (_ bv1 32))} assume true; {11537#(= |old(~q_write_ev~0)| (_ bv1 32))} is VALID [2022-02-20 19:59:10,185 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11537#(= |old(~q_write_ev~0)| (_ bv1 32))} {11418#(= (_ bv2 32) ~q_write_ev~0)} #771#return; {11408#false} is VALID [2022-02-20 19:59:10,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-02-20 19:59:10,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {11408#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; {11408#false} is VALID [2022-02-20 19:59:10,185 INFO L290 TraceCheckUtils]: 46: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-02-20 19:59:10,185 INFO L272 TraceCheckUtils]: 47: Hoare triple {11408#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L290 TraceCheckUtils]: 48: Hoare triple {11408#false} havoc ~__retres1~2; {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {11408#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L290 TraceCheckUtils]: 50: Hoare triple {11408#false} #res := ~__retres1~2; {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L290 TraceCheckUtils]: 51: Hoare triple {11408#false} assume true; {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11408#false} {11408#false} #773#return; {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {11408#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {11408#false} assume 0bv32 != eval1_~tmp___1~0#1; {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {11408#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {11408#false} assume !(0bv32 != eval1_~tmp~2#1); {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L272 TraceCheckUtils]: 57: Hoare triple {11408#false} call error1(); {11408#false} is VALID [2022-02-20 19:59:10,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {11408#false} assume !false; {11408#false} is VALID [2022-02-20 19:59:10,187 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:10,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:10,187 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:10,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167178827] [2022-02-20 19:59:10,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167178827] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:10,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:10,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:10,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149692580] [2022-02-20 19:59:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:10,188 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), 3 states have call predecessors, (8), 4 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:10,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:10,188 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), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:10,230 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:10,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:10,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:10,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:10,231 INFO L87 Difference]: Start difference. First operand 493 states and 662 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), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:11,520 INFO L93 Difference]: Finished difference Result 1251 states and 1670 transitions. [2022-02-20 19:59:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:59:11,520 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), 3 states have call predecessors, (8), 4 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:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:11,521 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), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions. [2022-02-20 19:59:11,527 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), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions. [2022-02-20 19:59:11,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 590 transitions. [2022-02-20 19:59:11,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:12,042 INFO L225 Difference]: With dead ends: 1251 [2022-02-20 19:59:12,042 INFO L226 Difference]: Without dead ends: 898 [2022-02-20 19:59:12,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:59:12,044 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 242 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:12,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 822 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:59:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-02-20 19:59:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 881. [2022-02-20 19:59:12,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:12,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 898 states. Second operand has 881 states, 695 states have (on average 1.3338129496402877) internal successors, (927), 720 states have internal predecessors, (927), 96 states have call successors, (96), 63 states have call predecessors, (96), 88 states have return successors, (141), 102 states have call predecessors, (141), 93 states have call successors, (141) [2022-02-20 19:59:12,078 INFO L74 IsIncluded]: Start isIncluded. First operand 898 states. Second operand has 881 states, 695 states have (on average 1.3338129496402877) internal successors, (927), 720 states have internal predecessors, (927), 96 states have call successors, (96), 63 states have call predecessors, (96), 88 states have return successors, (141), 102 states have call predecessors, (141), 93 states have call successors, (141) [2022-02-20 19:59:12,079 INFO L87 Difference]: Start difference. First operand 898 states. Second operand has 881 states, 695 states have (on average 1.3338129496402877) internal successors, (927), 720 states have internal predecessors, (927), 96 states have call successors, (96), 63 states have call predecessors, (96), 88 states have return successors, (141), 102 states have call predecessors, (141), 93 states have call successors, (141) [2022-02-20 19:59:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,128 INFO L93 Difference]: Finished difference Result 898 states and 1182 transitions. [2022-02-20 19:59:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1182 transitions. [2022-02-20 19:59:12,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 881 states, 695 states have (on average 1.3338129496402877) internal successors, (927), 720 states have internal predecessors, (927), 96 states have call successors, (96), 63 states have call predecessors, (96), 88 states have return successors, (141), 102 states have call predecessors, (141), 93 states have call successors, (141) Second operand 898 states. [2022-02-20 19:59:12,134 INFO L87 Difference]: Start difference. First operand has 881 states, 695 states have (on average 1.3338129496402877) internal successors, (927), 720 states have internal predecessors, (927), 96 states have call successors, (96), 63 states have call predecessors, (96), 88 states have return successors, (141), 102 states have call predecessors, (141), 93 states have call successors, (141) Second operand 898 states. [2022-02-20 19:59:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,177 INFO L93 Difference]: Finished difference Result 898 states and 1182 transitions. [2022-02-20 19:59:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1182 transitions. [2022-02-20 19:59:12,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:12,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 695 states have (on average 1.3338129496402877) internal successors, (927), 720 states have internal predecessors, (927), 96 states have call successors, (96), 63 states have call predecessors, (96), 88 states have return successors, (141), 102 states have call predecessors, (141), 93 states have call successors, (141) [2022-02-20 19:59:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1164 transitions. [2022-02-20 19:59:12,235 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1164 transitions. Word has length 59 [2022-02-20 19:59:12,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:12,235 INFO L470 AbstractCegarLoop]: Abstraction has 881 states and 1164 transitions. [2022-02-20 19:59:12,236 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), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1164 transitions. [2022-02-20 19:59:12,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:12,237 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:12,237 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:12,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 19:59:12,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:12,448 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1423270120, now seen corresponding path program 1 times [2022-02-20 19:59:12,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:12,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478752260] [2022-02-20 19:59:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:12,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:12,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:12,450 INFO L229 MonitoredProcess]: Starting monitored process 8 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:12,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 19:59:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:12,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:12,607 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:12,607 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:12,608 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:12,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:12,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:12,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:59:12,822 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:12,824 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:12,882 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:12,882 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:12,886 INFO L158 Benchmark]: Toolchain (without parser) took 13729.02ms. Allocated memory was 56.6MB in the beginning and 109.1MB in the end (delta: 52.4MB). Free memory was 35.0MB in the beginning and 33.8MB in the end (delta: 1.2MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,887 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.6MB in the end (delta: 47.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:12,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.97ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 34.9MB in the beginning and 48.0MB in the end (delta: -13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.51ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 44.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,888 INFO L158 Benchmark]: Boogie Preprocessor took 49.86ms. Allocated memory is still 71.3MB. Free memory was 44.6MB in the beginning and 41.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,888 INFO L158 Benchmark]: RCFGBuilder took 729.84ms. Allocated memory is still 71.3MB. Free memory was 41.5MB in the beginning and 48.1MB in the end (delta: -6.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,889 INFO L158 Benchmark]: TraceAbstraction took 12405.75ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 47.7MB in the beginning and 33.8MB in the end (delta: 13.9MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,890 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 56.6MB. Free memory was 38.7MB in the beginning and 38.6MB in the end (delta: 47.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.97ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 34.9MB in the beginning and 48.0MB in the end (delta: -13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.51ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 44.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.86ms. Allocated memory is still 71.3MB. Free memory was 44.6MB in the beginning and 41.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 729.84ms. Allocated memory is still 71.3MB. Free memory was 41.5MB in the beginning and 48.1MB in the end (delta: -6.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12405.75ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 47.7MB in the beginning and 33.8MB in the end (delta: 13.9MB). Peak memory consumption was 49.9MB. 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:12,922 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