./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:37,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:37,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:37,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:37,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:37,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:37,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:37,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:37,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:37,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:37,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:37,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:37,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:37,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:37,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:37,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:37,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:37,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:37,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:37,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:37,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:37,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:37,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:37,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:37,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:37,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:37,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:37,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:37,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:37,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:37,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:37,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:37,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:37,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:37,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:37,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:37,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:37,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:37,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:37,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:37,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:37,527 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:37,559 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:37,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:37,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:37,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:37,561 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:37,561 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:37,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:37,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:37,562 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:37,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:37,563 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:37,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:37,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:37,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:37,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:37,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:37,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:37,565 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:37,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:37,565 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:37,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:37,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:37,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:37,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:37,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:37,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:37,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:37,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:37,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:37,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:37,567 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:37,567 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:37,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:37,568 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 -> 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f [2022-02-20 19:58:37,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:37,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:37,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:37,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:37,862 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:37,864 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.03.cil-2.c [2022-02-20 19:58:37,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7c0b22d/d0d29e45947e4371ad367483baf3dbc3/FLAG91853e8ab [2022-02-20 19:58:38,370 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:38,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2022-02-20 19:58:38,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7c0b22d/d0d29e45947e4371ad367483baf3dbc3/FLAG91853e8ab [2022-02-20 19:58:38,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7c0b22d/d0d29e45947e4371ad367483baf3dbc3 [2022-02-20 19:58:38,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:38,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:38,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:38,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:38,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:38,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:38" (1/1) ... [2022-02-20 19:58:38,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17443a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:38, skipping insertion in model container [2022-02-20 19:58:38,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:38" (1/1) ... [2022-02-20 19:58:38,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:38,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:39,084 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.03.cil-2.c[914,927] [2022-02-20 19:58:39,152 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.03.cil-2.c[7125,7138] [2022-02-20 19:58:39,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:39,197 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:39,208 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.03.cil-2.c[914,927] [2022-02-20 19:58:39,240 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.03.cil-2.c[7125,7138] [2022-02-20 19:58:39,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:39,301 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:39,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:39 WrapperNode [2022-02-20 19:58:39,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:39,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:39,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:39,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:39,311 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:39" (1/1) ... [2022-02-20 19:58:39,321 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:39" (1/1) ... [2022-02-20 19:58:39,373 INFO L137 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 519 [2022-02-20 19:58:39,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:39,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:39,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:39,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:39,388 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:39" (1/1) ... [2022-02-20 19:58:39,389 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:39" (1/1) ... [2022-02-20 19:58:39,395 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:39" (1/1) ... [2022-02-20 19:58:39,407 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:39" (1/1) ... [2022-02-20 19:58:39,416 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:39" (1/1) ... [2022-02-20 19:58:39,427 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:39" (1/1) ... [2022-02-20 19:58:39,430 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:39" (1/1) ... [2022-02-20 19:58:39,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:39,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:39,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:39,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:39,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:39" (1/1) ... [2022-02-20 19:58:39,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:39,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:39,472 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:39,477 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:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:39,505 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:39,506 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:39,506 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:39,506 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:39,507 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:39,507 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:39,507 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:39,508 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:39,508 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:39,508 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:39,509 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:39,509 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:39,509 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:39,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:39,510 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:39,651 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:39,664 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:40,292 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:40,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:40,305 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 19:58:40,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:40 BoogieIcfgContainer [2022-02-20 19:58:40,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:40,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:40,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:40,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:40,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:38" (1/3) ... [2022-02-20 19:58:40,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cd649d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:40, skipping insertion in model container [2022-02-20 19:58:40,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:39" (2/3) ... [2022-02-20 19:58:40,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48cd649d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:40, skipping insertion in model container [2022-02-20 19:58:40,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:40" (3/3) ... [2022-02-20 19:58:40,316 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2022-02-20 19:58:40,321 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:40,322 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:40,369 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:40,373 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:40,373 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 19:58:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:40,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:40,408 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:40,409 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:40,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1774585736, now seen corresponding path program 1 times [2022-02-20 19:58:40,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:40,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17636477] [2022-02-20 19:58:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#(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); {303#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {303#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {303#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {264#(= ~q_read_ev~0 2)} #877#return; {264#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#(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; {305#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:40,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {305#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:40,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#(= |old(~q_read_ev~0)| 0)} assume true; {305#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:40,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#(= |old(~q_read_ev~0)| 0)} {264#(= ~q_read_ev~0 2)} #879#return; {263#false} is VALID [2022-02-20 19:58:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} havoc ~__retres1~0; {262#true} is VALID [2022-02-20 19:58:40,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume 1 == ~p_dw_pc~0; {262#true} is VALID [2022-02-20 19:58:40,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {262#true} is VALID [2022-02-20 19:58:40,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} #res := ~__retres1~0; {262#true} is VALID [2022-02-20 19:58:40,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,778 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {262#true} {262#true} #873#return; {262#true} is VALID [2022-02-20 19:58:40,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} havoc ~__retres1~1; {262#true} is VALID [2022-02-20 19:58:40,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume !(1 == ~c_dr_pc~0); {262#true} is VALID [2022-02-20 19:58:40,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} ~__retres1~1 := 0; {262#true} is VALID [2022-02-20 19:58:40,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} #res := ~__retres1~1; {262#true} is VALID [2022-02-20 19:58:40,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,785 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {262#true} {262#true} #875#return; {262#true} is VALID [2022-02-20 19:58:40,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {306#(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; {262#true} is VALID [2022-02-20 19:58:40,785 INFO L272 TraceCheckUtils]: 1: Hoare triple {262#true} call #t~ret8 := is_do_write_p_triggered(); {262#true} is VALID [2022-02-20 19:58:40,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} havoc ~__retres1~0; {262#true} is VALID [2022-02-20 19:58:40,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} assume 1 == ~p_dw_pc~0; {262#true} is VALID [2022-02-20 19:58:40,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {262#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {262#true} is VALID [2022-02-20 19:58:40,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} #res := ~__retres1~0; {262#true} is VALID [2022-02-20 19:58:40,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,787 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {262#true} {262#true} #873#return; {262#true} is VALID [2022-02-20 19:58:40,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {262#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {262#true} is VALID [2022-02-20 19:58:40,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {262#true} is VALID [2022-02-20 19:58:40,787 INFO L272 TraceCheckUtils]: 10: Hoare triple {262#true} call #t~ret9 := is_do_read_c_triggered(); {262#true} is VALID [2022-02-20 19:58:40,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} havoc ~__retres1~1; {262#true} is VALID [2022-02-20 19:58:40,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume !(1 == ~c_dr_pc~0); {262#true} is VALID [2022-02-20 19:58:40,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#true} ~__retres1~1 := 0; {262#true} is VALID [2022-02-20 19:58:40,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#true} #res := ~__retres1~1; {262#true} is VALID [2022-02-20 19:58:40,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,789 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {262#true} {262#true} #875#return; {262#true} is VALID [2022-02-20 19:58:40,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {262#true} is VALID [2022-02-20 19:58:40,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {262#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {262#true} is VALID [2022-02-20 19:58:40,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,790 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {262#true} {263#false} #881#return; {263#false} is VALID [2022-02-20 19:58:40,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#(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; {262#true} is VALID [2022-02-20 19:58:40,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {262#true} is VALID [2022-02-20 19:58:40,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {263#false} #883#return; {263#false} is VALID [2022-02-20 19:58:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} havoc ~__retres1~2; {262#true} is VALID [2022-02-20 19:58:40,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {262#true} is VALID [2022-02-20 19:58:40,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} #res := ~__retres1~2; {262#true} is VALID [2022-02-20 19:58:40,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,804 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {262#true} {263#false} #885#return; {263#false} is VALID [2022-02-20 19:58:40,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {262#true} is VALID [2022-02-20 19:58:40,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {262#true} is VALID [2022-02-20 19:58:40,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {264#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:40,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {264#(= ~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; {264#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:40,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(= ~q_read_ev~0 2)} call update_channels1(); {302#(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,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#(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); {303#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {303#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {303#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,809 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {303#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {264#(= ~q_read_ev~0 2)} #877#return; {264#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:40,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {264#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:40,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {264#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:40,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {264#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {264#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:40,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {264#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {264#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:40,812 INFO L272 TraceCheckUtils]: 12: Hoare triple {264#(= ~q_read_ev~0 2)} call fire_delta_events1(); {304#(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,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#(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; {305#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:40,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {305#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:40,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#(= |old(~q_read_ev~0)| 0)} assume true; {305#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:40,814 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {305#(= |old(~q_read_ev~0)| 0)} {264#(= ~q_read_ev~0 2)} #879#return; {263#false} is VALID [2022-02-20 19:58:40,814 INFO L272 TraceCheckUtils]: 17: Hoare triple {263#false} call activate_threads1(); {306#(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,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {306#(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; {262#true} is VALID [2022-02-20 19:58:40,815 INFO L272 TraceCheckUtils]: 19: Hoare triple {262#true} call #t~ret8 := is_do_write_p_triggered(); {262#true} is VALID [2022-02-20 19:58:40,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {262#true} havoc ~__retres1~0; {262#true} is VALID [2022-02-20 19:58:40,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {262#true} assume 1 == ~p_dw_pc~0; {262#true} is VALID [2022-02-20 19:58:40,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {262#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {262#true} is VALID [2022-02-20 19:58:40,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {262#true} #res := ~__retres1~0; {262#true} is VALID [2022-02-20 19:58:40,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,816 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {262#true} {262#true} #873#return; {262#true} is VALID [2022-02-20 19:58:40,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {262#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {262#true} is VALID [2022-02-20 19:58:40,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {262#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {262#true} is VALID [2022-02-20 19:58:40,817 INFO L272 TraceCheckUtils]: 28: Hoare triple {262#true} call #t~ret9 := is_do_read_c_triggered(); {262#true} is VALID [2022-02-20 19:58:40,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {262#true} havoc ~__retres1~1; {262#true} is VALID [2022-02-20 19:58:40,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {262#true} assume !(1 == ~c_dr_pc~0); {262#true} is VALID [2022-02-20 19:58:40,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {262#true} ~__retres1~1 := 0; {262#true} is VALID [2022-02-20 19:58:40,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {262#true} #res := ~__retres1~1; {262#true} is VALID [2022-02-20 19:58:40,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,818 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {262#true} {262#true} #875#return; {262#true} is VALID [2022-02-20 19:58:40,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {262#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {262#true} is VALID [2022-02-20 19:58:40,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {262#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {262#true} is VALID [2022-02-20 19:58:40,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,819 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {262#true} {263#false} #881#return; {263#false} is VALID [2022-02-20 19:58:40,820 INFO L272 TraceCheckUtils]: 39: Hoare triple {263#false} call reset_delta_events1(); {304#(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,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {304#(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; {262#true} is VALID [2022-02-20 19:58:40,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {262#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {262#true} is VALID [2022-02-20 19:58:40,820 INFO L290 TraceCheckUtils]: 42: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,821 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {262#true} {263#false} #883#return; {263#false} is VALID [2022-02-20 19:58:40,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 19:58:40,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {263#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; {263#false} is VALID [2022-02-20 19:58:40,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 19:58:40,822 INFO L272 TraceCheckUtils]: 47: Hoare triple {263#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {262#true} is VALID [2022-02-20 19:58:40,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {262#true} havoc ~__retres1~2; {262#true} is VALID [2022-02-20 19:58:40,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {262#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {262#true} is VALID [2022-02-20 19:58:40,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {262#true} #res := ~__retres1~2; {262#true} is VALID [2022-02-20 19:58:40,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 19:58:40,823 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {262#true} {263#false} #885#return; {263#false} is VALID [2022-02-20 19:58:40,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {263#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; {263#false} is VALID [2022-02-20 19:58:40,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {263#false} assume 0 != eval1_~tmp___1~0#1; {263#false} is VALID [2022-02-20 19:58:40,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {263#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; {263#false} is VALID [2022-02-20 19:58:40,824 INFO L290 TraceCheckUtils]: 56: Hoare triple {263#false} assume !(0 != eval1_~tmp~2#1); {263#false} is VALID [2022-02-20 19:58:40,824 INFO L272 TraceCheckUtils]: 57: Hoare triple {263#false} call error1(); {263#false} is VALID [2022-02-20 19:58:40,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 19:58:40,825 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,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:40,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17636477] [2022-02-20 19:58:40,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17636477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:40,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:40,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:40,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831870173] [2022-02-20 19:58:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:40,833 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:40,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:40,837 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:40,901 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,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:40,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:40,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:40,933 INFO L87 Difference]: Start difference. First operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) 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:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,516 INFO L93 Difference]: Finished difference Result 635 states and 966 transitions. [2022-02-20 19:58:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:43,516 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:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:43,518 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:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 966 transitions. [2022-02-20 19:58:43,544 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:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 966 transitions. [2022-02-20 19:58:43,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 966 transitions. [2022-02-20 19:58:44,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 966 edges. 966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:44,375 INFO L225 Difference]: With dead ends: 635 [2022-02-20 19:58:44,375 INFO L226 Difference]: Without dead ends: 385 [2022-02-20 19:58:44,380 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:44,382 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 657 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:44,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 1056 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-02-20 19:58:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 345. [2022-02-20 19:58:44,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:44,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 385 states. Second operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:58:44,442 INFO L74 IsIncluded]: Start isIncluded. First operand 385 states. Second operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:58:44,444 INFO L87 Difference]: Start difference. First operand 385 states. Second operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:58:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:44,468 INFO L93 Difference]: Finished difference Result 385 states and 546 transitions. [2022-02-20 19:58:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 546 transitions. [2022-02-20 19:58:44,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:44,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:44,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) Second operand 385 states. [2022-02-20 19:58:44,484 INFO L87 Difference]: Start difference. First operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) Second operand 385 states. [2022-02-20 19:58:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:44,506 INFO L93 Difference]: Finished difference Result 385 states and 546 transitions. [2022-02-20 19:58:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 546 transitions. [2022-02-20 19:58:44,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:44,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:44,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:44,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:58:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 491 transitions. [2022-02-20 19:58:44,530 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 491 transitions. Word has length 59 [2022-02-20 19:58:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:44,532 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 491 transitions. [2022-02-20 19:58:44,533 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:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 491 transitions. [2022-02-20 19:58:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:44,537 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:44,537 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:44,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:44,538 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1011936105, now seen corresponding path program 1 times [2022-02-20 19:58:44,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:44,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641312497] [2022-02-20 19:58:44,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {2490#(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); {2491#(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:44,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {2491#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2491#(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:44,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2491#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2452#(= ~q_write_ev~0 ~q_read_ev~0)} #877#return; {2452#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:44,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {2491#(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); {2492#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:44,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {2492#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2493#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:44,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {2493#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2493#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:44,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2493#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2452#(= ~q_write_ev~0 ~q_read_ev~0)} #879#return; {2451#false} is VALID [2022-02-20 19:58:44,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {2450#true} havoc ~__retres1~0; {2450#true} is VALID [2022-02-20 19:58:44,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {2450#true} assume !(1 == ~p_dw_pc~0); {2450#true} is VALID [2022-02-20 19:58:44,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {2450#true} ~__retres1~0 := 0; {2450#true} is VALID [2022-02-20 19:58:44,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {2450#true} #res := ~__retres1~0; {2450#true} is VALID [2022-02-20 19:58:44,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,705 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2450#true} {2450#true} #873#return; {2450#true} is VALID [2022-02-20 19:58:44,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {2450#true} havoc ~__retres1~1; {2450#true} is VALID [2022-02-20 19:58:44,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {2450#true} assume !(1 == ~c_dr_pc~0); {2450#true} is VALID [2022-02-20 19:58:44,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {2450#true} ~__retres1~1 := 0; {2450#true} is VALID [2022-02-20 19:58:44,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {2450#true} #res := ~__retres1~1; {2450#true} is VALID [2022-02-20 19:58:44,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,713 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2450#true} {2450#true} #875#return; {2450#true} is VALID [2022-02-20 19:58:44,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {2494#(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; {2450#true} is VALID [2022-02-20 19:58:44,714 INFO L272 TraceCheckUtils]: 1: Hoare triple {2450#true} call #t~ret8 := is_do_write_p_triggered(); {2450#true} is VALID [2022-02-20 19:58:44,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {2450#true} havoc ~__retres1~0; {2450#true} is VALID [2022-02-20 19:58:44,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {2450#true} assume !(1 == ~p_dw_pc~0); {2450#true} is VALID [2022-02-20 19:58:44,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {2450#true} ~__retres1~0 := 0; {2450#true} is VALID [2022-02-20 19:58:44,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {2450#true} #res := ~__retres1~0; {2450#true} is VALID [2022-02-20 19:58:44,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,715 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2450#true} {2450#true} #873#return; {2450#true} is VALID [2022-02-20 19:58:44,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {2450#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2450#true} is VALID [2022-02-20 19:58:44,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {2450#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2450#true} is VALID [2022-02-20 19:58:44,716 INFO L272 TraceCheckUtils]: 10: Hoare triple {2450#true} call #t~ret9 := is_do_read_c_triggered(); {2450#true} is VALID [2022-02-20 19:58:44,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {2450#true} havoc ~__retres1~1; {2450#true} is VALID [2022-02-20 19:58:44,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {2450#true} assume !(1 == ~c_dr_pc~0); {2450#true} is VALID [2022-02-20 19:58:44,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {2450#true} ~__retres1~1 := 0; {2450#true} is VALID [2022-02-20 19:58:44,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {2450#true} #res := ~__retres1~1; {2450#true} is VALID [2022-02-20 19:58:44,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,717 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2450#true} {2450#true} #875#return; {2450#true} is VALID [2022-02-20 19:58:44,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {2450#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2450#true} is VALID [2022-02-20 19:58:44,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {2450#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2450#true} is VALID [2022-02-20 19:58:44,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,718 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2450#true} {2451#false} #881#return; {2451#false} is VALID [2022-02-20 19:58:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {2491#(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); {2450#true} is VALID [2022-02-20 19:58:44,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {2450#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2450#true} is VALID [2022-02-20 19:58:44,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2450#true} {2451#false} #883#return; {2451#false} is VALID [2022-02-20 19:58:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {2450#true} havoc ~__retres1~2; {2450#true} is VALID [2022-02-20 19:58:44,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2450#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2450#true} is VALID [2022-02-20 19:58:44,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {2450#true} #res := ~__retres1~2; {2450#true} is VALID [2022-02-20 19:58:44,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,729 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2450#true} {2451#false} #885#return; {2451#false} is VALID [2022-02-20 19:58:44,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {2450#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {2450#true} is VALID [2022-02-20 19:58:44,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {2450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {2450#true} is VALID [2022-02-20 19:58:44,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {2450#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {2452#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:44,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {2452#(= ~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; {2452#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:44,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {2452#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {2490#(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:44,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {2490#(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); {2491#(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:44,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {2491#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2491#(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:44,733 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2491#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2452#(= ~q_write_ev~0 ~q_read_ev~0)} #877#return; {2452#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:44,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {2452#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2452#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:44,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {2452#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2452#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:44,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {2452#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2452#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:44,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {2452#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2452#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:44,735 INFO L272 TraceCheckUtils]: 12: Hoare triple {2452#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {2491#(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:44,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {2491#(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); {2492#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:44,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {2492#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2493#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:44,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {2493#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2493#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:44,738 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2493#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2452#(= ~q_write_ev~0 ~q_read_ev~0)} #879#return; {2451#false} is VALID [2022-02-20 19:58:44,738 INFO L272 TraceCheckUtils]: 17: Hoare triple {2451#false} call activate_threads1(); {2494#(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:44,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {2494#(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; {2450#true} is VALID [2022-02-20 19:58:44,738 INFO L272 TraceCheckUtils]: 19: Hoare triple {2450#true} call #t~ret8 := is_do_write_p_triggered(); {2450#true} is VALID [2022-02-20 19:58:44,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {2450#true} havoc ~__retres1~0; {2450#true} is VALID [2022-02-20 19:58:44,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {2450#true} assume !(1 == ~p_dw_pc~0); {2450#true} is VALID [2022-02-20 19:58:44,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {2450#true} ~__retres1~0 := 0; {2450#true} is VALID [2022-02-20 19:58:44,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {2450#true} #res := ~__retres1~0; {2450#true} is VALID [2022-02-20 19:58:44,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,743 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2450#true} {2450#true} #873#return; {2450#true} is VALID [2022-02-20 19:58:44,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {2450#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2450#true} is VALID [2022-02-20 19:58:44,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {2450#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2450#true} is VALID [2022-02-20 19:58:44,746 INFO L272 TraceCheckUtils]: 28: Hoare triple {2450#true} call #t~ret9 := is_do_read_c_triggered(); {2450#true} is VALID [2022-02-20 19:58:44,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {2450#true} havoc ~__retres1~1; {2450#true} is VALID [2022-02-20 19:58:44,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {2450#true} assume !(1 == ~c_dr_pc~0); {2450#true} is VALID [2022-02-20 19:58:44,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {2450#true} ~__retres1~1 := 0; {2450#true} is VALID [2022-02-20 19:58:44,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {2450#true} #res := ~__retres1~1; {2450#true} is VALID [2022-02-20 19:58:44,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,747 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2450#true} {2450#true} #875#return; {2450#true} is VALID [2022-02-20 19:58:44,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {2450#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2450#true} is VALID [2022-02-20 19:58:44,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {2450#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2450#true} is VALID [2022-02-20 19:58:44,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,748 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2450#true} {2451#false} #881#return; {2451#false} is VALID [2022-02-20 19:58:44,748 INFO L272 TraceCheckUtils]: 39: Hoare triple {2451#false} call reset_delta_events1(); {2491#(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:44,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {2491#(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); {2450#true} is VALID [2022-02-20 19:58:44,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {2450#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2450#true} is VALID [2022-02-20 19:58:44,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,751 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2450#true} {2451#false} #883#return; {2451#false} is VALID [2022-02-20 19:58:44,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {2451#false} assume !false; {2451#false} is VALID [2022-02-20 19:58:44,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {2451#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; {2451#false} is VALID [2022-02-20 19:58:44,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {2451#false} assume !false; {2451#false} is VALID [2022-02-20 19:58:44,752 INFO L272 TraceCheckUtils]: 47: Hoare triple {2451#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2450#true} is VALID [2022-02-20 19:58:44,752 INFO L290 TraceCheckUtils]: 48: Hoare triple {2450#true} havoc ~__retres1~2; {2450#true} is VALID [2022-02-20 19:58:44,752 INFO L290 TraceCheckUtils]: 49: Hoare triple {2450#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2450#true} is VALID [2022-02-20 19:58:44,753 INFO L290 TraceCheckUtils]: 50: Hoare triple {2450#true} #res := ~__retres1~2; {2450#true} is VALID [2022-02-20 19:58:44,753 INFO L290 TraceCheckUtils]: 51: Hoare triple {2450#true} assume true; {2450#true} is VALID [2022-02-20 19:58:44,753 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2450#true} {2451#false} #885#return; {2451#false} is VALID [2022-02-20 19:58:44,753 INFO L290 TraceCheckUtils]: 53: Hoare triple {2451#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; {2451#false} is VALID [2022-02-20 19:58:44,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {2451#false} assume 0 != eval1_~tmp___1~0#1; {2451#false} is VALID [2022-02-20 19:58:44,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {2451#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; {2451#false} is VALID [2022-02-20 19:58:44,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {2451#false} assume !(0 != eval1_~tmp~2#1); {2451#false} is VALID [2022-02-20 19:58:44,757 INFO L272 TraceCheckUtils]: 57: Hoare triple {2451#false} call error1(); {2451#false} is VALID [2022-02-20 19:58:44,757 INFO L290 TraceCheckUtils]: 58: Hoare triple {2451#false} assume !false; {2451#false} is VALID [2022-02-20 19:58:44,758 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:44,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:44,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641312497] [2022-02-20 19:58:44,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641312497] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:44,758 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:44,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:44,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4310559] [2022-02-20 19:58:44,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:44,763 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:44,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:44,768 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:44,805 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:44,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:44,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:44,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:44,806 INFO L87 Difference]: Start difference. First operand 345 states and 491 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:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:47,597 INFO L93 Difference]: Finished difference Result 694 states and 970 transitions. [2022-02-20 19:58:47,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:47,598 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:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:47,598 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:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 699 transitions. [2022-02-20 19:58:47,608 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:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 699 transitions. [2022-02-20 19:58:47,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 699 transitions. [2022-02-20 19:58:48,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 699 edges. 699 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:48,192 INFO L225 Difference]: With dead ends: 694 [2022-02-20 19:58:48,192 INFO L226 Difference]: Without dead ends: 516 [2022-02-20 19:58:48,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:48,197 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 894 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:48,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [915 Valid, 1286 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:58:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-02-20 19:58:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 441. [2022-02-20 19:58:48,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:48,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 516 states. Second operand has 441 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 363 states have internal predecessors, (507), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:58:48,229 INFO L74 IsIncluded]: Start isIncluded. First operand 516 states. Second operand has 441 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 363 states have internal predecessors, (507), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:58:48,230 INFO L87 Difference]: Start difference. First operand 516 states. Second operand has 441 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 363 states have internal predecessors, (507), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:58:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,256 INFO L93 Difference]: Finished difference Result 516 states and 729 transitions. [2022-02-20 19:58:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 729 transitions. [2022-02-20 19:58:48,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 441 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 363 states have internal predecessors, (507), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) Second operand 516 states. [2022-02-20 19:58:48,263 INFO L87 Difference]: Start difference. First operand has 441 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 363 states have internal predecessors, (507), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) Second operand 516 states. [2022-02-20 19:58:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:48,301 INFO L93 Difference]: Finished difference Result 516 states and 729 transitions. [2022-02-20 19:58:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 729 transitions. [2022-02-20 19:58:48,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:48,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:48,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:48,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 363 states have internal predecessors, (507), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:58:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 625 transitions. [2022-02-20 19:58:48,331 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 625 transitions. Word has length 59 [2022-02-20 19:58:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:48,332 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 625 transitions. [2022-02-20 19:58:48,333 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:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 625 transitions. [2022-02-20 19:58:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:48,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:48,335 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,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:48,335 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:48,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:48,336 INFO L85 PathProgramCache]: Analyzing trace with hash -118449767, now seen corresponding path program 1 times [2022-02-20 19:58:48,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:48,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969195138] [2022-02-20 19:58:48,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:48,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {5150#(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); {5111#true} is VALID [2022-02-20 19:58:48,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5111#true} {5111#true} #877#return; {5111#true} is VALID [2022-02-20 19:58:48,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {5151#(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); {5111#true} is VALID [2022-02-20 19:58:48,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {5111#true} assume !(0 == ~q_write_ev~0); {5111#true} is VALID [2022-02-20 19:58:48,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5111#true} {5111#true} #879#return; {5111#true} is VALID [2022-02-20 19:58:48,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {5111#true} havoc ~__retres1~0; {5111#true} is VALID [2022-02-20 19:58:48,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {5111#true} assume !(1 == ~p_dw_pc~0); {5111#true} is VALID [2022-02-20 19:58:48,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {5111#true} ~__retres1~0 := 0; {5167#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:48,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {5167#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:48,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:48,495 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {5111#true} #873#return; {5159#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:48,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {5111#true} havoc ~__retres1~1; {5111#true} is VALID [2022-02-20 19:58:48,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {5111#true} assume !(1 == ~c_dr_pc~0); {5111#true} is VALID [2022-02-20 19:58:48,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {5111#true} ~__retres1~1 := 0; {5111#true} is VALID [2022-02-20 19:58:48,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {5111#true} #res := ~__retres1~1; {5111#true} is VALID [2022-02-20 19:58:48,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,500 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5111#true} {5112#false} #875#return; {5112#false} is VALID [2022-02-20 19:58:48,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {5152#(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; {5111#true} is VALID [2022-02-20 19:58:48,500 INFO L272 TraceCheckUtils]: 1: Hoare triple {5111#true} call #t~ret8 := is_do_write_p_triggered(); {5111#true} is VALID [2022-02-20 19:58:48,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {5111#true} havoc ~__retres1~0; {5111#true} is VALID [2022-02-20 19:58:48,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {5111#true} assume !(1 == ~p_dw_pc~0); {5111#true} is VALID [2022-02-20 19:58:48,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {5111#true} ~__retres1~0 := 0; {5167#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:48,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {5167#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:48,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:48,502 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {5111#true} #873#return; {5159#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:48,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {5159#(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; {5160#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:48,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {5160#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5112#false} is VALID [2022-02-20 19:58:48,504 INFO L272 TraceCheckUtils]: 10: Hoare triple {5112#false} call #t~ret9 := is_do_read_c_triggered(); {5111#true} is VALID [2022-02-20 19:58:48,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {5111#true} havoc ~__retres1~1; {5111#true} is VALID [2022-02-20 19:58:48,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {5111#true} assume !(1 == ~c_dr_pc~0); {5111#true} is VALID [2022-02-20 19:58:48,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {5111#true} ~__retres1~1 := 0; {5111#true} is VALID [2022-02-20 19:58:48,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {5111#true} #res := ~__retres1~1; {5111#true} is VALID [2022-02-20 19:58:48,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,505 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5111#true} {5112#false} #875#return; {5112#false} is VALID [2022-02-20 19:58:48,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {5112#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5112#false} is VALID [2022-02-20 19:58:48,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {5112#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5112#false} is VALID [2022-02-20 19:58:48,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {5112#false} assume true; {5112#false} is VALID [2022-02-20 19:58:48,505 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5112#false} {5111#true} #881#return; {5112#false} is VALID [2022-02-20 19:58:48,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {5151#(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); {5111#true} is VALID [2022-02-20 19:58:48,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {5111#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5111#true} is VALID [2022-02-20 19:58:48,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5111#true} {5112#false} #883#return; {5112#false} is VALID [2022-02-20 19:58:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:48,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {5111#true} havoc ~__retres1~2; {5111#true} is VALID [2022-02-20 19:58:48,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {5111#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5111#true} is VALID [2022-02-20 19:58:48,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {5111#true} #res := ~__retres1~2; {5111#true} is VALID [2022-02-20 19:58:48,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,515 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5111#true} {5112#false} #885#return; {5112#false} is VALID [2022-02-20 19:58:48,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {5111#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {5111#true} is VALID [2022-02-20 19:58:48,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {5111#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {5111#true} is VALID [2022-02-20 19:58:48,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {5111#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {5111#true} is VALID [2022-02-20 19:58:48,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {5111#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; {5111#true} is VALID [2022-02-20 19:58:48,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {5111#true} call update_channels1(); {5150#(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:48,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {5150#(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); {5111#true} is VALID [2022-02-20 19:58:48,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,517 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5111#true} {5111#true} #877#return; {5111#true} is VALID [2022-02-20 19:58:48,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {5111#true} assume { :begin_inline_init_threads1 } true; {5111#true} is VALID [2022-02-20 19:58:48,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {5111#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5111#true} is VALID [2022-02-20 19:58:48,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {5111#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5111#true} is VALID [2022-02-20 19:58:48,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {5111#true} assume { :end_inline_init_threads1 } true; {5111#true} is VALID [2022-02-20 19:58:48,518 INFO L272 TraceCheckUtils]: 12: Hoare triple {5111#true} call fire_delta_events1(); {5151#(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:48,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {5151#(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); {5111#true} is VALID [2022-02-20 19:58:48,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {5111#true} assume !(0 == ~q_write_ev~0); {5111#true} is VALID [2022-02-20 19:58:48,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,519 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5111#true} {5111#true} #879#return; {5111#true} is VALID [2022-02-20 19:58:48,519 INFO L272 TraceCheckUtils]: 17: Hoare triple {5111#true} call activate_threads1(); {5152#(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:48,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {5152#(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; {5111#true} is VALID [2022-02-20 19:58:48,520 INFO L272 TraceCheckUtils]: 19: Hoare triple {5111#true} call #t~ret8 := is_do_write_p_triggered(); {5111#true} is VALID [2022-02-20 19:58:48,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {5111#true} havoc ~__retres1~0; {5111#true} is VALID [2022-02-20 19:58:48,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {5111#true} assume !(1 == ~p_dw_pc~0); {5111#true} is VALID [2022-02-20 19:58:48,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {5111#true} ~__retres1~0 := 0; {5167#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:48,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {5167#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:48,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:48,522 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5168#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {5111#true} #873#return; {5159#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:48,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {5159#(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; {5160#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:48,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {5160#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5112#false} is VALID [2022-02-20 19:58:48,523 INFO L272 TraceCheckUtils]: 28: Hoare triple {5112#false} call #t~ret9 := is_do_read_c_triggered(); {5111#true} is VALID [2022-02-20 19:58:48,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {5111#true} havoc ~__retres1~1; {5111#true} is VALID [2022-02-20 19:58:48,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {5111#true} assume !(1 == ~c_dr_pc~0); {5111#true} is VALID [2022-02-20 19:58:48,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {5111#true} ~__retres1~1 := 0; {5111#true} is VALID [2022-02-20 19:58:48,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {5111#true} #res := ~__retres1~1; {5111#true} is VALID [2022-02-20 19:58:48,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,524 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5111#true} {5112#false} #875#return; {5112#false} is VALID [2022-02-20 19:58:48,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {5112#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5112#false} is VALID [2022-02-20 19:58:48,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {5112#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5112#false} is VALID [2022-02-20 19:58:48,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {5112#false} assume true; {5112#false} is VALID [2022-02-20 19:58:48,525 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5112#false} {5111#true} #881#return; {5112#false} is VALID [2022-02-20 19:58:48,525 INFO L272 TraceCheckUtils]: 39: Hoare triple {5112#false} call reset_delta_events1(); {5151#(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:48,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {5151#(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); {5111#true} is VALID [2022-02-20 19:58:48,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {5111#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {5111#true} is VALID [2022-02-20 19:58:48,525 INFO L290 TraceCheckUtils]: 42: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,526 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5111#true} {5112#false} #883#return; {5112#false} is VALID [2022-02-20 19:58:48,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {5112#false} assume !false; {5112#false} is VALID [2022-02-20 19:58:48,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {5112#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; {5112#false} is VALID [2022-02-20 19:58:48,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {5112#false} assume !false; {5112#false} is VALID [2022-02-20 19:58:48,526 INFO L272 TraceCheckUtils]: 47: Hoare triple {5112#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5111#true} is VALID [2022-02-20 19:58:48,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {5111#true} havoc ~__retres1~2; {5111#true} is VALID [2022-02-20 19:58:48,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {5111#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5111#true} is VALID [2022-02-20 19:58:48,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {5111#true} #res := ~__retres1~2; {5111#true} is VALID [2022-02-20 19:58:48,527 INFO L290 TraceCheckUtils]: 51: Hoare triple {5111#true} assume true; {5111#true} is VALID [2022-02-20 19:58:48,527 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5111#true} {5112#false} #885#return; {5112#false} is VALID [2022-02-20 19:58:48,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {5112#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; {5112#false} is VALID [2022-02-20 19:58:48,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {5112#false} assume 0 != eval1_~tmp___1~0#1; {5112#false} is VALID [2022-02-20 19:58:48,528 INFO L290 TraceCheckUtils]: 55: Hoare triple {5112#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; {5112#false} is VALID [2022-02-20 19:58:48,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {5112#false} assume !(0 != eval1_~tmp~2#1); {5112#false} is VALID [2022-02-20 19:58:48,528 INFO L272 TraceCheckUtils]: 57: Hoare triple {5112#false} call error1(); {5112#false} is VALID [2022-02-20 19:58:48,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {5112#false} assume !false; {5112#false} is VALID [2022-02-20 19:58:48,528 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:48,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:48,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969195138] [2022-02-20 19:58:48,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969195138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:48,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:48,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:48,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996035560] [2022-02-20 19:58:48,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:48,530 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:48,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:48,531 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:48,570 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:48,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:48,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:48,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:48,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:48,572 INFO L87 Difference]: Start difference. First operand 441 states and 625 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,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,035 INFO L93 Difference]: Finished difference Result 743 states and 1040 transitions. [2022-02-20 19:58:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:51,036 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,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:51,037 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,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 516 transitions. [2022-02-20 19:58:51,042 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,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 516 transitions. [2022-02-20 19:58:51,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 516 transitions. [2022-02-20 19:58:51,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 516 edges. 516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:51,445 INFO L225 Difference]: With dead ends: 743 [2022-02-20 19:58:51,446 INFO L226 Difference]: Without dead ends: 475 [2022-02-20 19:58:51,447 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:51,448 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 290 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:51,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 1557 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-02-20 19:58:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 446. [2022-02-20 19:58:51,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:51,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 446 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 367 states have internal predecessors, (509), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:58:51,477 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 446 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 367 states have internal predecessors, (509), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:58:51,478 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 446 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 367 states have internal predecessors, (509), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:58:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,496 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2022-02-20 19:58:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 669 transitions. [2022-02-20 19:58:51,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:51,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:51,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 446 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 367 states have internal predecessors, (509), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) Second operand 475 states. [2022-02-20 19:58:51,500 INFO L87 Difference]: Start difference. First operand has 446 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 367 states have internal predecessors, (509), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) Second operand 475 states. [2022-02-20 19:58:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,517 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2022-02-20 19:58:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 669 transitions. [2022-02-20 19:58:51,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:51,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:51,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:51,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 367 states have internal predecessors, (509), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:58:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 628 transitions. [2022-02-20 19:58:51,547 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 628 transitions. Word has length 59 [2022-02-20 19:58:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:51,547 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 628 transitions. [2022-02-20 19:58:51,547 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:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 628 transitions. [2022-02-20 19:58:51,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:51,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:51,549 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:51,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:51,549 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 156309847, now seen corresponding path program 1 times [2022-02-20 19:58:51,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:51,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966507209] [2022-02-20 19:58:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {7792#(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); {7753#true} is VALID [2022-02-20 19:58:51,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7753#true} {7753#true} #877#return; {7753#true} is VALID [2022-02-20 19:58:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {7793#(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); {7753#true} is VALID [2022-02-20 19:58:51,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#true} assume !(0 == ~q_write_ev~0); {7753#true} is VALID [2022-02-20 19:58:51,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7753#true} {7753#true} #879#return; {7753#true} is VALID [2022-02-20 19:58:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {7753#true} havoc ~__retres1~0; {7753#true} is VALID [2022-02-20 19:58:51,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#true} assume !(1 == ~p_dw_pc~0); {7753#true} is VALID [2022-02-20 19:58:51,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} ~__retres1~0 := 0; {7753#true} is VALID [2022-02-20 19:58:51,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {7753#true} #res := ~__retres1~0; {7753#true} is VALID [2022-02-20 19:58:51,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,640 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7753#true} {7753#true} #873#return; {7753#true} is VALID [2022-02-20 19:58:51,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {7753#true} havoc ~__retres1~1; {7753#true} is VALID [2022-02-20 19:58:51,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#true} assume !(1 == ~c_dr_pc~0); {7753#true} is VALID [2022-02-20 19:58:51,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} ~__retres1~1 := 0; {7809#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:51,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {7809#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,674 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {7753#true} #875#return; {7807#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:51,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {7794#(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; {7753#true} is VALID [2022-02-20 19:58:51,674 INFO L272 TraceCheckUtils]: 1: Hoare triple {7753#true} call #t~ret8 := is_do_write_p_triggered(); {7753#true} is VALID [2022-02-20 19:58:51,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} havoc ~__retres1~0; {7753#true} is VALID [2022-02-20 19:58:51,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {7753#true} assume !(1 == ~p_dw_pc~0); {7753#true} is VALID [2022-02-20 19:58:51,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {7753#true} ~__retres1~0 := 0; {7753#true} is VALID [2022-02-20 19:58:51,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {7753#true} #res := ~__retres1~0; {7753#true} is VALID [2022-02-20 19:58:51,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,674 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7753#true} {7753#true} #873#return; {7753#true} is VALID [2022-02-20 19:58:51,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {7753#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7753#true} is VALID [2022-02-20 19:58:51,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {7753#true} assume !(0 != ~tmp~1); {7753#true} is VALID [2022-02-20 19:58:51,675 INFO L272 TraceCheckUtils]: 10: Hoare triple {7753#true} call #t~ret9 := is_do_read_c_triggered(); {7753#true} is VALID [2022-02-20 19:58:51,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {7753#true} havoc ~__retres1~1; {7753#true} is VALID [2022-02-20 19:58:51,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {7753#true} assume !(1 == ~c_dr_pc~0); {7753#true} is VALID [2022-02-20 19:58:51,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {7753#true} ~__retres1~1 := 0; {7809#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:51,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {7809#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,677 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {7753#true} #875#return; {7807#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:51,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {7807#(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; {7808#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:51,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {7808#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7754#false} is VALID [2022-02-20 19:58:51,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {7754#false} assume true; {7754#false} is VALID [2022-02-20 19:58:51,678 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7754#false} {7753#true} #881#return; {7754#false} is VALID [2022-02-20 19:58:51,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {7793#(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); {7753#true} is VALID [2022-02-20 19:58:51,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7753#true} is VALID [2022-02-20 19:58:51,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7753#true} {7754#false} #883#return; {7754#false} is VALID [2022-02-20 19:58:51,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {7753#true} havoc ~__retres1~2; {7753#true} is VALID [2022-02-20 19:58:51,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7753#true} is VALID [2022-02-20 19:58:51,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} #res := ~__retres1~2; {7753#true} is VALID [2022-02-20 19:58:51,688 INFO L290 TraceCheckUtils]: 3: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,688 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7753#true} {7754#false} #885#return; {7754#false} is VALID [2022-02-20 19:58:51,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {7753#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {7753#true} is VALID [2022-02-20 19:58:51,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {7753#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {7753#true} is VALID [2022-02-20 19:58:51,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {7753#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {7753#true} is VALID [2022-02-20 19:58:51,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {7753#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; {7753#true} is VALID [2022-02-20 19:58:51,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {7753#true} call update_channels1(); {7792#(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:51,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {7792#(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); {7753#true} is VALID [2022-02-20 19:58:51,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,690 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7753#true} {7753#true} #877#return; {7753#true} is VALID [2022-02-20 19:58:51,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {7753#true} assume { :begin_inline_init_threads1 } true; {7753#true} is VALID [2022-02-20 19:58:51,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {7753#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7753#true} is VALID [2022-02-20 19:58:51,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {7753#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7753#true} is VALID [2022-02-20 19:58:51,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {7753#true} assume { :end_inline_init_threads1 } true; {7753#true} is VALID [2022-02-20 19:58:51,691 INFO L272 TraceCheckUtils]: 12: Hoare triple {7753#true} call fire_delta_events1(); {7793#(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:51,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {7793#(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); {7753#true} is VALID [2022-02-20 19:58:51,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {7753#true} assume !(0 == ~q_write_ev~0); {7753#true} is VALID [2022-02-20 19:58:51,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,692 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7753#true} {7753#true} #879#return; {7753#true} is VALID [2022-02-20 19:58:51,692 INFO L272 TraceCheckUtils]: 17: Hoare triple {7753#true} call activate_threads1(); {7794#(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:51,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {7794#(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; {7753#true} is VALID [2022-02-20 19:58:51,692 INFO L272 TraceCheckUtils]: 19: Hoare triple {7753#true} call #t~ret8 := is_do_write_p_triggered(); {7753#true} is VALID [2022-02-20 19:58:51,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {7753#true} havoc ~__retres1~0; {7753#true} is VALID [2022-02-20 19:58:51,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {7753#true} assume !(1 == ~p_dw_pc~0); {7753#true} is VALID [2022-02-20 19:58:51,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {7753#true} ~__retres1~0 := 0; {7753#true} is VALID [2022-02-20 19:58:51,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {7753#true} #res := ~__retres1~0; {7753#true} is VALID [2022-02-20 19:58:51,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,693 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7753#true} {7753#true} #873#return; {7753#true} is VALID [2022-02-20 19:58:51,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {7753#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7753#true} is VALID [2022-02-20 19:58:51,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {7753#true} assume !(0 != ~tmp~1); {7753#true} is VALID [2022-02-20 19:58:51,694 INFO L272 TraceCheckUtils]: 28: Hoare triple {7753#true} call #t~ret9 := is_do_read_c_triggered(); {7753#true} is VALID [2022-02-20 19:58:51,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {7753#true} havoc ~__retres1~1; {7753#true} is VALID [2022-02-20 19:58:51,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {7753#true} assume !(1 == ~c_dr_pc~0); {7753#true} is VALID [2022-02-20 19:58:51,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {7753#true} ~__retres1~1 := 0; {7809#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:51,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {7809#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,696 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7810#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {7753#true} #875#return; {7807#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:51,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {7807#(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; {7808#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:51,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {7808#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7754#false} is VALID [2022-02-20 19:58:51,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {7754#false} assume true; {7754#false} is VALID [2022-02-20 19:58:51,697 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7754#false} {7753#true} #881#return; {7754#false} is VALID [2022-02-20 19:58:51,698 INFO L272 TraceCheckUtils]: 39: Hoare triple {7754#false} call reset_delta_events1(); {7793#(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:51,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {7793#(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); {7753#true} is VALID [2022-02-20 19:58:51,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {7753#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7753#true} is VALID [2022-02-20 19:58:51,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,698 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7753#true} {7754#false} #883#return; {7754#false} is VALID [2022-02-20 19:58:51,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {7754#false} assume !false; {7754#false} is VALID [2022-02-20 19:58:51,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {7754#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; {7754#false} is VALID [2022-02-20 19:58:51,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {7754#false} assume !false; {7754#false} is VALID [2022-02-20 19:58:51,699 INFO L272 TraceCheckUtils]: 47: Hoare triple {7754#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7753#true} is VALID [2022-02-20 19:58:51,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {7753#true} havoc ~__retres1~2; {7753#true} is VALID [2022-02-20 19:58:51,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {7753#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7753#true} is VALID [2022-02-20 19:58:51,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {7753#true} #res := ~__retres1~2; {7753#true} is VALID [2022-02-20 19:58:51,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {7753#true} assume true; {7753#true} is VALID [2022-02-20 19:58:51,700 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7753#true} {7754#false} #885#return; {7754#false} is VALID [2022-02-20 19:58:51,700 INFO L290 TraceCheckUtils]: 53: Hoare triple {7754#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; {7754#false} is VALID [2022-02-20 19:58:51,700 INFO L290 TraceCheckUtils]: 54: Hoare triple {7754#false} assume 0 != eval1_~tmp___1~0#1; {7754#false} is VALID [2022-02-20 19:58:51,700 INFO L290 TraceCheckUtils]: 55: Hoare triple {7754#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; {7754#false} is VALID [2022-02-20 19:58:51,700 INFO L290 TraceCheckUtils]: 56: Hoare triple {7754#false} assume !(0 != eval1_~tmp~2#1); {7754#false} is VALID [2022-02-20 19:58:51,700 INFO L272 TraceCheckUtils]: 57: Hoare triple {7754#false} call error1(); {7754#false} is VALID [2022-02-20 19:58:51,701 INFO L290 TraceCheckUtils]: 58: Hoare triple {7754#false} assume !false; {7754#false} is VALID [2022-02-20 19:58:51,701 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:51,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:51,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966507209] [2022-02-20 19:58:51,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966507209] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:51,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:51,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:51,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009117772] [2022-02-20 19:58:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:51,703 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,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:51,703 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:51,739 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:51,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:51,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:51,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:51,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:51,740 INFO L87 Difference]: Start difference. First operand 446 states and 628 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:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:53,976 INFO L93 Difference]: Finished difference Result 765 states and 1062 transitions. [2022-02-20 19:58:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:53,976 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:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:53,977 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:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 520 transitions. [2022-02-20 19:58:53,982 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:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 520 transitions. [2022-02-20 19:58:53,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 520 transitions. [2022-02-20 19:58:54,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 520 edges. 520 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:54,440 INFO L225 Difference]: With dead ends: 765 [2022-02-20 19:58:54,440 INFO L226 Difference]: Without dead ends: 492 [2022-02-20 19:58:54,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:54,441 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 290 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:54,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 1555 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:58:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-02-20 19:58:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 461. [2022-02-20 19:58:54,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:54,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 461 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 379 states have internal predecessors, (521), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:58:54,476 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 461 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 379 states have internal predecessors, (521), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:58:54,477 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 461 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 379 states have internal predecessors, (521), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:58:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:54,494 INFO L93 Difference]: Finished difference Result 492 states and 687 transitions. [2022-02-20 19:58:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 687 transitions. [2022-02-20 19:58:54,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:54,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:54,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 461 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 379 states have internal predecessors, (521), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) Second operand 492 states. [2022-02-20 19:58:54,498 INFO L87 Difference]: Start difference. First operand has 461 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 379 states have internal predecessors, (521), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) Second operand 492 states. [2022-02-20 19:58:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:54,515 INFO L93 Difference]: Finished difference Result 492 states and 687 transitions. [2022-02-20 19:58:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 687 transitions. [2022-02-20 19:58:54,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:54,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:54,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:54,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 379 states have internal predecessors, (521), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:58:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 643 transitions. [2022-02-20 19:58:54,541 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 643 transitions. Word has length 59 [2022-02-20 19:58:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:54,541 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 643 transitions. [2022-02-20 19:58:54,541 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:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 643 transitions. [2022-02-20 19:58:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:54,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:54,544 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:54,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:54,544 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:54,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1649128487, now seen corresponding path program 1 times [2022-02-20 19:58:54,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:54,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818245351] [2022-02-20 19:58:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:54,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {10515#(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); {10516#(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:54,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {10516#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10516#(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:54,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10516#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10477#(= ~q_write_ev~0 ~q_read_ev~0)} #877#return; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {10516#(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); {10516#(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:54,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {10516#(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); {10516#(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:54,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {10516#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10516#(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:54,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10516#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10477#(= ~q_write_ev~0 ~q_read_ev~0)} #879#return; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {10475#true} havoc ~__retres1~0; {10475#true} is VALID [2022-02-20 19:58:54,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {10475#true} assume !(1 == ~p_dw_pc~0); {10475#true} is VALID [2022-02-20 19:58:54,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {10475#true} ~__retres1~0 := 0; {10475#true} is VALID [2022-02-20 19:58:54,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {10475#true} #res := ~__retres1~0; {10475#true} is VALID [2022-02-20 19:58:54,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,661 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10475#true} {10475#true} #873#return; {10475#true} is VALID [2022-02-20 19:58:54,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {10475#true} havoc ~__retres1~1; {10475#true} is VALID [2022-02-20 19:58:54,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {10475#true} assume !(1 == ~c_dr_pc~0); {10475#true} is VALID [2022-02-20 19:58:54,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {10475#true} ~__retres1~1 := 0; {10475#true} is VALID [2022-02-20 19:58:54,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {10475#true} #res := ~__retres1~1; {10475#true} is VALID [2022-02-20 19:58:54,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,671 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10475#true} {10475#true} #875#return; {10475#true} is VALID [2022-02-20 19:58:54,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {10517#(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; {10475#true} is VALID [2022-02-20 19:58:54,672 INFO L272 TraceCheckUtils]: 1: Hoare triple {10475#true} call #t~ret8 := is_do_write_p_triggered(); {10475#true} is VALID [2022-02-20 19:58:54,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {10475#true} havoc ~__retres1~0; {10475#true} is VALID [2022-02-20 19:58:54,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {10475#true} assume !(1 == ~p_dw_pc~0); {10475#true} is VALID [2022-02-20 19:58:54,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {10475#true} ~__retres1~0 := 0; {10475#true} is VALID [2022-02-20 19:58:54,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {10475#true} #res := ~__retres1~0; {10475#true} is VALID [2022-02-20 19:58:54,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,673 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10475#true} {10475#true} #873#return; {10475#true} is VALID [2022-02-20 19:58:54,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {10475#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10475#true} is VALID [2022-02-20 19:58:54,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {10475#true} assume !(0 != ~tmp~1); {10475#true} is VALID [2022-02-20 19:58:54,673 INFO L272 TraceCheckUtils]: 10: Hoare triple {10475#true} call #t~ret9 := is_do_read_c_triggered(); {10475#true} is VALID [2022-02-20 19:58:54,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {10475#true} havoc ~__retres1~1; {10475#true} is VALID [2022-02-20 19:58:54,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {10475#true} assume !(1 == ~c_dr_pc~0); {10475#true} is VALID [2022-02-20 19:58:54,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {10475#true} ~__retres1~1 := 0; {10475#true} is VALID [2022-02-20 19:58:54,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {10475#true} #res := ~__retres1~1; {10475#true} is VALID [2022-02-20 19:58:54,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,674 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10475#true} {10475#true} #875#return; {10475#true} is VALID [2022-02-20 19:58:54,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {10475#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10475#true} is VALID [2022-02-20 19:58:54,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {10475#true} assume !(0 != ~tmp___0~1); {10475#true} is VALID [2022-02-20 19:58:54,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,676 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10475#true} {10477#(= ~q_write_ev~0 ~q_read_ev~0)} #881#return; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {10516#(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); {10530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:54,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {10530#(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; {10531#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:54,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {10531#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {10531#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:54,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10531#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {10477#(= ~q_write_ev~0 ~q_read_ev~0)} #883#return; {10476#false} is VALID [2022-02-20 19:58:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:54,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {10475#true} havoc ~__retres1~2; {10475#true} is VALID [2022-02-20 19:58:54,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {10475#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10475#true} is VALID [2022-02-20 19:58:54,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {10475#true} #res := ~__retres1~2; {10475#true} is VALID [2022-02-20 19:58:54,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,705 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10475#true} {10476#false} #885#return; {10476#false} is VALID [2022-02-20 19:58:54,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {10475#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {10475#true} is VALID [2022-02-20 19:58:54,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {10475#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {10475#true} is VALID [2022-02-20 19:58:54,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {10475#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {10477#(= ~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; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {10477#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {10515#(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:54,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {10515#(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); {10516#(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:54,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {10516#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10516#(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:54,708 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10516#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10477#(= ~q_write_ev~0 ~q_read_ev~0)} #877#return; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {10477#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {10477#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {10477#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {10477#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,710 INFO L272 TraceCheckUtils]: 12: Hoare triple {10477#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {10516#(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:54,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {10516#(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); {10516#(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:54,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {10516#(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); {10516#(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:54,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {10516#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {10516#(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:54,719 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10516#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {10477#(= ~q_write_ev~0 ~q_read_ev~0)} #879#return; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,720 INFO L272 TraceCheckUtils]: 17: Hoare triple {10477#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {10517#(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:54,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {10517#(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; {10475#true} is VALID [2022-02-20 19:58:54,720 INFO L272 TraceCheckUtils]: 19: Hoare triple {10475#true} call #t~ret8 := is_do_write_p_triggered(); {10475#true} is VALID [2022-02-20 19:58:54,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {10475#true} havoc ~__retres1~0; {10475#true} is VALID [2022-02-20 19:58:54,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {10475#true} assume !(1 == ~p_dw_pc~0); {10475#true} is VALID [2022-02-20 19:58:54,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {10475#true} ~__retres1~0 := 0; {10475#true} is VALID [2022-02-20 19:58:54,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {10475#true} #res := ~__retres1~0; {10475#true} is VALID [2022-02-20 19:58:54,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,721 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10475#true} {10475#true} #873#return; {10475#true} is VALID [2022-02-20 19:58:54,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {10475#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10475#true} is VALID [2022-02-20 19:58:54,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {10475#true} assume !(0 != ~tmp~1); {10475#true} is VALID [2022-02-20 19:58:54,721 INFO L272 TraceCheckUtils]: 28: Hoare triple {10475#true} call #t~ret9 := is_do_read_c_triggered(); {10475#true} is VALID [2022-02-20 19:58:54,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {10475#true} havoc ~__retres1~1; {10475#true} is VALID [2022-02-20 19:58:54,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {10475#true} assume !(1 == ~c_dr_pc~0); {10475#true} is VALID [2022-02-20 19:58:54,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {10475#true} ~__retres1~1 := 0; {10475#true} is VALID [2022-02-20 19:58:54,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {10475#true} #res := ~__retres1~1; {10475#true} is VALID [2022-02-20 19:58:54,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,722 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10475#true} {10475#true} #875#return; {10475#true} is VALID [2022-02-20 19:58:54,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {10475#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10475#true} is VALID [2022-02-20 19:58:54,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {10475#true} assume !(0 != ~tmp___0~1); {10475#true} is VALID [2022-02-20 19:58:54,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,723 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10475#true} {10477#(= ~q_write_ev~0 ~q_read_ev~0)} #881#return; {10477#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:54,724 INFO L272 TraceCheckUtils]: 39: Hoare triple {10477#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {10516#(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:54,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {10516#(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); {10530#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:54,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {10530#(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; {10531#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:54,725 INFO L290 TraceCheckUtils]: 42: Hoare triple {10531#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {10531#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:54,725 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10531#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {10477#(= ~q_write_ev~0 ~q_read_ev~0)} #883#return; {10476#false} is VALID [2022-02-20 19:58:54,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {10476#false} assume !false; {10476#false} is VALID [2022-02-20 19:58:54,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {10476#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; {10476#false} is VALID [2022-02-20 19:58:54,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {10476#false} assume !false; {10476#false} is VALID [2022-02-20 19:58:54,726 INFO L272 TraceCheckUtils]: 47: Hoare triple {10476#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10475#true} is VALID [2022-02-20 19:58:54,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {10475#true} havoc ~__retres1~2; {10475#true} is VALID [2022-02-20 19:58:54,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {10475#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10475#true} is VALID [2022-02-20 19:58:54,726 INFO L290 TraceCheckUtils]: 50: Hoare triple {10475#true} #res := ~__retres1~2; {10475#true} is VALID [2022-02-20 19:58:54,726 INFO L290 TraceCheckUtils]: 51: Hoare triple {10475#true} assume true; {10475#true} is VALID [2022-02-20 19:58:54,727 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10475#true} {10476#false} #885#return; {10476#false} is VALID [2022-02-20 19:58:54,727 INFO L290 TraceCheckUtils]: 53: Hoare triple {10476#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; {10476#false} is VALID [2022-02-20 19:58:54,727 INFO L290 TraceCheckUtils]: 54: Hoare triple {10476#false} assume 0 != eval1_~tmp___1~0#1; {10476#false} is VALID [2022-02-20 19:58:54,727 INFO L290 TraceCheckUtils]: 55: Hoare triple {10476#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; {10476#false} is VALID [2022-02-20 19:58:54,727 INFO L290 TraceCheckUtils]: 56: Hoare triple {10476#false} assume !(0 != eval1_~tmp~2#1); {10476#false} is VALID [2022-02-20 19:58:54,727 INFO L272 TraceCheckUtils]: 57: Hoare triple {10476#false} call error1(); {10476#false} is VALID [2022-02-20 19:58:54,727 INFO L290 TraceCheckUtils]: 58: Hoare triple {10476#false} assume !false; {10476#false} is VALID [2022-02-20 19:58:54,728 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:54,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:54,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818245351] [2022-02-20 19:58:54,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818245351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:54,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:54,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:54,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218251586] [2022-02-20 19:58:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:54,729 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,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:54,729 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:54,765 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:54,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:54,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:54,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:54,766 INFO L87 Difference]: Start difference. First operand 461 states and 643 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:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:57,288 INFO L93 Difference]: Finished difference Result 855 states and 1156 transitions. [2022-02-20 19:58:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:57,288 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:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:57,289 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:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 700 transitions. [2022-02-20 19:58:57,295 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:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 700 transitions. [2022-02-20 19:58:57,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 700 transitions. [2022-02-20 19:58:57,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 700 edges. 700 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:57,896 INFO L225 Difference]: With dead ends: 855 [2022-02-20 19:58:57,896 INFO L226 Difference]: Without dead ends: 569 [2022-02-20 19:58:57,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:57,900 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 710 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:57,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 1253 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-02-20 19:58:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 473. [2022-02-20 19:58:57,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:57,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 569 states. Second operand has 473 states, 380 states have (on average 1.3973684210526316) internal successors, (531), 389 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-02-20 19:58:57,939 INFO L74 IsIncluded]: Start isIncluded. First operand 569 states. Second operand has 473 states, 380 states have (on average 1.3973684210526316) internal successors, (531), 389 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-02-20 19:58:57,941 INFO L87 Difference]: Start difference. First operand 569 states. Second operand has 473 states, 380 states have (on average 1.3973684210526316) internal successors, (531), 389 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-02-20 19:58:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:57,962 INFO L93 Difference]: Finished difference Result 569 states and 775 transitions. [2022-02-20 19:58:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 775 transitions. [2022-02-20 19:58:57,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:57,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:57,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 473 states, 380 states have (on average 1.3973684210526316) internal successors, (531), 389 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) Second operand 569 states. [2022-02-20 19:58:57,966 INFO L87 Difference]: Start difference. First operand has 473 states, 380 states have (on average 1.3973684210526316) internal successors, (531), 389 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) Second operand 569 states. [2022-02-20 19:58:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:57,988 INFO L93 Difference]: Finished difference Result 569 states and 775 transitions. [2022-02-20 19:58:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 775 transitions. [2022-02-20 19:58:57,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:57,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:57,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:57,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 380 states have (on average 1.3973684210526316) internal successors, (531), 389 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-02-20 19:58:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 653 transitions. [2022-02-20 19:58:58,017 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 653 transitions. Word has length 59 [2022-02-20 19:58:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:58,017 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 653 transitions. [2022-02-20 19:58:58,018 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:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 653 transitions. [2022-02-20 19:58:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:58,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:58,019 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:58,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:58,019 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash 651694103, now seen corresponding path program 1 times [2022-02-20 19:58:58,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:58,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085388997] [2022-02-20 19:58:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:58:58,041 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:58:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:58:58,090 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:58:58,091 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:58:58,092 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:58:58,093 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:58:58,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:58,097 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 19:58:58,100 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:58:58,149 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:58:58,150 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:58,157 INFO L158 Benchmark]: Toolchain (without parser) took 19259.07ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 60.3MB in the beginning and 93.2MB in the end (delta: -32.9MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,158 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 100.7MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:58:58,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.56ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 66.4MB in the end (delta: -6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.03ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 63.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,160 INFO L158 Benchmark]: Boogie Preprocessor took 52.41ms. Allocated memory is still 100.7MB. Free memory was 63.1MB in the beginning and 60.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,160 INFO L158 Benchmark]: RCFGBuilder took 873.40ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 59.7MB in the beginning and 87.4MB in the end (delta: -27.7MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,162 INFO L158 Benchmark]: TraceAbstraction took 17846.96ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 86.9MB in the beginning and 93.2MB in the end (delta: -6.3MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2022-02-20 19:58:58,164 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.22ms. Allocated memory is still 100.7MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.56ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 66.4MB in the end (delta: -6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.03ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 63.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.41ms. Allocated memory is still 100.7MB. Free memory was 63.1MB in the beginning and 60.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 873.40ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 59.7MB in the beginning and 87.4MB in the end (delta: -27.7MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17846.96ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 86.9MB in the beginning and 93.2MB in the end (delta: -6.3MB). Peak memory consumption was 48.3MB. 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:58,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:00,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:00,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:00,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:00,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:00,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:00,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:00,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:00,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:00,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:00,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:00,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:00,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:00,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:00,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:00,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:00,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:00,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:00,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:00,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:00,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:00,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:00,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:00,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:00,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:00,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:00,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:00,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:00,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:00,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:00,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:00,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:00,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:00,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:00,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:00,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:00,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:00,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:00,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:00,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:00,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:00,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 19:59:00,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:00,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:00,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:00,225 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:00,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:00,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:00,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:00,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:00,226 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:00,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:00,227 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:00,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:00,227 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:00,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:00,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:00,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:00,228 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:00,228 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:00,228 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:00,228 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:00,228 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:00,228 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:00,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:00,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:00,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:00,229 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:00,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:00,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:00,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:00,230 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:00,230 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:00,230 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:00,230 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:00,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:00,231 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:00,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:00,232 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 -> 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f [2022-02-20 19:59:00,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:00,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:00,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:00,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:00,633 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:00,634 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.03.cil-2.c [2022-02-20 19:59:00,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253a189b9/d1d0fe5fbc9a4f54a9f061bbe13b900f/FLAG42d6657fa [2022-02-20 19:59:01,140 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:01,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2022-02-20 19:59:01,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253a189b9/d1d0fe5fbc9a4f54a9f061bbe13b900f/FLAG42d6657fa [2022-02-20 19:59:01,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253a189b9/d1d0fe5fbc9a4f54a9f061bbe13b900f [2022-02-20 19:59:01,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:01,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:01,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:01,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:01,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:01,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:01" (1/1) ... [2022-02-20 19:59:01,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab6f8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:01, skipping insertion in model container [2022-02-20 19:59:01,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:01" (1/1) ... [2022-02-20 19:59:01,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:01,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:01,720 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.03.cil-2.c[914,927] [2022-02-20 19:59:01,808 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.03.cil-2.c[7125,7138] [2022-02-20 19:59:01,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:01,908 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:01,957 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.03.cil-2.c[914,927] [2022-02-20 19:59:01,987 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.03.cil-2.c[7125,7138] [2022-02-20 19:59:02,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:02,034 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:02,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02 WrapperNode [2022-02-20 19:59:02,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:02,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:02,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:02,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:02,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,092 INFO L137 Inliner]: procedures = 60, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 498 [2022-02-20 19:59:02,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:02,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:02,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:02,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:02,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:02,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:02,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:02,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:02,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (1/1) ... [2022-02-20 19:59:02,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:02,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:02,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:59:02,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:59:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:02,208 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:02,218 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:02,218 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:02,218 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:02,218 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:02,219 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:02,219 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:02,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:02,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:02,220 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:02,220 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:02,356 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:02,358 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:02,849 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:02,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:02,858 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 19:59:02,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:02 BoogieIcfgContainer [2022-02-20 19:59:02,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:02,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:02,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:02,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:02,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:01" (1/3) ... [2022-02-20 19:59:02,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abefd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:02, skipping insertion in model container [2022-02-20 19:59:02,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:02" (2/3) ... [2022-02-20 19:59:02,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abefd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:02, skipping insertion in model container [2022-02-20 19:59:02,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:02" (3/3) ... [2022-02-20 19:59:02,867 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2022-02-20 19:59:02,871 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:02,871 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:02,908 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:02,913 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:02,914 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 19:59:02,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:02,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:02,948 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,949 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1774585736, now seen corresponding path program 1 times [2022-02-20 19:59:02,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:02,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704864167] [2022-02-20 19:59:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:02,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:02,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:02,972 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:02,982 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:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:03,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 19:59:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:03,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:03,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {262#true} is VALID [2022-02-20 19:59:03,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1; {262#true} is VALID [2022-02-20 19:59:03,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume 0bv32 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {273#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {273#(= (_ 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; {273#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#(= (_ bv2 32) ~q_read_ev~0)} call update_channels1(); {280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume !(1bv32 == ~q_req_up~0); {280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,377 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {273#(= (_ bv2 32) ~q_read_ev~0)} #877#return; {273#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#(= (_ bv2 32) ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {273#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {273#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {273#(= (_ bv2 32) ~q_read_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {273#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(= (_ bv2 32) ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {273#(= (_ bv2 32) ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,380 INFO L272 TraceCheckUtils]: 12: Hoare triple {273#(= (_ bv2 32) ~q_read_ev~0)} call fire_delta_events1(); {280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:59:03,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {280#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume 0bv32 == ~q_read_ev~0;~q_read_ev~0 := 1bv32; {308#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:03,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {308#(= |old(~q_read_ev~0)| (_ bv0 32))} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {308#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:03,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {308#(= |old(~q_read_ev~0)| (_ bv0 32))} assume true; {308#(= |old(~q_read_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:03,382 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {308#(= |old(~q_read_ev~0)| (_ bv0 32))} {273#(= (_ bv2 32) ~q_read_ev~0)} #879#return; {263#false} is VALID [2022-02-20 19:59:03,383 INFO L272 TraceCheckUtils]: 17: Hoare triple {263#false} call activate_threads1(); {263#false} is VALID [2022-02-20 19:59:03,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {263#false} havoc ~tmp~1;havoc ~tmp___0~1; {263#false} is VALID [2022-02-20 19:59:03,383 INFO L272 TraceCheckUtils]: 19: Hoare triple {263#false} call #t~ret8 := is_do_write_p_triggered(); {263#false} is VALID [2022-02-20 19:59:03,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} havoc ~__retres1~0; {263#false} is VALID [2022-02-20 19:59:03,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {263#false} assume 1bv32 == ~p_dw_pc~0; {263#false} is VALID [2022-02-20 19:59:03,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {263#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {263#false} is VALID [2022-02-20 19:59:03,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {263#false} #res := ~__retres1~0; {263#false} is VALID [2022-02-20 19:59:03,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {263#false} assume true; {263#false} is VALID [2022-02-20 19:59:03,385 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {263#false} {263#false} #873#return; {263#false} is VALID [2022-02-20 19:59:03,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {263#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {263#false} is VALID [2022-02-20 19:59:03,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {263#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {263#false} is VALID [2022-02-20 19:59:03,385 INFO L272 TraceCheckUtils]: 28: Hoare triple {263#false} call #t~ret9 := is_do_read_c_triggered(); {263#false} is VALID [2022-02-20 19:59:03,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {263#false} havoc ~__retres1~1; {263#false} is VALID [2022-02-20 19:59:03,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {263#false} assume !(1bv32 == ~c_dr_pc~0); {263#false} is VALID [2022-02-20 19:59:03,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {263#false} ~__retres1~1 := 0bv32; {263#false} is VALID [2022-02-20 19:59:03,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {263#false} #res := ~__retres1~1; {263#false} is VALID [2022-02-20 19:59:03,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {263#false} assume true; {263#false} is VALID [2022-02-20 19:59:03,387 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {263#false} {263#false} #875#return; {263#false} is VALID [2022-02-20 19:59:03,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {263#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {263#false} is VALID [2022-02-20 19:59:03,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {263#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {263#false} is VALID [2022-02-20 19:59:03,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {263#false} assume true; {263#false} is VALID [2022-02-20 19:59:03,388 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {263#false} {263#false} #881#return; {263#false} is VALID [2022-02-20 19:59:03,388 INFO L272 TraceCheckUtils]: 39: Hoare triple {263#false} call reset_delta_events1(); {263#false} is VALID [2022-02-20 19:59:03,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {263#false} assume 1bv32 == ~q_read_ev~0;~q_read_ev~0 := 2bv32; {263#false} is VALID [2022-02-20 19:59:03,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {263#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {263#false} is VALID [2022-02-20 19:59:03,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {263#false} assume true; {263#false} is VALID [2022-02-20 19:59:03,389 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {263#false} {263#false} #883#return; {263#false} is VALID [2022-02-20 19:59:03,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 19:59:03,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {263#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; {263#false} is VALID [2022-02-20 19:59:03,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 19:59:03,390 INFO L272 TraceCheckUtils]: 47: Hoare triple {263#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {263#false} is VALID [2022-02-20 19:59:03,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {263#false} havoc ~__retres1~2; {263#false} is VALID [2022-02-20 19:59:03,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {263#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {263#false} is VALID [2022-02-20 19:59:03,391 INFO L290 TraceCheckUtils]: 50: Hoare triple {263#false} #res := ~__retres1~2; {263#false} is VALID [2022-02-20 19:59:03,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {263#false} assume true; {263#false} is VALID [2022-02-20 19:59:03,391 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {263#false} {263#false} #885#return; {263#false} is VALID [2022-02-20 19:59:03,392 INFO L290 TraceCheckUtils]: 53: Hoare triple {263#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {263#false} is VALID [2022-02-20 19:59:03,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {263#false} assume 0bv32 != eval1_~tmp___1~0#1; {263#false} is VALID [2022-02-20 19:59:03,392 INFO L290 TraceCheckUtils]: 55: Hoare triple {263#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {263#false} is VALID [2022-02-20 19:59:03,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {263#false} assume !(0bv32 != eval1_~tmp~2#1); {263#false} is VALID [2022-02-20 19:59:03,393 INFO L272 TraceCheckUtils]: 57: Hoare triple {263#false} call error1(); {263#false} is VALID [2022-02-20 19:59:03,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 19:59:03,394 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:03,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:03,395 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:03,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704864167] [2022-02-20 19:59:03,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704864167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:03,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:03,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:03,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651978375] [2022-02-20 19:59:03,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:03,402 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:03,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:03,407 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:03,464 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:03,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:03,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:03,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:03,485 INFO L87 Difference]: Start difference. First operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) 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:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,301 INFO L93 Difference]: Finished difference Result 603 states and 920 transitions. [2022-02-20 19:59:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:05,302 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:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:05,304 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:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2022-02-20 19:59:05,328 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:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2022-02-20 19:59:05,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 920 transitions. [2022-02-20 19:59:06,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 920 edges. 920 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:06,091 INFO L225 Difference]: With dead ends: 603 [2022-02-20 19:59:06,092 INFO L226 Difference]: Without dead ends: 353 [2022-02-20 19:59:06,096 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:06,099 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 298 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:06,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 957 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:59:06,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-02-20 19:59:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 345. [2022-02-20 19:59:06,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:06,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:59:06,151 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:59:06,153 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:59:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,174 INFO L93 Difference]: Finished difference Result 353 states and 500 transitions. [2022-02-20 19:59:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 500 transitions. [2022-02-20 19:59:06,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:06,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:06,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) Second operand 353 states. [2022-02-20 19:59:06,181 INFO L87 Difference]: Start difference. First operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) Second operand 353 states. [2022-02-20 19:59:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,200 INFO L93 Difference]: Finished difference Result 353 states and 500 transitions. [2022-02-20 19:59:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 500 transitions. [2022-02-20 19:59:06,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:06,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:06,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:06,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:59:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 491 transitions. [2022-02-20 19:59:06,224 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 491 transitions. Word has length 59 [2022-02-20 19:59:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:06,225 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 491 transitions. [2022-02-20 19:59:06,225 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:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 491 transitions. [2022-02-20 19:59:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:06,227 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:06,227 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,242 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:06,438 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:06,438 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:06,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1011936105, now seen corresponding path program 1 times [2022-02-20 19:59:06,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:06,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167571865] [2022-02-20 19:59:06,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:06,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:06,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:06,442 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:06,444 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:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:06,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {2450#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {2450#true} is VALID [2022-02-20 19:59:06,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {2450#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1; {2450#true} is VALID [2022-02-20 19:59:06,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {2450#true} assume 0bv32 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {2461#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {2461#(= (_ 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; {2461#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {2461#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,718 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {2461#(= (_ bv2 32) ~q_write_ev~0)} #877#return; {2461#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {2461#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {2461#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {2461#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {2461#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {2461#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {2461#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {2461#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {2461#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,720 INFO L272 TraceCheckUtils]: 12: Hoare triple {2461#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:06,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {2468#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {2499#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:06,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {2499#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {2499#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:06,722 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2499#(= |old(~q_write_ev~0)| (_ bv0 32))} {2461#(= (_ bv2 32) ~q_write_ev~0)} #879#return; {2451#false} is VALID [2022-02-20 19:59:06,722 INFO L272 TraceCheckUtils]: 17: Hoare triple {2451#false} call activate_threads1(); {2451#false} is VALID [2022-02-20 19:59:06,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {2451#false} havoc ~tmp~1;havoc ~tmp___0~1; {2451#false} is VALID [2022-02-20 19:59:06,722 INFO L272 TraceCheckUtils]: 19: Hoare triple {2451#false} call #t~ret8 := is_do_write_p_triggered(); {2451#false} is VALID [2022-02-20 19:59:06,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {2451#false} havoc ~__retres1~0; {2451#false} is VALID [2022-02-20 19:59:06,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {2451#false} assume !(1bv32 == ~p_dw_pc~0); {2451#false} is VALID [2022-02-20 19:59:06,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {2451#false} ~__retres1~0 := 0bv32; {2451#false} is VALID [2022-02-20 19:59:06,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {2451#false} #res := ~__retres1~0; {2451#false} is VALID [2022-02-20 19:59:06,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {2451#false} assume true; {2451#false} is VALID [2022-02-20 19:59:06,723 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2451#false} {2451#false} #873#return; {2451#false} is VALID [2022-02-20 19:59:06,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {2451#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {2451#false} is VALID [2022-02-20 19:59:06,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {2451#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {2451#false} is VALID [2022-02-20 19:59:06,724 INFO L272 TraceCheckUtils]: 28: Hoare triple {2451#false} call #t~ret9 := is_do_read_c_triggered(); {2451#false} is VALID [2022-02-20 19:59:06,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {2451#false} havoc ~__retres1~1; {2451#false} is VALID [2022-02-20 19:59:06,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {2451#false} assume !(1bv32 == ~c_dr_pc~0); {2451#false} is VALID [2022-02-20 19:59:06,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {2451#false} ~__retres1~1 := 0bv32; {2451#false} is VALID [2022-02-20 19:59:06,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {2451#false} #res := ~__retres1~1; {2451#false} is VALID [2022-02-20 19:59:06,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {2451#false} assume true; {2451#false} is VALID [2022-02-20 19:59:06,725 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2451#false} {2451#false} #875#return; {2451#false} is VALID [2022-02-20 19:59:06,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {2451#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {2451#false} is VALID [2022-02-20 19:59:06,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {2451#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {2451#false} is VALID [2022-02-20 19:59:06,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {2451#false} assume true; {2451#false} is VALID [2022-02-20 19:59:06,726 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2451#false} {2451#false} #881#return; {2451#false} is VALID [2022-02-20 19:59:06,726 INFO L272 TraceCheckUtils]: 39: Hoare triple {2451#false} call reset_delta_events1(); {2451#false} is VALID [2022-02-20 19:59:06,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {2451#false} assume !(1bv32 == ~q_read_ev~0); {2451#false} is VALID [2022-02-20 19:59:06,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {2451#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {2451#false} is VALID [2022-02-20 19:59:06,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {2451#false} assume true; {2451#false} is VALID [2022-02-20 19:59:06,727 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2451#false} {2451#false} #883#return; {2451#false} is VALID [2022-02-20 19:59:06,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {2451#false} assume !false; {2451#false} is VALID [2022-02-20 19:59:06,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {2451#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; {2451#false} is VALID [2022-02-20 19:59:06,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {2451#false} assume !false; {2451#false} is VALID [2022-02-20 19:59:06,728 INFO L272 TraceCheckUtils]: 47: Hoare triple {2451#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2451#false} is VALID [2022-02-20 19:59:06,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {2451#false} havoc ~__retres1~2; {2451#false} is VALID [2022-02-20 19:59:06,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {2451#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {2451#false} is VALID [2022-02-20 19:59:06,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {2451#false} #res := ~__retres1~2; {2451#false} is VALID [2022-02-20 19:59:06,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {2451#false} assume true; {2451#false} is VALID [2022-02-20 19:59:06,729 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2451#false} {2451#false} #885#return; {2451#false} is VALID [2022-02-20 19:59:06,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {2451#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {2451#false} is VALID [2022-02-20 19:59:06,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {2451#false} assume 0bv32 != eval1_~tmp___1~0#1; {2451#false} is VALID [2022-02-20 19:59:06,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {2451#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {2451#false} is VALID [2022-02-20 19:59:06,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {2451#false} assume !(0bv32 != eval1_~tmp~2#1); {2451#false} is VALID [2022-02-20 19:59:06,730 INFO L272 TraceCheckUtils]: 57: Hoare triple {2451#false} call error1(); {2451#false} is VALID [2022-02-20 19:59:06,730 INFO L290 TraceCheckUtils]: 58: Hoare triple {2451#false} assume !false; {2451#false} is VALID [2022-02-20 19:59:06,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:59:06,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:06,731 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:06,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167571865] [2022-02-20 19:59:06,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167571865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:06,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:06,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:06,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685541355] [2022-02-20 19:59:06,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:06,733 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:06,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:06,734 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:06,785 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:06,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:06,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:06,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:06,788 INFO L87 Difference]: Start difference. First operand 345 states and 491 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:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,262 INFO L93 Difference]: Finished difference Result 739 states and 1047 transitions. [2022-02-20 19:59:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:08,263 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:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:08,263 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:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2022-02-20 19:59:08,272 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:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2022-02-20 19:59:08,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 628 transitions. [2022-02-20 19:59:08,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:08,761 INFO L225 Difference]: With dead ends: 739 [2022-02-20 19:59:08,761 INFO L226 Difference]: Without dead ends: 559 [2022-02-20 19:59:08,762 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:08,763 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 285 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:08,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 930 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-02-20 19:59:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 550. [2022-02-20 19:59:08,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:08,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 559 states. Second operand has 550 states, 439 states have (on average 1.4100227790432802) internal successors, (619), 454 states have internal predecessors, (619), 65 states have call successors, (65), 35 states have call predecessors, (65), 44 states have return successors, (87), 65 states have call predecessors, (87), 62 states have call successors, (87) [2022-02-20 19:59:08,798 INFO L74 IsIncluded]: Start isIncluded. First operand 559 states. Second operand has 550 states, 439 states have (on average 1.4100227790432802) internal successors, (619), 454 states have internal predecessors, (619), 65 states have call successors, (65), 35 states have call predecessors, (65), 44 states have return successors, (87), 65 states have call predecessors, (87), 62 states have call successors, (87) [2022-02-20 19:59:08,800 INFO L87 Difference]: Start difference. First operand 559 states. Second operand has 550 states, 439 states have (on average 1.4100227790432802) internal successors, (619), 454 states have internal predecessors, (619), 65 states have call successors, (65), 35 states have call predecessors, (65), 44 states have return successors, (87), 65 states have call predecessors, (87), 62 states have call successors, (87) [2022-02-20 19:59:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,827 INFO L93 Difference]: Finished difference Result 559 states and 781 transitions. [2022-02-20 19:59:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 781 transitions. [2022-02-20 19:59:08,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:08,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:08,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 550 states, 439 states have (on average 1.4100227790432802) internal successors, (619), 454 states have internal predecessors, (619), 65 states have call successors, (65), 35 states have call predecessors, (65), 44 states have return successors, (87), 65 states have call predecessors, (87), 62 states have call successors, (87) Second operand 559 states. [2022-02-20 19:59:08,846 INFO L87 Difference]: Start difference. First operand has 550 states, 439 states have (on average 1.4100227790432802) internal successors, (619), 454 states have internal predecessors, (619), 65 states have call successors, (65), 35 states have call predecessors, (65), 44 states have return successors, (87), 65 states have call predecessors, (87), 62 states have call successors, (87) Second operand 559 states. [2022-02-20 19:59:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,872 INFO L93 Difference]: Finished difference Result 559 states and 781 transitions. [2022-02-20 19:59:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 781 transitions. [2022-02-20 19:59:08,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:08,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:08,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:08,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 439 states have (on average 1.4100227790432802) internal successors, (619), 454 states have internal predecessors, (619), 65 states have call successors, (65), 35 states have call predecessors, (65), 44 states have return successors, (87), 65 states have call predecessors, (87), 62 states have call successors, (87) [2022-02-20 19:59:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 771 transitions. [2022-02-20 19:59:08,902 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 771 transitions. Word has length 59 [2022-02-20 19:59:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:08,903 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 771 transitions. [2022-02-20 19:59:08,903 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:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 771 transitions. [2022-02-20 19:59:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:08,904 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:08,905 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:08,937 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:09,113 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:09,114 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:09,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2112594473, now seen corresponding path program 1 times [2022-02-20 19:59:09,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:09,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714541646] [2022-02-20 19:59:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:09,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:09,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:09,116 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:09,118 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:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:09,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:09,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {5511#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {5511#true} is VALID [2022-02-20 19:59:09,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {5511#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1; {5511#true} is VALID [2022-02-20 19:59:09,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {5511#true} assume 0bv32 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {5511#true} is VALID [2022-02-20 19:59:09,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {5511#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; {5511#true} is VALID [2022-02-20 19:59:09,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {5511#true} call update_channels1(); {5511#true} is VALID [2022-02-20 19:59:09,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {5511#true} assume !(1bv32 == ~q_req_up~0); {5511#true} is VALID [2022-02-20 19:59:09,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {5511#true} assume true; {5511#true} is VALID [2022-02-20 19:59:09,351 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5511#true} {5511#true} #877#return; {5511#true} is VALID [2022-02-20 19:59:09,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {5511#true} assume { :begin_inline_init_threads1 } true; {5511#true} is VALID [2022-02-20 19:59:09,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {5511#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {5511#true} is VALID [2022-02-20 19:59:09,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {5511#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {5511#true} is VALID [2022-02-20 19:59:09,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {5511#true} assume { :end_inline_init_threads1 } true; {5511#true} is VALID [2022-02-20 19:59:09,352 INFO L272 TraceCheckUtils]: 12: Hoare triple {5511#true} call fire_delta_events1(); {5511#true} is VALID [2022-02-20 19:59:09,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {5511#true} assume !(0bv32 == ~q_read_ev~0); {5511#true} is VALID [2022-02-20 19:59:09,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {5511#true} assume !(0bv32 == ~q_write_ev~0); {5511#true} is VALID [2022-02-20 19:59:09,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {5511#true} assume true; {5511#true} is VALID [2022-02-20 19:59:09,353 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5511#true} {5511#true} #879#return; {5511#true} is VALID [2022-02-20 19:59:09,353 INFO L272 TraceCheckUtils]: 17: Hoare triple {5511#true} call activate_threads1(); {5511#true} is VALID [2022-02-20 19:59:09,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {5511#true} havoc ~tmp~1;havoc ~tmp___0~1; {5511#true} is VALID [2022-02-20 19:59:09,353 INFO L272 TraceCheckUtils]: 19: Hoare triple {5511#true} call #t~ret8 := is_do_write_p_triggered(); {5511#true} is VALID [2022-02-20 19:59:09,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {5511#true} havoc ~__retres1~0; {5511#true} is VALID [2022-02-20 19:59:09,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {5511#true} assume !(1bv32 == ~p_dw_pc~0); {5511#true} is VALID [2022-02-20 19:59:09,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {5511#true} ~__retres1~0 := 0bv32; {5582#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:09,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {5582#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {5586#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:09,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {5586#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {5586#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:09,356 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5586#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {5511#true} #873#return; {5593#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:09,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {5593#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {5597#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:09,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {5597#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {5512#false} is VALID [2022-02-20 19:59:09,357 INFO L272 TraceCheckUtils]: 28: Hoare triple {5512#false} call #t~ret9 := is_do_read_c_triggered(); {5512#false} is VALID [2022-02-20 19:59:09,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {5512#false} havoc ~__retres1~1; {5512#false} is VALID [2022-02-20 19:59:09,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {5512#false} assume !(1bv32 == ~c_dr_pc~0); {5512#false} is VALID [2022-02-20 19:59:09,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {5512#false} ~__retres1~1 := 0bv32; {5512#false} is VALID [2022-02-20 19:59:09,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {5512#false} #res := ~__retres1~1; {5512#false} is VALID [2022-02-20 19:59:09,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {5512#false} assume true; {5512#false} is VALID [2022-02-20 19:59:09,358 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5512#false} {5512#false} #875#return; {5512#false} is VALID [2022-02-20 19:59:09,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {5512#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {5512#false} is VALID [2022-02-20 19:59:09,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {5512#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {5512#false} is VALID [2022-02-20 19:59:09,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {5512#false} assume true; {5512#false} is VALID [2022-02-20 19:59:09,359 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5512#false} {5511#true} #881#return; {5512#false} is VALID [2022-02-20 19:59:09,359 INFO L272 TraceCheckUtils]: 39: Hoare triple {5512#false} call reset_delta_events1(); {5512#false} is VALID [2022-02-20 19:59:09,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {5512#false} assume !(1bv32 == ~q_read_ev~0); {5512#false} is VALID [2022-02-20 19:59:09,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {5512#false} assume !(1bv32 == ~q_write_ev~0); {5512#false} is VALID [2022-02-20 19:59:09,360 INFO L290 TraceCheckUtils]: 42: Hoare triple {5512#false} assume true; {5512#false} is VALID [2022-02-20 19:59:09,360 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5512#false} {5512#false} #883#return; {5512#false} is VALID [2022-02-20 19:59:09,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {5512#false} assume !false; {5512#false} is VALID [2022-02-20 19:59:09,360 INFO L290 TraceCheckUtils]: 45: Hoare triple {5512#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; {5512#false} is VALID [2022-02-20 19:59:09,360 INFO L290 TraceCheckUtils]: 46: Hoare triple {5512#false} assume !false; {5512#false} is VALID [2022-02-20 19:59:09,361 INFO L272 TraceCheckUtils]: 47: Hoare triple {5512#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5512#false} is VALID [2022-02-20 19:59:09,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {5512#false} havoc ~__retres1~2; {5512#false} is VALID [2022-02-20 19:59:09,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {5512#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {5512#false} is VALID [2022-02-20 19:59:09,361 INFO L290 TraceCheckUtils]: 50: Hoare triple {5512#false} #res := ~__retres1~2; {5512#false} is VALID [2022-02-20 19:59:09,361 INFO L290 TraceCheckUtils]: 51: Hoare triple {5512#false} assume true; {5512#false} is VALID [2022-02-20 19:59:09,361 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5512#false} {5512#false} #885#return; {5512#false} is VALID [2022-02-20 19:59:09,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {5512#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {5512#false} is VALID [2022-02-20 19:59:09,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {5512#false} assume 0bv32 != eval1_~tmp___1~0#1; {5512#false} is VALID [2022-02-20 19:59:09,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {5512#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {5512#false} is VALID [2022-02-20 19:59:09,362 INFO L290 TraceCheckUtils]: 56: Hoare triple {5512#false} assume !(0bv32 != eval1_~tmp~2#1); {5512#false} is VALID [2022-02-20 19:59:09,362 INFO L272 TraceCheckUtils]: 57: Hoare triple {5512#false} call error1(); {5512#false} is VALID [2022-02-20 19:59:09,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {5512#false} assume !false; {5512#false} is VALID [2022-02-20 19:59:09,363 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:09,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:09,363 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:09,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714541646] [2022-02-20 19:59:09,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714541646] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:09,364 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:09,364 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:09,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255117124] [2022-02-20 19:59:09,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:09,365 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,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:09,366 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:09,406 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:09,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:09,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:09,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:09,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:09,408 INFO L87 Difference]: Start difference. First operand 550 states and 771 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:10,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,340 INFO L93 Difference]: Finished difference Result 941 states and 1304 transitions. [2022-02-20 19:59:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:10,341 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:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:10,341 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:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2022-02-20 19:59:10,347 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:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2022-02-20 19:59:10,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 493 transitions. [2022-02-20 19:59:10,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:10,695 INFO L225 Difference]: With dead ends: 941 [2022-02-20 19:59:10,695 INFO L226 Difference]: Without dead ends: 570 [2022-02-20 19:59:10,696 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:10,697 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 7 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1779 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:10,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1779 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:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-02-20 19:59:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 560. [2022-02-20 19:59:10,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:10,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand has 560 states, 447 states have (on average 1.3982102908277405) internal successors, (625), 462 states have internal predecessors, (625), 65 states have call successors, (65), 35 states have call predecessors, (65), 46 states have return successors, (89), 67 states have call predecessors, (89), 62 states have call successors, (89) [2022-02-20 19:59:10,726 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand has 560 states, 447 states have (on average 1.3982102908277405) internal successors, (625), 462 states have internal predecessors, (625), 65 states have call successors, (65), 35 states have call predecessors, (65), 46 states have return successors, (89), 67 states have call predecessors, (89), 62 states have call successors, (89) [2022-02-20 19:59:10,727 INFO L87 Difference]: Start difference. First operand 570 states. Second operand has 560 states, 447 states have (on average 1.3982102908277405) internal successors, (625), 462 states have internal predecessors, (625), 65 states have call successors, (65), 35 states have call predecessors, (65), 46 states have return successors, (89), 67 states have call predecessors, (89), 62 states have call successors, (89) [2022-02-20 19:59:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,748 INFO L93 Difference]: Finished difference Result 570 states and 795 transitions. [2022-02-20 19:59:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 795 transitions. [2022-02-20 19:59:10,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 447 states have (on average 1.3982102908277405) internal successors, (625), 462 states have internal predecessors, (625), 65 states have call successors, (65), 35 states have call predecessors, (65), 46 states have return successors, (89), 67 states have call predecessors, (89), 62 states have call successors, (89) Second operand 570 states. [2022-02-20 19:59:10,755 INFO L87 Difference]: Start difference. First operand has 560 states, 447 states have (on average 1.3982102908277405) internal successors, (625), 462 states have internal predecessors, (625), 65 states have call successors, (65), 35 states have call predecessors, (65), 46 states have return successors, (89), 67 states have call predecessors, (89), 62 states have call successors, (89) Second operand 570 states. [2022-02-20 19:59:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,773 INFO L93 Difference]: Finished difference Result 570 states and 795 transitions. [2022-02-20 19:59:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 795 transitions. [2022-02-20 19:59:10,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:10,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 447 states have (on average 1.3982102908277405) internal successors, (625), 462 states have internal predecessors, (625), 65 states have call successors, (65), 35 states have call predecessors, (65), 46 states have return successors, (89), 67 states have call predecessors, (89), 62 states have call successors, (89) [2022-02-20 19:59:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 779 transitions. [2022-02-20 19:59:10,802 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 779 transitions. Word has length 59 [2022-02-20 19:59:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:10,802 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 779 transitions. [2022-02-20 19:59:10,802 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:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 779 transitions. [2022-02-20 19:59:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:10,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:10,804 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:10,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 19:59:11,013 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:11,014 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1837834859, now seen corresponding path program 1 times [2022-02-20 19:59:11,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:11,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136678584] [2022-02-20 19:59:11,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:11,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:11,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:11,017 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:11,018 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:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:11,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {8873#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {8873#true} is VALID [2022-02-20 19:59:11,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {8873#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1; {8873#true} is VALID [2022-02-20 19:59:11,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {8873#true} assume 0bv32 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {8873#true} is VALID [2022-02-20 19:59:11,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {8873#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; {8873#true} is VALID [2022-02-20 19:59:11,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {8873#true} call update_channels1(); {8873#true} is VALID [2022-02-20 19:59:11,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {8873#true} assume !(1bv32 == ~q_req_up~0); {8873#true} is VALID [2022-02-20 19:59:11,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {8873#true} assume true; {8873#true} is VALID [2022-02-20 19:59:11,298 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8873#true} {8873#true} #877#return; {8873#true} is VALID [2022-02-20 19:59:11,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {8873#true} assume { :begin_inline_init_threads1 } true; {8873#true} is VALID [2022-02-20 19:59:11,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {8873#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {8873#true} is VALID [2022-02-20 19:59:11,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {8873#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {8873#true} is VALID [2022-02-20 19:59:11,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {8873#true} assume { :end_inline_init_threads1 } true; {8873#true} is VALID [2022-02-20 19:59:11,298 INFO L272 TraceCheckUtils]: 12: Hoare triple {8873#true} call fire_delta_events1(); {8873#true} is VALID [2022-02-20 19:59:11,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {8873#true} assume !(0bv32 == ~q_read_ev~0); {8873#true} is VALID [2022-02-20 19:59:11,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {8873#true} assume !(0bv32 == ~q_write_ev~0); {8873#true} is VALID [2022-02-20 19:59:11,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {8873#true} assume true; {8873#true} is VALID [2022-02-20 19:59:11,299 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8873#true} {8873#true} #879#return; {8873#true} is VALID [2022-02-20 19:59:11,299 INFO L272 TraceCheckUtils]: 17: Hoare triple {8873#true} call activate_threads1(); {8873#true} is VALID [2022-02-20 19:59:11,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {8873#true} havoc ~tmp~1;havoc ~tmp___0~1; {8873#true} is VALID [2022-02-20 19:59:11,300 INFO L272 TraceCheckUtils]: 19: Hoare triple {8873#true} call #t~ret8 := is_do_write_p_triggered(); {8873#true} is VALID [2022-02-20 19:59:11,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {8873#true} havoc ~__retres1~0; {8873#true} is VALID [2022-02-20 19:59:11,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {8873#true} assume !(1bv32 == ~p_dw_pc~0); {8873#true} is VALID [2022-02-20 19:59:11,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {8873#true} ~__retres1~0 := 0bv32; {8873#true} is VALID [2022-02-20 19:59:11,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {8873#true} #res := ~__retres1~0; {8873#true} is VALID [2022-02-20 19:59:11,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {8873#true} assume true; {8873#true} is VALID [2022-02-20 19:59:11,301 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8873#true} {8873#true} #873#return; {8873#true} is VALID [2022-02-20 19:59:11,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {8873#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {8873#true} is VALID [2022-02-20 19:59:11,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {8873#true} assume !(0bv32 != ~tmp~1); {8873#true} is VALID [2022-02-20 19:59:11,301 INFO L272 TraceCheckUtils]: 28: Hoare triple {8873#true} call #t~ret9 := is_do_read_c_triggered(); {8873#true} is VALID [2022-02-20 19:59:11,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {8873#true} havoc ~__retres1~1; {8873#true} is VALID [2022-02-20 19:59:11,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {8873#true} assume !(1bv32 == ~c_dr_pc~0); {8873#true} is VALID [2022-02-20 19:59:11,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {8873#true} ~__retres1~1 := 0bv32; {8971#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 19:59:11,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {8971#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {8975#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:11,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {8975#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {8975#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:11,304 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8975#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {8873#true} #875#return; {8982#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:11,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {8982#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {8986#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 19:59:11,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {8986#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {8874#false} is VALID [2022-02-20 19:59:11,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {8874#false} assume true; {8874#false} is VALID [2022-02-20 19:59:11,305 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8874#false} {8873#true} #881#return; {8874#false} is VALID [2022-02-20 19:59:11,305 INFO L272 TraceCheckUtils]: 39: Hoare triple {8874#false} call reset_delta_events1(); {8874#false} is VALID [2022-02-20 19:59:11,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {8874#false} assume !(1bv32 == ~q_read_ev~0); {8874#false} is VALID [2022-02-20 19:59:11,306 INFO L290 TraceCheckUtils]: 41: Hoare triple {8874#false} assume !(1bv32 == ~q_write_ev~0); {8874#false} is VALID [2022-02-20 19:59:11,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {8874#false} assume true; {8874#false} is VALID [2022-02-20 19:59:11,306 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8874#false} {8874#false} #883#return; {8874#false} is VALID [2022-02-20 19:59:11,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {8874#false} assume !false; {8874#false} is VALID [2022-02-20 19:59:11,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {8874#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; {8874#false} is VALID [2022-02-20 19:59:11,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {8874#false} assume !false; {8874#false} is VALID [2022-02-20 19:59:11,307 INFO L272 TraceCheckUtils]: 47: Hoare triple {8874#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8874#false} is VALID [2022-02-20 19:59:11,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {8874#false} havoc ~__retres1~2; {8874#false} is VALID [2022-02-20 19:59:11,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {8874#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {8874#false} is VALID [2022-02-20 19:59:11,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {8874#false} #res := ~__retres1~2; {8874#false} is VALID [2022-02-20 19:59:11,307 INFO L290 TraceCheckUtils]: 51: Hoare triple {8874#false} assume true; {8874#false} is VALID [2022-02-20 19:59:11,308 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8874#false} {8874#false} #885#return; {8874#false} is VALID [2022-02-20 19:59:11,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {8874#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {8874#false} is VALID [2022-02-20 19:59:11,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {8874#false} assume 0bv32 != eval1_~tmp___1~0#1; {8874#false} is VALID [2022-02-20 19:59:11,308 INFO L290 TraceCheckUtils]: 55: Hoare triple {8874#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {8874#false} is VALID [2022-02-20 19:59:11,308 INFO L290 TraceCheckUtils]: 56: Hoare triple {8874#false} assume !(0bv32 != eval1_~tmp~2#1); {8874#false} is VALID [2022-02-20 19:59:11,308 INFO L272 TraceCheckUtils]: 57: Hoare triple {8874#false} call error1(); {8874#false} is VALID [2022-02-20 19:59:11,309 INFO L290 TraceCheckUtils]: 58: Hoare triple {8874#false} assume !false; {8874#false} is VALID [2022-02-20 19:59:11,309 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:11,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:11,309 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:11,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136678584] [2022-02-20 19:59:11,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136678584] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:11,310 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:11,310 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:11,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86086187] [2022-02-20 19:59:11,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:11,311 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:11,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:11,311 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:11,357 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:11,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:11,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:11,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:11,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:11,362 INFO L87 Difference]: Start difference. First operand 560 states and 779 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:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,303 INFO L93 Difference]: Finished difference Result 955 states and 1310 transitions. [2022-02-20 19:59:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:12,304 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:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:12,305 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:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 488 transitions. [2022-02-20 19:59:12,312 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:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 488 transitions. [2022-02-20 19:59:12,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 488 transitions. [2022-02-20 19:59:12,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:12,695 INFO L225 Difference]: With dead ends: 955 [2022-02-20 19:59:12,695 INFO L226 Difference]: Without dead ends: 574 [2022-02-20 19:59:12,696 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:12,697 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 4 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1780 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:12,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1780 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:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-02-20 19:59:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 570. [2022-02-20 19:59:12,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:12,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 570 states, 455 states have (on average 1.3868131868131868) internal successors, (631), 470 states have internal predecessors, (631), 65 states have call successors, (65), 35 states have call predecessors, (65), 48 states have return successors, (91), 69 states have call predecessors, (91), 62 states have call successors, (91) [2022-02-20 19:59:12,726 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 570 states, 455 states have (on average 1.3868131868131868) internal successors, (631), 470 states have internal predecessors, (631), 65 states have call successors, (65), 35 states have call predecessors, (65), 48 states have return successors, (91), 69 states have call predecessors, (91), 62 states have call successors, (91) [2022-02-20 19:59:12,727 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 570 states, 455 states have (on average 1.3868131868131868) internal successors, (631), 470 states have internal predecessors, (631), 65 states have call successors, (65), 35 states have call predecessors, (65), 48 states have return successors, (91), 69 states have call predecessors, (91), 62 states have call successors, (91) [2022-02-20 19:59:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,748 INFO L93 Difference]: Finished difference Result 574 states and 793 transitions. [2022-02-20 19:59:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 793 transitions. [2022-02-20 19:59:12,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 570 states, 455 states have (on average 1.3868131868131868) internal successors, (631), 470 states have internal predecessors, (631), 65 states have call successors, (65), 35 states have call predecessors, (65), 48 states have return successors, (91), 69 states have call predecessors, (91), 62 states have call successors, (91) Second operand 574 states. [2022-02-20 19:59:12,753 INFO L87 Difference]: Start difference. First operand has 570 states, 455 states have (on average 1.3868131868131868) internal successors, (631), 470 states have internal predecessors, (631), 65 states have call successors, (65), 35 states have call predecessors, (65), 48 states have return successors, (91), 69 states have call predecessors, (91), 62 states have call successors, (91) Second operand 574 states. [2022-02-20 19:59:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,782 INFO L93 Difference]: Finished difference Result 574 states and 793 transitions. [2022-02-20 19:59:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 793 transitions. [2022-02-20 19:59:12,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:12,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 455 states have (on average 1.3868131868131868) internal successors, (631), 470 states have internal predecessors, (631), 65 states have call successors, (65), 35 states have call predecessors, (65), 48 states have return successors, (91), 69 states have call predecessors, (91), 62 states have call successors, (91) [2022-02-20 19:59:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 787 transitions. [2022-02-20 19:59:12,810 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 787 transitions. Word has length 59 [2022-02-20 19:59:12,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:12,811 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 787 transitions. [2022-02-20 19:59:12,813 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:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 787 transitions. [2022-02-20 19:59:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:12,814 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:12,814 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,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:13,015 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:13,015 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash 651694103, now seen corresponding path program 1 times [2022-02-20 19:59:13,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:13,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991456064] [2022-02-20 19:59:13,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:13,018 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:13,020 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:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:13,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:13,205 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:13,205 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:13,206 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:13,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:13,229 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:13,427 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:13,430 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 19:59:13,433 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:13,493 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:13,494 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:13,497 INFO L158 Benchmark]: Toolchain (without parser) took 11968.65ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 47.3MB in the beginning and 69.9MB in the end (delta: -22.6MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:13,498 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 48.2MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:13,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.98ms. Allocated memory is still 62.9MB. Free memory was 47.0MB in the beginning and 40.5MB in the end (delta: 6.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:13,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.69ms. Allocated memory is still 62.9MB. Free memory was 40.3MB in the beginning and 36.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:13,499 INFO L158 Benchmark]: Boogie Preprocessor took 37.06ms. Allocated memory is still 62.9MB. Free memory was 36.9MB in the beginning and 33.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:13,500 INFO L158 Benchmark]: RCFGBuilder took 729.20ms. Allocated memory is still 62.9MB. Free memory was 33.6MB in the beginning and 33.7MB in the end (delta: -148.0kB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2022-02-20 19:59:13,500 INFO L158 Benchmark]: TraceAbstraction took 10634.39ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 33.5MB in the beginning and 69.9MB in the end (delta: -36.5MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:13,502 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.44ms. Allocated memory is still 48.2MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.98ms. Allocated memory is still 62.9MB. Free memory was 47.0MB in the beginning and 40.5MB in the end (delta: 6.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.69ms. Allocated memory is still 62.9MB. Free memory was 40.3MB in the beginning and 36.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.06ms. Allocated memory is still 62.9MB. Free memory was 36.9MB in the beginning and 33.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 729.20ms. Allocated memory is still 62.9MB. Free memory was 33.6MB in the beginning and 33.7MB in the end (delta: -148.0kB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10634.39ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 33.5MB in the beginning and 69.9MB in the end (delta: -36.5MB). Peak memory consumption was 34.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:59:13,538 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