./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dee58858bceada86a9d77b57748794a4149b829dcc108044b7fcc9b2fa3dd4d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:37,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:37,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:37,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:37,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:37,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:37,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:37,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:37,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:37,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:37,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:37,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:37,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:37,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:37,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:37,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:37,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:37,611 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:37,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:37,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:37,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:37,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:37,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:37,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:37,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:37,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:37,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:37,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:37,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:37,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:37,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:37,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:37,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:37,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:37,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:37,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:37,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:37,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:37,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:37,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:37,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:37,633 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,659 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:37,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:37,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:37,660 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:37,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:37,661 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:37,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:37,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:37,661 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:37,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:37,662 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:37,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:37,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:37,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:37,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:37,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:37,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:37,663 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:37,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:37,663 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:37,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:37,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:37,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:37,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:37,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:37,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:37,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:37,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:37,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:37,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:37,666 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:37,666 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:37,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:37,666 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 -> 8dee58858bceada86a9d77b57748794a4149b829dcc108044b7fcc9b2fa3dd4d [2022-02-20 19:58:37,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:37,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:37,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:37,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:37,887 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:37,888 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.04.cil-1.c [2022-02-20 19:58:37,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66c24aa6/4ef612d278ec44f78bbc5cd6d69628ca/FLAGff6476cda [2022-02-20 19:58:38,282 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:38,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2022-02-20 19:58:38,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66c24aa6/4ef612d278ec44f78bbc5cd6d69628ca/FLAGff6476cda [2022-02-20 19:58:38,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66c24aa6/4ef612d278ec44f78bbc5cd6d69628ca [2022-02-20 19:58:38,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:38,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:38,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:38,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:38,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:38,682 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,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cd3e3c 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,683 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,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:38,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:38,843 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.04.cil-1.c[914,927] [2022-02-20 19:58:38,906 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.04.cil-1.c[7125,7138] [2022-02-20 19:58:38,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:38,992 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:39,012 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.04.cil-1.c[914,927] [2022-02-20 19:58:39,033 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.04.cil-1.c[7125,7138] [2022-02-20 19:58:39,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:39,086 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:39,087 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,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:39,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:39,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:39,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:39,092 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,103 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,147 INFO L137 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 577 [2022-02-20 19:58:39,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:39,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:39,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:39,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:39,161 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,162 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,167 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,170 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,178 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,184 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,187 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,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:39,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:39,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:39,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:39,192 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,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:39,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:39,230 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,254 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,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:39,262 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:39,263 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:39,263 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:39,263 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:39,263 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:39,264 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:39,264 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:39,264 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:39,264 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:39,265 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:39,265 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:39,265 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:39,265 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:39,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:39,266 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:39,266 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:39,348 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:39,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:39,932 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:39,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:39,941 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 19:58:39,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:39 BoogieIcfgContainer [2022-02-20 19:58:39,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:39,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:39,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:39,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:39,949 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:39,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627b4950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:39, skipping insertion in model container [2022-02-20 19:58:39,950 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:39,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627b4950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:39, skipping insertion in model container [2022-02-20 19:58:39,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:39" (3/3) ... [2022-02-20 19:58:39,951 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2022-02-20 19:58:39,955 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:39,955 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:39,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:40,000 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,000 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 241 states have internal predecessors, (371), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:58:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:40,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:40,049 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,049 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1988134503, now seen corresponding path program 1 times [2022-02-20 19:58:40,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:40,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111908749] [2022-02-20 19:58:40,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:40,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#(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); {328#(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,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {328#(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,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {328#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {289#(= ~q_write_ev~0 ~q_read_ev~0)} #989#return; {289#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#(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); {329#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:40,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#(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; {330#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:40,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {330#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:40,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {289#(= ~q_write_ev~0 ~q_read_ev~0)} #991#return; {288#false} is VALID [2022-02-20 19:58:40,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#true} havoc ~__retres1~0; {287#true} is VALID [2022-02-20 19:58:40,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume 1 == ~p_dw_pc~0; {287#true} is VALID [2022-02-20 19:58:40,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {287#true} is VALID [2022-02-20 19:58:40,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {287#true} #res := ~__retres1~0; {287#true} is VALID [2022-02-20 19:58:40,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,403 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {287#true} {287#true} #985#return; {287#true} is VALID [2022-02-20 19:58:40,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#true} havoc ~__retres1~1; {287#true} is VALID [2022-02-20 19:58:40,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume !(1 == ~c_dr_pc~0); {287#true} is VALID [2022-02-20 19:58:40,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} ~__retres1~1 := 0; {287#true} is VALID [2022-02-20 19:58:40,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {287#true} #res := ~__retres1~1; {287#true} is VALID [2022-02-20 19:58:40,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,410 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {287#true} {287#true} #987#return; {287#true} is VALID [2022-02-20 19:58:40,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#(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; {287#true} is VALID [2022-02-20 19:58:40,411 INFO L272 TraceCheckUtils]: 1: Hoare triple {287#true} call #t~ret8 := is_do_write_p_triggered(); {287#true} is VALID [2022-02-20 19:58:40,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} havoc ~__retres1~0; {287#true} is VALID [2022-02-20 19:58:40,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {287#true} assume 1 == ~p_dw_pc~0; {287#true} is VALID [2022-02-20 19:58:40,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {287#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {287#true} is VALID [2022-02-20 19:58:40,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#true} #res := ~__retres1~0; {287#true} is VALID [2022-02-20 19:58:40,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,413 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {287#true} {287#true} #985#return; {287#true} is VALID [2022-02-20 19:58:40,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {287#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {287#true} is VALID [2022-02-20 19:58:40,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {287#true} is VALID [2022-02-20 19:58:40,413 INFO L272 TraceCheckUtils]: 10: Hoare triple {287#true} call #t~ret9 := is_do_read_c_triggered(); {287#true} is VALID [2022-02-20 19:58:40,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {287#true} havoc ~__retres1~1; {287#true} is VALID [2022-02-20 19:58:40,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {287#true} assume !(1 == ~c_dr_pc~0); {287#true} is VALID [2022-02-20 19:58:40,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {287#true} ~__retres1~1 := 0; {287#true} is VALID [2022-02-20 19:58:40,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {287#true} #res := ~__retres1~1; {287#true} is VALID [2022-02-20 19:58:40,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,415 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {287#true} {287#true} #987#return; {287#true} is VALID [2022-02-20 19:58:40,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {287#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {287#true} is VALID [2022-02-20 19:58:40,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {287#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {287#true} is VALID [2022-02-20 19:58:40,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,416 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {287#true} {288#false} #993#return; {288#false} is VALID [2022-02-20 19:58:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#(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); {287#true} is VALID [2022-02-20 19:58:40,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {287#true} is VALID [2022-02-20 19:58:40,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287#true} {288#false} #995#return; {288#false} is VALID [2022-02-20 19:58:40,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:40,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#true} havoc ~__retres1~2; {287#true} is VALID [2022-02-20 19:58:40,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {287#true} is VALID [2022-02-20 19:58:40,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} #res := ~__retres1~2; {287#true} is VALID [2022-02-20 19:58:40,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,436 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {287#true} {288#false} #997#return; {288#false} is VALID [2022-02-20 19:58:40,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {287#true} is VALID [2022-02-20 19:58:40,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {287#true} is VALID [2022-02-20 19:58:40,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {289#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {289#(= ~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; {289#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {289#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {327#(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,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#(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); {328#(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,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {328#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {328#(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,446 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {328#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {289#(= ~q_write_ev~0 ~q_read_ev~0)} #989#return; {289#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {289#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {289#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {289#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {289#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {289#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {289#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {289#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:40,450 INFO L272 TraceCheckUtils]: 12: Hoare triple {289#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {328#(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,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#(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); {329#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:40,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {329#(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; {330#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:40,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {330#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {330#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:40,453 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {330#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {289#(= ~q_write_ev~0 ~q_read_ev~0)} #991#return; {288#false} is VALID [2022-02-20 19:58:40,453 INFO L272 TraceCheckUtils]: 17: Hoare triple {288#false} call activate_threads1(); {331#(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,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {331#(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; {287#true} is VALID [2022-02-20 19:58:40,454 INFO L272 TraceCheckUtils]: 19: Hoare triple {287#true} call #t~ret8 := is_do_write_p_triggered(); {287#true} is VALID [2022-02-20 19:58:40,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#true} havoc ~__retres1~0; {287#true} is VALID [2022-02-20 19:58:40,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {287#true} assume 1 == ~p_dw_pc~0; {287#true} is VALID [2022-02-20 19:58:40,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {287#true} is VALID [2022-02-20 19:58:40,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#true} #res := ~__retres1~0; {287#true} is VALID [2022-02-20 19:58:40,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,455 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {287#true} {287#true} #985#return; {287#true} is VALID [2022-02-20 19:58:40,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {287#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {287#true} is VALID [2022-02-20 19:58:40,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {287#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {287#true} is VALID [2022-02-20 19:58:40,456 INFO L272 TraceCheckUtils]: 28: Hoare triple {287#true} call #t~ret9 := is_do_read_c_triggered(); {287#true} is VALID [2022-02-20 19:58:40,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {287#true} havoc ~__retres1~1; {287#true} is VALID [2022-02-20 19:58:40,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {287#true} assume !(1 == ~c_dr_pc~0); {287#true} is VALID [2022-02-20 19:58:40,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {287#true} ~__retres1~1 := 0; {287#true} is VALID [2022-02-20 19:58:40,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {287#true} #res := ~__retres1~1; {287#true} is VALID [2022-02-20 19:58:40,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,457 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {287#true} {287#true} #987#return; {287#true} is VALID [2022-02-20 19:58:40,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {287#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {287#true} is VALID [2022-02-20 19:58:40,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {287#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {287#true} is VALID [2022-02-20 19:58:40,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,458 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {287#true} {288#false} #993#return; {288#false} is VALID [2022-02-20 19:58:40,458 INFO L272 TraceCheckUtils]: 39: Hoare triple {288#false} call reset_delta_events1(); {328#(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,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {328#(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); {287#true} is VALID [2022-02-20 19:58:40,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {287#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {287#true} is VALID [2022-02-20 19:58:40,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,459 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {287#true} {288#false} #995#return; {288#false} is VALID [2022-02-20 19:58:40,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 19:58:40,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {288#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; {288#false} is VALID [2022-02-20 19:58:40,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 19:58:40,460 INFO L272 TraceCheckUtils]: 47: Hoare triple {288#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {287#true} is VALID [2022-02-20 19:58:40,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {287#true} havoc ~__retres1~2; {287#true} is VALID [2022-02-20 19:58:40,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {287#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {287#true} is VALID [2022-02-20 19:58:40,460 INFO L290 TraceCheckUtils]: 50: Hoare triple {287#true} #res := ~__retres1~2; {287#true} is VALID [2022-02-20 19:58:40,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {287#true} assume true; {287#true} is VALID [2022-02-20 19:58:40,461 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {287#true} {288#false} #997#return; {288#false} is VALID [2022-02-20 19:58:40,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {288#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; {288#false} is VALID [2022-02-20 19:58:40,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {288#false} assume 0 != eval1_~tmp___1~0#1; {288#false} is VALID [2022-02-20 19:58:40,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {288#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; {288#false} is VALID [2022-02-20 19:58:40,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {288#false} assume !(0 != eval1_~tmp~2#1); {288#false} is VALID [2022-02-20 19:58:40,463 INFO L272 TraceCheckUtils]: 57: Hoare triple {288#false} call error1(); {288#false} is VALID [2022-02-20 19:58:40,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 19:58:40,464 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,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:40,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111908749] [2022-02-20 19:58:40,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111908749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:40,465 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:40,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:40,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984353344] [2022-02-20 19:58:40,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:40,471 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:40,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:40,474 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:40,516 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,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:40,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:40,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:40,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:40,566 INFO L87 Difference]: Start difference. First operand has 284 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 241 states have internal predecessors, (371), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) 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:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,286 INFO L93 Difference]: Finished difference Result 715 states and 1096 transitions. [2022-02-20 19:58:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:43,286 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:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:43,288 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:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1096 transitions. [2022-02-20 19:58:43,305 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:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1096 transitions. [2022-02-20 19:58:43,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1096 transitions. [2022-02-20 19:58:44,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1096 edges. 1096 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:44,084 INFO L225 Difference]: With dead ends: 715 [2022-02-20 19:58:44,085 INFO L226 Difference]: Without dead ends: 441 [2022-02-20 19:58:44,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:44,090 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 1104 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:44,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1127 Valid, 1447 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-02-20 19:58:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 374. [2022-02-20 19:58:44,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:44,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 441 states. Second operand has 374 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 313 states have internal predecessors, (449), 44 states have call successors, (44), 21 states have call predecessors, (44), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:58:44,133 INFO L74 IsIncluded]: Start isIncluded. First operand 441 states. Second operand has 374 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 313 states have internal predecessors, (449), 44 states have call successors, (44), 21 states have call predecessors, (44), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:58:44,134 INFO L87 Difference]: Start difference. First operand 441 states. Second operand has 374 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 313 states have internal predecessors, (449), 44 states have call successors, (44), 21 states have call predecessors, (44), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:58:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:44,167 INFO L93 Difference]: Finished difference Result 441 states and 640 transitions. [2022-02-20 19:58:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 640 transitions. [2022-02-20 19:58:44,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:44,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:44,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 374 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 313 states have internal predecessors, (449), 44 states have call successors, (44), 21 states have call predecessors, (44), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) Second operand 441 states. [2022-02-20 19:58:44,173 INFO L87 Difference]: Start difference. First operand has 374 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 313 states have internal predecessors, (449), 44 states have call successors, (44), 21 states have call predecessors, (44), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) Second operand 441 states. [2022-02-20 19:58:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:44,188 INFO L93 Difference]: Finished difference Result 441 states and 640 transitions. [2022-02-20 19:58:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 640 transitions. [2022-02-20 19:58:44,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:44,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:44,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:44,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 305 states have (on average 1.4721311475409835) internal successors, (449), 313 states have internal predecessors, (449), 44 states have call successors, (44), 21 states have call predecessors, (44), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2022-02-20 19:58:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 545 transitions. [2022-02-20 19:58:44,204 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 545 transitions. Word has length 59 [2022-02-20 19:58:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:44,204 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 545 transitions. [2022-02-20 19:58:44,204 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:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 545 transitions. [2022-02-20 19:58:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:44,206 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:44,206 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,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:44,206 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:44,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1413346455, now seen corresponding path program 1 times [2022-02-20 19:58:44,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:44,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693175014] [2022-02-20 19:58:44,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:44,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {2770#(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); {2771#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:44,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {2771#(not (= |old(~q_req_up~0)| 1))} assume true; {2771#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:44,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2771#(not (= |old(~q_req_up~0)| 1))} {2731#(= ~q_req_up~0 ~p_dw_pc~0)} #989#return; {2735#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:58:44,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {2772#(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); {2728#true} is VALID [2022-02-20 19:58:44,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(0 == ~q_write_ev~0); {2728#true} is VALID [2022-02-20 19:58:44,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-02-20 19:58:44,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2728#true} {2735#(not (= ~p_dw_pc~0 1))} #991#return; {2735#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:58:44,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {2728#true} havoc ~__retres1~0; {2728#true} is VALID [2022-02-20 19:58:44,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {2728#true} assume 1 == ~p_dw_pc~0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,325 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} {2728#true} #985#return; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {2728#true} havoc ~__retres1~1; {2728#true} is VALID [2022-02-20 19:58:44,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {2728#true} assume !(1 == ~c_dr_pc~0); {2728#true} is VALID [2022-02-20 19:58:44,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {2728#true} ~__retres1~1 := 0; {2728#true} is VALID [2022-02-20 19:58:44,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {2728#true} #res := ~__retres1~1; {2728#true} is VALID [2022-02-20 19:58:44,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-02-20 19:58:44,330 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2728#true} {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} #987#return; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {2773#(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; {2728#true} is VALID [2022-02-20 19:58:44,330 INFO L272 TraceCheckUtils]: 1: Hoare triple {2728#true} call #t~ret8 := is_do_write_p_triggered(); {2728#true} is VALID [2022-02-20 19:58:44,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {2728#true} havoc ~__retres1~0; {2728#true} is VALID [2022-02-20 19:58:44,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {2728#true} assume 1 == ~p_dw_pc~0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,332 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} {2728#true} #985#return; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,333 INFO L272 TraceCheckUtils]: 10: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2728#true} is VALID [2022-02-20 19:58:44,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {2728#true} havoc ~__retres1~1; {2728#true} is VALID [2022-02-20 19:58:44,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {2728#true} assume !(1 == ~c_dr_pc~0); {2728#true} is VALID [2022-02-20 19:58:44,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {2728#true} ~__retres1~1 := 0; {2728#true} is VALID [2022-02-20 19:58:44,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {2728#true} #res := ~__retres1~1; {2728#true} is VALID [2022-02-20 19:58:44,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-02-20 19:58:44,334 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2728#true} {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} #987#return; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,336 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} {2735#(not (= ~p_dw_pc~0 1))} #993#return; {2729#false} is VALID [2022-02-20 19:58:44,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {2772#(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); {2728#true} is VALID [2022-02-20 19:58:44,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {2728#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2728#true} is VALID [2022-02-20 19:58:44,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-02-20 19:58:44,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2728#true} {2729#false} #995#return; {2729#false} is VALID [2022-02-20 19:58:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {2728#true} havoc ~__retres1~2; {2728#true} is VALID [2022-02-20 19:58:44,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {2728#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2728#true} is VALID [2022-02-20 19:58:44,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {2728#true} #res := ~__retres1~2; {2728#true} is VALID [2022-02-20 19:58:44,343 INFO L290 TraceCheckUtils]: 3: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-02-20 19:58:44,343 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2728#true} {2729#false} #997#return; {2729#false} is VALID [2022-02-20 19:58:44,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {2728#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {2730#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:44,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {2730#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {2730#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:44,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {2730#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {2731#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:44,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {2731#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~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; {2731#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 19:58:44,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {2731#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {2770#(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,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {2770#(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); {2771#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:44,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {2771#(not (= |old(~q_req_up~0)| 1))} assume true; {2771#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:44,346 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2771#(not (= |old(~q_req_up~0)| 1))} {2731#(= ~q_req_up~0 ~p_dw_pc~0)} #989#return; {2735#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:58:44,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {2735#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {2735#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:58:44,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {2735#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2735#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:58:44,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {2735#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2735#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:58:44,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {2735#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {2735#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:58:44,348 INFO L272 TraceCheckUtils]: 12: Hoare triple {2735#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {2772#(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,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(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); {2728#true} is VALID [2022-02-20 19:58:44,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {2728#true} assume !(0 == ~q_write_ev~0); {2728#true} is VALID [2022-02-20 19:58:44,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-02-20 19:58:44,349 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2728#true} {2735#(not (= ~p_dw_pc~0 1))} #991#return; {2735#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 19:58:44,349 INFO L272 TraceCheckUtils]: 17: Hoare triple {2735#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {2773#(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,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {2773#(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; {2728#true} is VALID [2022-02-20 19:58:44,350 INFO L272 TraceCheckUtils]: 19: Hoare triple {2728#true} call #t~ret8 := is_do_write_p_triggered(); {2728#true} is VALID [2022-02-20 19:58:44,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {2728#true} havoc ~__retres1~0; {2728#true} is VALID [2022-02-20 19:58:44,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {2728#true} assume 1 == ~p_dw_pc~0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,352 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} {2728#true} #985#return; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,353 INFO L272 TraceCheckUtils]: 28: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {2728#true} is VALID [2022-02-20 19:58:44,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {2728#true} havoc ~__retres1~1; {2728#true} is VALID [2022-02-20 19:58:44,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {2728#true} assume !(1 == ~c_dr_pc~0); {2728#true} is VALID [2022-02-20 19:58:44,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {2728#true} ~__retres1~1 := 0; {2728#true} is VALID [2022-02-20 19:58:44,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {2728#true} #res := ~__retres1~1; {2728#true} is VALID [2022-02-20 19:58:44,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-02-20 19:58:44,354 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2728#true} {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} #987#return; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 19:58:44,356 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2780#(= (+ (- 1) ~p_dw_pc~0) 0)} {2735#(not (= ~p_dw_pc~0 1))} #993#return; {2729#false} is VALID [2022-02-20 19:58:44,356 INFO L272 TraceCheckUtils]: 39: Hoare triple {2729#false} call reset_delta_events1(); {2772#(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,356 INFO L290 TraceCheckUtils]: 40: Hoare triple {2772#(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); {2728#true} is VALID [2022-02-20 19:58:44,356 INFO L290 TraceCheckUtils]: 41: Hoare triple {2728#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2728#true} is VALID [2022-02-20 19:58:44,356 INFO L290 TraceCheckUtils]: 42: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-02-20 19:58:44,356 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2728#true} {2729#false} #995#return; {2729#false} is VALID [2022-02-20 19:58:44,356 INFO L290 TraceCheckUtils]: 44: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2022-02-20 19:58:44,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {2729#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; {2729#false} is VALID [2022-02-20 19:58:44,357 INFO L290 TraceCheckUtils]: 46: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2022-02-20 19:58:44,357 INFO L272 TraceCheckUtils]: 47: Hoare triple {2729#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2728#true} is VALID [2022-02-20 19:58:44,357 INFO L290 TraceCheckUtils]: 48: Hoare triple {2728#true} havoc ~__retres1~2; {2728#true} is VALID [2022-02-20 19:58:44,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {2728#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2728#true} is VALID [2022-02-20 19:58:44,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {2728#true} #res := ~__retres1~2; {2728#true} is VALID [2022-02-20 19:58:44,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {2728#true} assume true; {2728#true} is VALID [2022-02-20 19:58:44,358 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2728#true} {2729#false} #997#return; {2729#false} is VALID [2022-02-20 19:58:44,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {2729#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; {2729#false} is VALID [2022-02-20 19:58:44,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {2729#false} assume 0 != eval1_~tmp___1~0#1; {2729#false} is VALID [2022-02-20 19:58:44,358 INFO L290 TraceCheckUtils]: 55: Hoare triple {2729#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; {2729#false} is VALID [2022-02-20 19:58:44,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {2729#false} assume !(0 != eval1_~tmp~2#1); {2729#false} is VALID [2022-02-20 19:58:44,358 INFO L272 TraceCheckUtils]: 57: Hoare triple {2729#false} call error1(); {2729#false} is VALID [2022-02-20 19:58:44,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {2729#false} assume !false; {2729#false} is VALID [2022-02-20 19:58:44,372 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,372 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:44,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693175014] [2022-02-20 19:58:44,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693175014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:44,372 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:44,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:44,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221459176] [2022-02-20 19:58:44,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:44,374 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-02-20 19:58:44,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:44,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:58:44,410 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,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:44,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:44,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:44,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:44,412 INFO L87 Difference]: Start difference. First operand 374 states and 545 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:58:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:49,138 INFO L93 Difference]: Finished difference Result 1335 states and 1884 transitions. [2022-02-20 19:58:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:49,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-02-20 19:58:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:58:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1097 transitions. [2022-02-20 19:58:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:58:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1097 transitions. [2022-02-20 19:58:49,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1097 transitions. [2022-02-20 19:58:49,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1097 edges. 1097 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:50,000 INFO L225 Difference]: With dead ends: 1335 [2022-02-20 19:58:50,000 INFO L226 Difference]: Without dead ends: 1141 [2022-02-20 19:58:50,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:58:50,003 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 2192 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2206 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:50,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2206 Valid, 1930 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 19:58:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-02-20 19:58:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1024. [2022-02-20 19:58:50,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:50,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1141 states. Second operand has 1024 states, 817 states have (on average 1.4026927784577723) internal successors, (1146), 838 states have internal predecessors, (1146), 111 states have call successors, (111), 81 states have call predecessors, (111), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) [2022-02-20 19:58:50,066 INFO L74 IsIncluded]: Start isIncluded. First operand 1141 states. Second operand has 1024 states, 817 states have (on average 1.4026927784577723) internal successors, (1146), 838 states have internal predecessors, (1146), 111 states have call successors, (111), 81 states have call predecessors, (111), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) [2022-02-20 19:58:50,068 INFO L87 Difference]: Start difference. First operand 1141 states. Second operand has 1024 states, 817 states have (on average 1.4026927784577723) internal successors, (1146), 838 states have internal predecessors, (1146), 111 states have call successors, (111), 81 states have call predecessors, (111), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) [2022-02-20 19:58:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:50,121 INFO L93 Difference]: Finished difference Result 1141 states and 1538 transitions. [2022-02-20 19:58:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1538 transitions. [2022-02-20 19:58:50,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:50,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:50,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 817 states have (on average 1.4026927784577723) internal successors, (1146), 838 states have internal predecessors, (1146), 111 states have call successors, (111), 81 states have call predecessors, (111), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) Second operand 1141 states. [2022-02-20 19:58:50,128 INFO L87 Difference]: Start difference. First operand has 1024 states, 817 states have (on average 1.4026927784577723) internal successors, (1146), 838 states have internal predecessors, (1146), 111 states have call successors, (111), 81 states have call predecessors, (111), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) Second operand 1141 states. [2022-02-20 19:58:50,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:50,178 INFO L93 Difference]: Finished difference Result 1141 states and 1538 transitions. [2022-02-20 19:58:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1538 transitions. [2022-02-20 19:58:50,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:50,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:50,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:50,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 817 states have (on average 1.4026927784577723) internal successors, (1146), 838 states have internal predecessors, (1146), 111 states have call successors, (111), 81 states have call predecessors, (111), 94 states have return successors, (141), 107 states have call predecessors, (141), 108 states have call successors, (141) [2022-02-20 19:58:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1398 transitions. [2022-02-20 19:58:50,235 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1398 transitions. Word has length 59 [2022-02-20 19:58:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:50,236 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1398 transitions. [2022-02-20 19:58:50,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 19:58:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1398 transitions. [2022-02-20 19:58:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:50,238 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:50,239 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:50,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:50,239 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:50,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash -890025784, now seen corresponding path program 1 times [2022-02-20 19:58:50,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:50,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826171858] [2022-02-20 19:58:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:50,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:50,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:50,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {8375#(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); {8336#true} is VALID [2022-02-20 19:58:50,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8336#true} {8336#true} #989#return; {8336#true} is VALID [2022-02-20 19:58:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:50,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {8376#(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); {8336#true} is VALID [2022-02-20 19:58:50,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {8336#true} assume !(0 == ~q_write_ev~0); {8336#true} is VALID [2022-02-20 19:58:50,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8336#true} {8336#true} #991#return; {8336#true} is VALID [2022-02-20 19:58:50,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:50,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {8336#true} havoc ~__retres1~0; {8336#true} is VALID [2022-02-20 19:58:50,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {8336#true} assume !(1 == ~p_dw_pc~0); {8336#true} is VALID [2022-02-20 19:58:50,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {8336#true} ~__retres1~0 := 0; {8392#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:50,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {8392#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:50,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:50,378 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8336#true} #985#return; {8384#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:50,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:50,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {8336#true} havoc ~__retres1~1; {8336#true} is VALID [2022-02-20 19:58:50,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {8336#true} assume !(1 == ~c_dr_pc~0); {8336#true} is VALID [2022-02-20 19:58:50,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {8336#true} ~__retres1~1 := 0; {8336#true} is VALID [2022-02-20 19:58:50,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {8336#true} #res := ~__retres1~1; {8336#true} is VALID [2022-02-20 19:58:50,382 INFO L290 TraceCheckUtils]: 4: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,382 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8336#true} {8337#false} #987#return; {8337#false} is VALID [2022-02-20 19:58:50,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {8377#(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; {8336#true} is VALID [2022-02-20 19:58:50,383 INFO L272 TraceCheckUtils]: 1: Hoare triple {8336#true} call #t~ret8 := is_do_write_p_triggered(); {8336#true} is VALID [2022-02-20 19:58:50,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {8336#true} havoc ~__retres1~0; {8336#true} is VALID [2022-02-20 19:58:50,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {8336#true} assume !(1 == ~p_dw_pc~0); {8336#true} is VALID [2022-02-20 19:58:50,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {8336#true} ~__retres1~0 := 0; {8392#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:50,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {8392#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:50,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:50,385 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8336#true} #985#return; {8384#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:50,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {8384#(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; {8385#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:50,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {8385#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8337#false} is VALID [2022-02-20 19:58:50,386 INFO L272 TraceCheckUtils]: 10: Hoare triple {8337#false} call #t~ret9 := is_do_read_c_triggered(); {8336#true} is VALID [2022-02-20 19:58:50,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {8336#true} havoc ~__retres1~1; {8336#true} is VALID [2022-02-20 19:58:50,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {8336#true} assume !(1 == ~c_dr_pc~0); {8336#true} is VALID [2022-02-20 19:58:50,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {8336#true} ~__retres1~1 := 0; {8336#true} is VALID [2022-02-20 19:58:50,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {8336#true} #res := ~__retres1~1; {8336#true} is VALID [2022-02-20 19:58:50,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,387 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8336#true} {8337#false} #987#return; {8337#false} is VALID [2022-02-20 19:58:50,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {8337#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8337#false} is VALID [2022-02-20 19:58:50,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {8337#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {8337#false} is VALID [2022-02-20 19:58:50,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {8337#false} assume true; {8337#false} is VALID [2022-02-20 19:58:50,387 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8337#false} {8336#true} #993#return; {8337#false} is VALID [2022-02-20 19:58:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:50,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {8376#(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); {8336#true} is VALID [2022-02-20 19:58:50,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {8336#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8336#true} is VALID [2022-02-20 19:58:50,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8336#true} {8337#false} #995#return; {8337#false} is VALID [2022-02-20 19:58:50,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:50,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {8336#true} havoc ~__retres1~2; {8336#true} is VALID [2022-02-20 19:58:50,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {8336#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8336#true} is VALID [2022-02-20 19:58:50,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {8336#true} #res := ~__retres1~2; {8336#true} is VALID [2022-02-20 19:58:50,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,394 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8336#true} {8337#false} #997#return; {8337#false} is VALID [2022-02-20 19:58:50,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {8336#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {8336#true} is VALID [2022-02-20 19:58:50,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {8336#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {8336#true} is VALID [2022-02-20 19:58:50,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {8336#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {8336#true} is VALID [2022-02-20 19:58:50,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {8336#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; {8336#true} is VALID [2022-02-20 19:58:50,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {8336#true} call update_channels1(); {8375#(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:50,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {8375#(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); {8336#true} is VALID [2022-02-20 19:58:50,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,396 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8336#true} {8336#true} #989#return; {8336#true} is VALID [2022-02-20 19:58:50,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {8336#true} assume { :begin_inline_init_threads1 } true; {8336#true} is VALID [2022-02-20 19:58:50,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {8336#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {8336#true} is VALID [2022-02-20 19:58:50,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {8336#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {8336#true} is VALID [2022-02-20 19:58:50,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {8336#true} assume { :end_inline_init_threads1 } true; {8336#true} is VALID [2022-02-20 19:58:50,397 INFO L272 TraceCheckUtils]: 12: Hoare triple {8336#true} call fire_delta_events1(); {8376#(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:50,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {8376#(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); {8336#true} is VALID [2022-02-20 19:58:50,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {8336#true} assume !(0 == ~q_write_ev~0); {8336#true} is VALID [2022-02-20 19:58:50,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,398 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8336#true} {8336#true} #991#return; {8336#true} is VALID [2022-02-20 19:58:50,398 INFO L272 TraceCheckUtils]: 17: Hoare triple {8336#true} call activate_threads1(); {8377#(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:50,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {8377#(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; {8336#true} is VALID [2022-02-20 19:58:50,398 INFO L272 TraceCheckUtils]: 19: Hoare triple {8336#true} call #t~ret8 := is_do_write_p_triggered(); {8336#true} is VALID [2022-02-20 19:58:50,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {8336#true} havoc ~__retres1~0; {8336#true} is VALID [2022-02-20 19:58:50,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {8336#true} assume !(1 == ~p_dw_pc~0); {8336#true} is VALID [2022-02-20 19:58:50,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {8336#true} ~__retres1~0 := 0; {8392#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:50,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {8392#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:50,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:50,400 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8393#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {8336#true} #985#return; {8384#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:50,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {8384#(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; {8385#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:50,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {8385#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8337#false} is VALID [2022-02-20 19:58:50,401 INFO L272 TraceCheckUtils]: 28: Hoare triple {8337#false} call #t~ret9 := is_do_read_c_triggered(); {8336#true} is VALID [2022-02-20 19:58:50,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {8336#true} havoc ~__retres1~1; {8336#true} is VALID [2022-02-20 19:58:50,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {8336#true} assume !(1 == ~c_dr_pc~0); {8336#true} is VALID [2022-02-20 19:58:50,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {8336#true} ~__retres1~1 := 0; {8336#true} is VALID [2022-02-20 19:58:50,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {8336#true} #res := ~__retres1~1; {8336#true} is VALID [2022-02-20 19:58:50,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,402 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8336#true} {8337#false} #987#return; {8337#false} is VALID [2022-02-20 19:58:50,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {8337#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8337#false} is VALID [2022-02-20 19:58:50,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {8337#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {8337#false} is VALID [2022-02-20 19:58:50,403 INFO L290 TraceCheckUtils]: 37: Hoare triple {8337#false} assume true; {8337#false} is VALID [2022-02-20 19:58:50,403 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8337#false} {8336#true} #993#return; {8337#false} is VALID [2022-02-20 19:58:50,403 INFO L272 TraceCheckUtils]: 39: Hoare triple {8337#false} call reset_delta_events1(); {8376#(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:50,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {8376#(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); {8336#true} is VALID [2022-02-20 19:58:50,403 INFO L290 TraceCheckUtils]: 41: Hoare triple {8336#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {8336#true} is VALID [2022-02-20 19:58:50,403 INFO L290 TraceCheckUtils]: 42: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,404 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8336#true} {8337#false} #995#return; {8337#false} is VALID [2022-02-20 19:58:50,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2022-02-20 19:58:50,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {8337#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; {8337#false} is VALID [2022-02-20 19:58:50,404 INFO L290 TraceCheckUtils]: 46: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2022-02-20 19:58:50,404 INFO L272 TraceCheckUtils]: 47: Hoare triple {8337#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8336#true} is VALID [2022-02-20 19:58:50,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {8336#true} havoc ~__retres1~2; {8336#true} is VALID [2022-02-20 19:58:50,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {8336#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8336#true} is VALID [2022-02-20 19:58:50,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {8336#true} #res := ~__retres1~2; {8336#true} is VALID [2022-02-20 19:58:50,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {8336#true} assume true; {8336#true} is VALID [2022-02-20 19:58:50,405 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8336#true} {8337#false} #997#return; {8337#false} is VALID [2022-02-20 19:58:50,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {8337#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; {8337#false} is VALID [2022-02-20 19:58:50,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {8337#false} assume 0 != eval1_~tmp___1~0#1; {8337#false} is VALID [2022-02-20 19:58:50,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {8337#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; {8337#false} is VALID [2022-02-20 19:58:50,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {8337#false} assume !(0 != eval1_~tmp~2#1); {8337#false} is VALID [2022-02-20 19:58:50,406 INFO L272 TraceCheckUtils]: 57: Hoare triple {8337#false} call error1(); {8337#false} is VALID [2022-02-20 19:58:50,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2022-02-20 19:58:50,406 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:50,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:50,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826171858] [2022-02-20 19:58:50,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826171858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:50,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:50,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:50,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747350848] [2022-02-20 19:58:50,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:50,408 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:50,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:50,408 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:50,441 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:50,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:50,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:50,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:50,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:50,443 INFO L87 Difference]: Start difference. First operand 1024 states and 1398 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:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:52,963 INFO L93 Difference]: Finished difference Result 1931 states and 2607 transitions. [2022-02-20 19:58:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:52,963 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:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:52,964 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:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 554 transitions. [2022-02-20 19:58:52,968 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:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 554 transitions. [2022-02-20 19:58:52,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 554 transitions. [2022-02-20 19:58:53,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 554 edges. 554 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:53,444 INFO L225 Difference]: With dead ends: 1931 [2022-02-20 19:58:53,444 INFO L226 Difference]: Without dead ends: 1094 [2022-02-20 19:58:53,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:58:53,453 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 330 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:53,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 1736 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:53,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-02-20 19:58:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1044. [2022-02-20 19:58:53,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:53,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1094 states. Second operand has 1044 states, 833 states have (on average 1.3877551020408163) internal successors, (1156), 854 states have internal predecessors, (1156), 111 states have call successors, (111), 81 states have call predecessors, (111), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) [2022-02-20 19:58:53,515 INFO L74 IsIncluded]: Start isIncluded. First operand 1094 states. Second operand has 1044 states, 833 states have (on average 1.3877551020408163) internal successors, (1156), 854 states have internal predecessors, (1156), 111 states have call successors, (111), 81 states have call predecessors, (111), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) [2022-02-20 19:58:53,516 INFO L87 Difference]: Start difference. First operand 1094 states. Second operand has 1044 states, 833 states have (on average 1.3877551020408163) internal successors, (1156), 854 states have internal predecessors, (1156), 111 states have call successors, (111), 81 states have call predecessors, (111), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) [2022-02-20 19:58:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:53,560 INFO L93 Difference]: Finished difference Result 1094 states and 1472 transitions. [2022-02-20 19:58:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1472 transitions. [2022-02-20 19:58:53,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:53,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:53,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 1044 states, 833 states have (on average 1.3877551020408163) internal successors, (1156), 854 states have internal predecessors, (1156), 111 states have call successors, (111), 81 states have call predecessors, (111), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) Second operand 1094 states. [2022-02-20 19:58:53,566 INFO L87 Difference]: Start difference. First operand has 1044 states, 833 states have (on average 1.3877551020408163) internal successors, (1156), 854 states have internal predecessors, (1156), 111 states have call successors, (111), 81 states have call predecessors, (111), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) Second operand 1094 states. [2022-02-20 19:58:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:53,613 INFO L93 Difference]: Finished difference Result 1094 states and 1472 transitions. [2022-02-20 19:58:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1472 transitions. [2022-02-20 19:58:53,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:53,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:53,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:53,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 833 states have (on average 1.3877551020408163) internal successors, (1156), 854 states have internal predecessors, (1156), 111 states have call successors, (111), 81 states have call predecessors, (111), 98 states have return successors, (145), 111 states have call predecessors, (145), 108 states have call successors, (145) [2022-02-20 19:58:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1412 transitions. [2022-02-20 19:58:53,669 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1412 transitions. Word has length 59 [2022-02-20 19:58:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:53,669 INFO L470 AbstractCegarLoop]: Abstraction has 1044 states and 1412 transitions. [2022-02-20 19:58:53,669 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:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1412 transitions. [2022-02-20 19:58:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:53,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:53,670 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:53,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:53,670 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:53,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash -615266170, now seen corresponding path program 1 times [2022-02-20 19:58:53,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:53,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582082627] [2022-02-20 19:58:53,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:53,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {14654#(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); {14615#true} is VALID [2022-02-20 19:58:53,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14615#true} {14615#true} #989#return; {14615#true} is VALID [2022-02-20 19:58:53,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {14655#(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); {14615#true} is VALID [2022-02-20 19:58:53,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {14615#true} assume !(0 == ~q_write_ev~0); {14615#true} is VALID [2022-02-20 19:58:53,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14615#true} {14615#true} #991#return; {14615#true} is VALID [2022-02-20 19:58:53,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {14615#true} havoc ~__retres1~0; {14615#true} is VALID [2022-02-20 19:58:53,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {14615#true} assume !(1 == ~p_dw_pc~0); {14615#true} is VALID [2022-02-20 19:58:53,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {14615#true} ~__retres1~0 := 0; {14615#true} is VALID [2022-02-20 19:58:53,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {14615#true} #res := ~__retres1~0; {14615#true} is VALID [2022-02-20 19:58:53,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,767 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14615#true} {14615#true} #985#return; {14615#true} is VALID [2022-02-20 19:58:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {14615#true} havoc ~__retres1~1; {14615#true} is VALID [2022-02-20 19:58:53,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {14615#true} assume !(1 == ~c_dr_pc~0); {14615#true} is VALID [2022-02-20 19:58:53,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {14615#true} ~__retres1~1 := 0; {14671#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:53,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {14671#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:53,794 INFO L290 TraceCheckUtils]: 4: Hoare triple {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:53,795 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {14615#true} #987#return; {14669#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:53,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {14656#(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; {14615#true} is VALID [2022-02-20 19:58:53,795 INFO L272 TraceCheckUtils]: 1: Hoare triple {14615#true} call #t~ret8 := is_do_write_p_triggered(); {14615#true} is VALID [2022-02-20 19:58:53,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {14615#true} havoc ~__retres1~0; {14615#true} is VALID [2022-02-20 19:58:53,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {14615#true} assume !(1 == ~p_dw_pc~0); {14615#true} is VALID [2022-02-20 19:58:53,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {14615#true} ~__retres1~0 := 0; {14615#true} is VALID [2022-02-20 19:58:53,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {14615#true} #res := ~__retres1~0; {14615#true} is VALID [2022-02-20 19:58:53,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,796 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14615#true} {14615#true} #985#return; {14615#true} is VALID [2022-02-20 19:58:53,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {14615#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14615#true} is VALID [2022-02-20 19:58:53,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {14615#true} assume !(0 != ~tmp~1); {14615#true} is VALID [2022-02-20 19:58:53,796 INFO L272 TraceCheckUtils]: 10: Hoare triple {14615#true} call #t~ret9 := is_do_read_c_triggered(); {14615#true} is VALID [2022-02-20 19:58:53,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {14615#true} havoc ~__retres1~1; {14615#true} is VALID [2022-02-20 19:58:53,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {14615#true} assume !(1 == ~c_dr_pc~0); {14615#true} is VALID [2022-02-20 19:58:53,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {14615#true} ~__retres1~1 := 0; {14671#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:53,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {14671#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:53,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:53,798 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {14615#true} #987#return; {14669#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:53,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {14669#(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; {14670#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:53,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {14670#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14616#false} is VALID [2022-02-20 19:58:53,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {14616#false} assume true; {14616#false} is VALID [2022-02-20 19:58:53,800 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14616#false} {14615#true} #993#return; {14616#false} is VALID [2022-02-20 19:58:53,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {14655#(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); {14615#true} is VALID [2022-02-20 19:58:53,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {14615#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14615#true} is VALID [2022-02-20 19:58:53,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14615#true} {14616#false} #995#return; {14616#false} is VALID [2022-02-20 19:58:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:53,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {14615#true} havoc ~__retres1~2; {14615#true} is VALID [2022-02-20 19:58:53,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {14615#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14615#true} is VALID [2022-02-20 19:58:53,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {14615#true} #res := ~__retres1~2; {14615#true} is VALID [2022-02-20 19:58:53,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,806 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14615#true} {14616#false} #997#return; {14616#false} is VALID [2022-02-20 19:58:53,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {14615#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {14615#true} is VALID [2022-02-20 19:58:53,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {14615#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {14615#true} is VALID [2022-02-20 19:58:53,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {14615#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {14615#true} is VALID [2022-02-20 19:58:53,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {14615#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; {14615#true} is VALID [2022-02-20 19:58:53,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {14615#true} call update_channels1(); {14654#(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:53,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {14654#(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); {14615#true} is VALID [2022-02-20 19:58:53,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,808 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14615#true} {14615#true} #989#return; {14615#true} is VALID [2022-02-20 19:58:53,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {14615#true} assume { :begin_inline_init_threads1 } true; {14615#true} is VALID [2022-02-20 19:58:53,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {14615#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14615#true} is VALID [2022-02-20 19:58:53,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {14615#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14615#true} is VALID [2022-02-20 19:58:53,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {14615#true} assume { :end_inline_init_threads1 } true; {14615#true} is VALID [2022-02-20 19:58:53,809 INFO L272 TraceCheckUtils]: 12: Hoare triple {14615#true} call fire_delta_events1(); {14655#(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:53,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {14655#(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); {14615#true} is VALID [2022-02-20 19:58:53,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {14615#true} assume !(0 == ~q_write_ev~0); {14615#true} is VALID [2022-02-20 19:58:53,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,809 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14615#true} {14615#true} #991#return; {14615#true} is VALID [2022-02-20 19:58:53,810 INFO L272 TraceCheckUtils]: 17: Hoare triple {14615#true} call activate_threads1(); {14656#(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:53,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {14656#(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; {14615#true} is VALID [2022-02-20 19:58:53,810 INFO L272 TraceCheckUtils]: 19: Hoare triple {14615#true} call #t~ret8 := is_do_write_p_triggered(); {14615#true} is VALID [2022-02-20 19:58:53,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {14615#true} havoc ~__retres1~0; {14615#true} is VALID [2022-02-20 19:58:53,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {14615#true} assume !(1 == ~p_dw_pc~0); {14615#true} is VALID [2022-02-20 19:58:53,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {14615#true} ~__retres1~0 := 0; {14615#true} is VALID [2022-02-20 19:58:53,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {14615#true} #res := ~__retres1~0; {14615#true} is VALID [2022-02-20 19:58:53,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,811 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14615#true} {14615#true} #985#return; {14615#true} is VALID [2022-02-20 19:58:53,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {14615#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14615#true} is VALID [2022-02-20 19:58:53,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {14615#true} assume !(0 != ~tmp~1); {14615#true} is VALID [2022-02-20 19:58:53,811 INFO L272 TraceCheckUtils]: 28: Hoare triple {14615#true} call #t~ret9 := is_do_read_c_triggered(); {14615#true} is VALID [2022-02-20 19:58:53,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {14615#true} havoc ~__retres1~1; {14615#true} is VALID [2022-02-20 19:58:53,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {14615#true} assume !(1 == ~c_dr_pc~0); {14615#true} is VALID [2022-02-20 19:58:53,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {14615#true} ~__retres1~1 := 0; {14671#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:53,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {14671#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:53,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:53,813 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14672#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {14615#true} #987#return; {14669#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:53,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {14669#(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; {14670#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:53,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {14670#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14616#false} is VALID [2022-02-20 19:58:53,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {14616#false} assume true; {14616#false} is VALID [2022-02-20 19:58:53,814 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14616#false} {14615#true} #993#return; {14616#false} is VALID [2022-02-20 19:58:53,814 INFO L272 TraceCheckUtils]: 39: Hoare triple {14616#false} call reset_delta_events1(); {14655#(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:53,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {14655#(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); {14615#true} is VALID [2022-02-20 19:58:53,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {14615#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {14615#true} is VALID [2022-02-20 19:58:53,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,815 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14615#true} {14616#false} #995#return; {14616#false} is VALID [2022-02-20 19:58:53,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {14616#false} assume !false; {14616#false} is VALID [2022-02-20 19:58:53,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {14616#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; {14616#false} is VALID [2022-02-20 19:58:53,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {14616#false} assume !false; {14616#false} is VALID [2022-02-20 19:58:53,815 INFO L272 TraceCheckUtils]: 47: Hoare triple {14616#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14615#true} is VALID [2022-02-20 19:58:53,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {14615#true} havoc ~__retres1~2; {14615#true} is VALID [2022-02-20 19:58:53,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {14615#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14615#true} is VALID [2022-02-20 19:58:53,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {14615#true} #res := ~__retres1~2; {14615#true} is VALID [2022-02-20 19:58:53,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {14615#true} assume true; {14615#true} is VALID [2022-02-20 19:58:53,816 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14615#true} {14616#false} #997#return; {14616#false} is VALID [2022-02-20 19:58:53,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {14616#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; {14616#false} is VALID [2022-02-20 19:58:53,816 INFO L290 TraceCheckUtils]: 54: Hoare triple {14616#false} assume 0 != eval1_~tmp___1~0#1; {14616#false} is VALID [2022-02-20 19:58:53,816 INFO L290 TraceCheckUtils]: 55: Hoare triple {14616#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; {14616#false} is VALID [2022-02-20 19:58:53,816 INFO L290 TraceCheckUtils]: 56: Hoare triple {14616#false} assume !(0 != eval1_~tmp~2#1); {14616#false} is VALID [2022-02-20 19:58:53,817 INFO L272 TraceCheckUtils]: 57: Hoare triple {14616#false} call error1(); {14616#false} is VALID [2022-02-20 19:58:53,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {14616#false} assume !false; {14616#false} is VALID [2022-02-20 19:58:53,817 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:53,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:53,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582082627] [2022-02-20 19:58:53,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582082627] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:53,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:53,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:53,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009955572] [2022-02-20 19:58:53,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:53,818 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,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:53,819 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:53,852 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:53,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:53,852 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:53,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:53,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:53,853 INFO L87 Difference]: Start difference. First operand 1044 states and 1412 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:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,170 INFO L93 Difference]: Finished difference Result 2009 states and 2687 transitions. [2022-02-20 19:58:56,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:56,170 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:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:56,172 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:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 558 transitions. [2022-02-20 19:58:56,175 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:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 558 transitions. [2022-02-20 19:58:56,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 558 transitions. [2022-02-20 19:58:56,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:56,606 INFO L225 Difference]: With dead ends: 2009 [2022-02-20 19:58:56,606 INFO L226 Difference]: Without dead ends: 1152 [2022-02-20 19:58:56,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:56,612 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 489 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:56,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1558 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:58:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-02-20 19:58:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1094. [2022-02-20 19:58:56,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:56,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1152 states. Second operand has 1094 states, 873 states have (on average 1.3699885452462772) internal successors, (1196), 894 states have internal predecessors, (1196), 111 states have call successors, (111), 81 states have call predecessors, (111), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) [2022-02-20 19:58:56,675 INFO L74 IsIncluded]: Start isIncluded. First operand 1152 states. Second operand has 1094 states, 873 states have (on average 1.3699885452462772) internal successors, (1196), 894 states have internal predecessors, (1196), 111 states have call successors, (111), 81 states have call predecessors, (111), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) [2022-02-20 19:58:56,677 INFO L87 Difference]: Start difference. First operand 1152 states. Second operand has 1094 states, 873 states have (on average 1.3699885452462772) internal successors, (1196), 894 states have internal predecessors, (1196), 111 states have call successors, (111), 81 states have call predecessors, (111), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) [2022-02-20 19:58:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,720 INFO L93 Difference]: Finished difference Result 1152 states and 1534 transitions. [2022-02-20 19:58:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1534 transitions. [2022-02-20 19:58:56,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:56,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:56,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 1094 states, 873 states have (on average 1.3699885452462772) internal successors, (1196), 894 states have internal predecessors, (1196), 111 states have call successors, (111), 81 states have call predecessors, (111), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) Second operand 1152 states. [2022-02-20 19:58:56,725 INFO L87 Difference]: Start difference. First operand has 1094 states, 873 states have (on average 1.3699885452462772) internal successors, (1196), 894 states have internal predecessors, (1196), 111 states have call successors, (111), 81 states have call predecessors, (111), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) Second operand 1152 states. [2022-02-20 19:58:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:56,770 INFO L93 Difference]: Finished difference Result 1152 states and 1534 transitions. [2022-02-20 19:58:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1534 transitions. [2022-02-20 19:58:56,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:56,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:56,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:56,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 873 states have (on average 1.3699885452462772) internal successors, (1196), 894 states have internal predecessors, (1196), 111 states have call successors, (111), 81 states have call predecessors, (111), 108 states have return successors, (155), 121 states have call predecessors, (155), 108 states have call successors, (155) [2022-02-20 19:58:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1462 transitions. [2022-02-20 19:58:56,840 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1462 transitions. Word has length 59 [2022-02-20 19:58:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:56,840 INFO L470 AbstractCegarLoop]: Abstraction has 1094 states and 1462 transitions. [2022-02-20 19:58:56,841 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:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1462 transitions. [2022-02-20 19:58:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:58:56,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:56,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:56,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:56,843 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1874262792, now seen corresponding path program 1 times [2022-02-20 19:58:56,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:56,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467760670] [2022-02-20 19:58:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {21204#(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); {21205#(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:56,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {21205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {21205#(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:56,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {21166#(= ~q_write_ev~0 ~q_read_ev~0)} #989#return; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {21205#(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); {21205#(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:56,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {21205#(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); {21205#(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:56,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {21205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {21205#(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:56,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {21166#(= ~q_write_ev~0 ~q_read_ev~0)} #991#return; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {21164#true} havoc ~__retres1~0; {21164#true} is VALID [2022-02-20 19:58:56,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {21164#true} assume !(1 == ~p_dw_pc~0); {21164#true} is VALID [2022-02-20 19:58:56,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {21164#true} ~__retres1~0 := 0; {21164#true} is VALID [2022-02-20 19:58:56,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {21164#true} #res := ~__retres1~0; {21164#true} is VALID [2022-02-20 19:58:56,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,927 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21164#true} {21164#true} #985#return; {21164#true} is VALID [2022-02-20 19:58:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {21164#true} havoc ~__retres1~1; {21164#true} is VALID [2022-02-20 19:58:56,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {21164#true} assume !(1 == ~c_dr_pc~0); {21164#true} is VALID [2022-02-20 19:58:56,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {21164#true} ~__retres1~1 := 0; {21164#true} is VALID [2022-02-20 19:58:56,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {21164#true} #res := ~__retres1~1; {21164#true} is VALID [2022-02-20 19:58:56,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,932 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21164#true} {21164#true} #987#return; {21164#true} is VALID [2022-02-20 19:58:56,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {21206#(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; {21164#true} is VALID [2022-02-20 19:58:56,932 INFO L272 TraceCheckUtils]: 1: Hoare triple {21164#true} call #t~ret8 := is_do_write_p_triggered(); {21164#true} is VALID [2022-02-20 19:58:56,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {21164#true} havoc ~__retres1~0; {21164#true} is VALID [2022-02-20 19:58:56,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {21164#true} assume !(1 == ~p_dw_pc~0); {21164#true} is VALID [2022-02-20 19:58:56,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {21164#true} ~__retres1~0 := 0; {21164#true} is VALID [2022-02-20 19:58:56,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {21164#true} #res := ~__retres1~0; {21164#true} is VALID [2022-02-20 19:58:56,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,933 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21164#true} {21164#true} #985#return; {21164#true} is VALID [2022-02-20 19:58:56,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {21164#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21164#true} is VALID [2022-02-20 19:58:56,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {21164#true} assume !(0 != ~tmp~1); {21164#true} is VALID [2022-02-20 19:58:56,933 INFO L272 TraceCheckUtils]: 10: Hoare triple {21164#true} call #t~ret9 := is_do_read_c_triggered(); {21164#true} is VALID [2022-02-20 19:58:56,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {21164#true} havoc ~__retres1~1; {21164#true} is VALID [2022-02-20 19:58:56,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {21164#true} assume !(1 == ~c_dr_pc~0); {21164#true} is VALID [2022-02-20 19:58:56,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {21164#true} ~__retres1~1 := 0; {21164#true} is VALID [2022-02-20 19:58:56,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {21164#true} #res := ~__retres1~1; {21164#true} is VALID [2022-02-20 19:58:56,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,934 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21164#true} {21164#true} #987#return; {21164#true} is VALID [2022-02-20 19:58:56,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {21164#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21164#true} is VALID [2022-02-20 19:58:56,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {21164#true} assume !(0 != ~tmp___0~1); {21164#true} is VALID [2022-02-20 19:58:56,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,935 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21164#true} {21166#(= ~q_write_ev~0 ~q_read_ev~0)} #993#return; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {21205#(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); {21219#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:56,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {21219#(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; {21220#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:56,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {21220#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {21220#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:56,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21220#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {21166#(= ~q_write_ev~0 ~q_read_ev~0)} #995#return; {21165#false} is VALID [2022-02-20 19:58:56,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:56,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {21164#true} havoc ~__retres1~2; {21164#true} is VALID [2022-02-20 19:58:56,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {21164#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21164#true} is VALID [2022-02-20 19:58:56,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {21164#true} #res := ~__retres1~2; {21164#true} is VALID [2022-02-20 19:58:56,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,959 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21164#true} {21165#false} #997#return; {21165#false} is VALID [2022-02-20 19:58:56,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {21164#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~token~0 := 0;~local~0 := 0; {21164#true} is VALID [2022-02-20 19:58:56,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {21164#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1;assume -2147483648 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 2147483647; {21164#true} is VALID [2022-02-20 19:58:56,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {21164#true} assume 0 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {21166#(= ~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; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {21166#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {21204#(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:56,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {21204#(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); {21205#(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:56,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {21205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {21205#(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:56,961 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {21166#(= ~q_write_ev~0 ~q_read_ev~0)} #989#return; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {21166#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {21166#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {21166#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {21166#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,963 INFO L272 TraceCheckUtils]: 12: Hoare triple {21166#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {21205#(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:56,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {21205#(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); {21205#(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:56,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {21205#(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); {21205#(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:56,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {21205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {21205#(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:56,965 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21205#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {21166#(= ~q_write_ev~0 ~q_read_ev~0)} #991#return; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,965 INFO L272 TraceCheckUtils]: 17: Hoare triple {21166#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {21206#(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:56,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {21206#(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; {21164#true} is VALID [2022-02-20 19:58:56,965 INFO L272 TraceCheckUtils]: 19: Hoare triple {21164#true} call #t~ret8 := is_do_write_p_triggered(); {21164#true} is VALID [2022-02-20 19:58:56,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {21164#true} havoc ~__retres1~0; {21164#true} is VALID [2022-02-20 19:58:56,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {21164#true} assume !(1 == ~p_dw_pc~0); {21164#true} is VALID [2022-02-20 19:58:56,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {21164#true} ~__retres1~0 := 0; {21164#true} is VALID [2022-02-20 19:58:56,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {21164#true} #res := ~__retres1~0; {21164#true} is VALID [2022-02-20 19:58:56,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,974 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21164#true} {21164#true} #985#return; {21164#true} is VALID [2022-02-20 19:58:56,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {21164#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21164#true} is VALID [2022-02-20 19:58:56,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {21164#true} assume !(0 != ~tmp~1); {21164#true} is VALID [2022-02-20 19:58:56,975 INFO L272 TraceCheckUtils]: 28: Hoare triple {21164#true} call #t~ret9 := is_do_read_c_triggered(); {21164#true} is VALID [2022-02-20 19:58:56,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {21164#true} havoc ~__retres1~1; {21164#true} is VALID [2022-02-20 19:58:56,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {21164#true} assume !(1 == ~c_dr_pc~0); {21164#true} is VALID [2022-02-20 19:58:56,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {21164#true} ~__retres1~1 := 0; {21164#true} is VALID [2022-02-20 19:58:56,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {21164#true} #res := ~__retres1~1; {21164#true} is VALID [2022-02-20 19:58:56,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,976 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21164#true} {21164#true} #987#return; {21164#true} is VALID [2022-02-20 19:58:56,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {21164#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21164#true} is VALID [2022-02-20 19:58:56,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {21164#true} assume !(0 != ~tmp___0~1); {21164#true} is VALID [2022-02-20 19:58:56,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,977 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21164#true} {21166#(= ~q_write_ev~0 ~q_read_ev~0)} #993#return; {21166#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:56,977 INFO L272 TraceCheckUtils]: 39: Hoare triple {21166#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {21205#(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:56,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {21205#(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); {21219#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:56,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {21219#(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; {21220#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:56,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {21220#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {21220#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:56,978 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21220#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {21166#(= ~q_write_ev~0 ~q_read_ev~0)} #995#return; {21165#false} is VALID [2022-02-20 19:58:56,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {21165#false} assume !false; {21165#false} is VALID [2022-02-20 19:58:56,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {21165#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; {21165#false} is VALID [2022-02-20 19:58:56,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {21165#false} assume !false; {21165#false} is VALID [2022-02-20 19:58:56,979 INFO L272 TraceCheckUtils]: 47: Hoare triple {21165#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {21164#true} is VALID [2022-02-20 19:58:56,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {21164#true} havoc ~__retres1~2; {21164#true} is VALID [2022-02-20 19:58:56,979 INFO L290 TraceCheckUtils]: 49: Hoare triple {21164#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21164#true} is VALID [2022-02-20 19:58:56,979 INFO L290 TraceCheckUtils]: 50: Hoare triple {21164#true} #res := ~__retres1~2; {21164#true} is VALID [2022-02-20 19:58:56,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {21164#true} assume true; {21164#true} is VALID [2022-02-20 19:58:56,979 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21164#true} {21165#false} #997#return; {21165#false} is VALID [2022-02-20 19:58:56,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {21165#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; {21165#false} is VALID [2022-02-20 19:58:56,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {21165#false} assume 0 != eval1_~tmp___1~0#1; {21165#false} is VALID [2022-02-20 19:58:56,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {21165#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; {21165#false} is VALID [2022-02-20 19:58:56,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {21165#false} assume !(0 != eval1_~tmp~2#1); {21165#false} is VALID [2022-02-20 19:58:56,980 INFO L272 TraceCheckUtils]: 57: Hoare triple {21165#false} call error1(); {21165#false} is VALID [2022-02-20 19:58:56,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {21165#false} assume !false; {21165#false} is VALID [2022-02-20 19:58:56,980 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:56,981 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:56,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467760670] [2022-02-20 19:58:56,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467760670] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:56,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:56,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:56,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603528438] [2022-02-20 19:58:56,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:56,982 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:56,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:56,984 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:57,016 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:57,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:57,016 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:57,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:57,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:57,017 INFO L87 Difference]: Start difference. First operand 1094 states and 1462 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:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:59,467 INFO L93 Difference]: Finished difference Result 1934 states and 2543 transitions. [2022-02-20 19:58:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 19:58:59,468 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:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:59,468 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:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 743 transitions. [2022-02-20 19:58:59,473 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:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 743 transitions. [2022-02-20 19:58:59,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 743 transitions. [2022-02-20 19:58:59,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 743 edges. 743 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:00,066 INFO L225 Difference]: With dead ends: 1934 [2022-02-20 19:59:00,067 INFO L226 Difference]: Without dead ends: 1267 [2022-02-20 19:59:00,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-02-20 19:59:00,068 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 1001 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:00,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1022 Valid, 1188 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:59:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-02-20 19:59:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1110. [2022-02-20 19:59:00,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:00,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1267 states. Second operand has 1110 states, 885 states have (on average 1.3615819209039548) internal successors, (1205), 908 states have internal predecessors, (1205), 113 states have call successors, (113), 83 states have call predecessors, (113), 110 states have return successors, (159), 121 states have call predecessors, (159), 110 states have call successors, (159) [2022-02-20 19:59:00,172 INFO L74 IsIncluded]: Start isIncluded. First operand 1267 states. Second operand has 1110 states, 885 states have (on average 1.3615819209039548) internal successors, (1205), 908 states have internal predecessors, (1205), 113 states have call successors, (113), 83 states have call predecessors, (113), 110 states have return successors, (159), 121 states have call predecessors, (159), 110 states have call successors, (159) [2022-02-20 19:59:00,174 INFO L87 Difference]: Start difference. First operand 1267 states. Second operand has 1110 states, 885 states have (on average 1.3615819209039548) internal successors, (1205), 908 states have internal predecessors, (1205), 113 states have call successors, (113), 83 states have call predecessors, (113), 110 states have return successors, (159), 121 states have call predecessors, (159), 110 states have call successors, (159) [2022-02-20 19:59:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:00,266 INFO L93 Difference]: Finished difference Result 1267 states and 1663 transitions. [2022-02-20 19:59:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1663 transitions. [2022-02-20 19:59:00,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:00,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:00,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 1110 states, 885 states have (on average 1.3615819209039548) internal successors, (1205), 908 states have internal predecessors, (1205), 113 states have call successors, (113), 83 states have call predecessors, (113), 110 states have return successors, (159), 121 states have call predecessors, (159), 110 states have call successors, (159) Second operand 1267 states. [2022-02-20 19:59:00,272 INFO L87 Difference]: Start difference. First operand has 1110 states, 885 states have (on average 1.3615819209039548) internal successors, (1205), 908 states have internal predecessors, (1205), 113 states have call successors, (113), 83 states have call predecessors, (113), 110 states have return successors, (159), 121 states have call predecessors, (159), 110 states have call successors, (159) Second operand 1267 states. [2022-02-20 19:59:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:00,325 INFO L93 Difference]: Finished difference Result 1267 states and 1663 transitions. [2022-02-20 19:59:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1663 transitions. [2022-02-20 19:59:00,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:00,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:00,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:00,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 885 states have (on average 1.3615819209039548) internal successors, (1205), 908 states have internal predecessors, (1205), 113 states have call successors, (113), 83 states have call predecessors, (113), 110 states have return successors, (159), 121 states have call predecessors, (159), 110 states have call successors, (159) [2022-02-20 19:59:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1477 transitions. [2022-02-20 19:59:00,392 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1477 transitions. Word has length 59 [2022-02-20 19:59:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:00,392 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1477 transitions. [2022-02-20 19:59:00,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:59:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1477 transitions. [2022-02-20 19:59:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:00,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:00,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:00,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:59:00,394 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:00,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:00,395 INFO L85 PathProgramCache]: Analyzing trace with hash -119881914, now seen corresponding path program 1 times [2022-02-20 19:59:00,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:00,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969612417] [2022-02-20 19:59:00,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:00,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:00,415 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:00,444 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:59:00,445 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:00,445 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:00,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:00,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:00,449 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 19:59:00,451 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:00,489 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:00,490 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:00,495 INFO L158 Benchmark]: Toolchain (without parser) took 21819.98ms. Allocated memory was 119.5MB in the beginning and 358.6MB in the end (delta: 239.1MB). Free memory was 82.1MB in the beginning and 258.6MB in the end (delta: -176.6MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:00,495 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:00,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.26ms. Allocated memory is still 119.5MB. Free memory was 81.9MB in the beginning and 85.0MB in the end (delta: -3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:00,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.03ms. Allocated memory is still 119.5MB. Free memory was 85.0MB in the beginning and 80.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:00,496 INFO L158 Benchmark]: Boogie Preprocessor took 35.95ms. Allocated memory is still 119.5MB. Free memory was 80.8MB in the beginning and 78.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:00,496 INFO L158 Benchmark]: RCFGBuilder took 753.97ms. Allocated memory is still 119.5MB. Free memory was 77.6MB in the beginning and 85.8MB in the end (delta: -8.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-02-20 19:59:00,496 INFO L158 Benchmark]: TraceAbstraction took 20548.46ms. Allocated memory was 119.5MB in the beginning and 358.6MB in the end (delta: 239.1MB). Free memory was 85.2MB in the beginning and 258.6MB in the end (delta: -173.4MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:00,497 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.15ms. Allocated memory is still 119.5MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.26ms. Allocated memory is still 119.5MB. Free memory was 81.9MB in the beginning and 85.0MB in the end (delta: -3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.03ms. Allocated memory is still 119.5MB. Free memory was 85.0MB in the beginning and 80.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.95ms. Allocated memory is still 119.5MB. Free memory was 80.8MB in the beginning and 78.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 753.97ms. Allocated memory is still 119.5MB. Free memory was 77.6MB in the beginning and 85.8MB in the end (delta: -8.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20548.46ms. Allocated memory was 119.5MB in the beginning and 358.6MB in the end (delta: 239.1MB). Free memory was 85.2MB in the beginning and 258.6MB in the end (delta: -173.4MB). Peak memory consumption was 64.2MB. 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:00,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dee58858bceada86a9d77b57748794a4149b829dcc108044b7fcc9b2fa3dd4d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:59:02,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:59:02,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:59:02,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:59:02,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:59:02,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:59:02,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:59:02,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:59:02,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:59:02,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:59:02,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:59:02,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:59:02,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:59:02,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:59:02,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:59:02,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:59:02,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:59:02,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:59:02,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:59:02,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:59:02,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:59:02,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:59:02,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:59:02,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:59:02,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:59:02,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:59:02,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:59:02,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:59:02,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:59:02,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:59:02,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:59:02,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:59:02,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:59:02,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:59:02,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:59:02,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:59:02,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:59:02,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:59:02,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:59:02,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:59:02,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:59:02,312 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:02,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:59:02,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:59:02,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:59:02,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:59:02,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:59:02,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:59:02,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:59:02,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:59:02,340 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:59:02,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:59:02,341 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:59:02,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:59:02,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:59:02,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:59:02,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:59:02,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:59:02,342 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:59:02,342 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:59:02,342 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:59:02,342 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:59:02,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:59:02,343 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:59:02,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:59:02,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:59:02,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:59:02,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:59:02,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:02,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:59:02,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:59:02,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:59:02,344 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:59:02,344 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:59:02,345 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:59:02,345 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:59:02,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:59:02,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:59:02,345 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 -> 8dee58858bceada86a9d77b57748794a4149b829dcc108044b7fcc9b2fa3dd4d [2022-02-20 19:59:02,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:59:02,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:59:02,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:59:02,650 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:59:02,650 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:59:02,651 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.04.cil-1.c [2022-02-20 19:59:02,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3dc2de6/5e9e456d3ad148e5a8a21927d1b63e5d/FLAGd5a80de87 [2022-02-20 19:59:03,158 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:59:03,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2022-02-20 19:59:03,170 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3dc2de6/5e9e456d3ad148e5a8a21927d1b63e5d/FLAGd5a80de87 [2022-02-20 19:59:03,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3dc2de6/5e9e456d3ad148e5a8a21927d1b63e5d [2022-02-20 19:59:03,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:59:03,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:59:03,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:03,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:59:03,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:59:03,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:03" (1/1) ... [2022-02-20 19:59:03,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa3c0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:03, skipping insertion in model container [2022-02-20 19:59:03,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:59:03" (1/1) ... [2022-02-20 19:59:03,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:59:03,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:59:03,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.04.cil-1.c[914,927] [2022-02-20 19:59:03,429 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.04.cil-1.c[7125,7138] [2022-02-20 19:59:03,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:03,501 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:59:03,512 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.04.cil-1.c[914,927] [2022-02-20 19:59:03,535 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.04.cil-1.c[7125,7138] [2022-02-20 19:59:03,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:59:03,602 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:59:03,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:03 WrapperNode [2022-02-20 19:59:03,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:59:03,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:03,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:59:03,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:59:03,608 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:03" (1/1) ... [2022-02-20 19:59:03,632 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:03" (1/1) ... [2022-02-20 19:59:03,678 INFO L137 Inliner]: procedures = 62, calls = 70, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 554 [2022-02-20 19:59:03,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:59:03,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:59:03,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:59:03,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:59:03,690 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:03" (1/1) ... [2022-02-20 19:59:03,690 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:03" (1/1) ... [2022-02-20 19:59:03,704 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:03" (1/1) ... [2022-02-20 19:59:03,705 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:03" (1/1) ... [2022-02-20 19:59:03,713 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:03" (1/1) ... [2022-02-20 19:59:03,731 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:03" (1/1) ... [2022-02-20 19:59:03,743 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:03" (1/1) ... [2022-02-20 19:59:03,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:59:03,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:59:03,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:59:03,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:59:03,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:03" (1/1) ... [2022-02-20 19:59:03,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:59:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:03,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:59:03,814 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:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:59:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:59:03,829 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:59:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:59:03,829 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:59:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:59:03,830 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:59:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:59:03,830 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:59:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:59:03,830 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:59:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:59:03,830 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:59:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:59:03,830 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:59:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:59:03,831 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:59:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:59:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:59:03,831 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:59:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:59:03,831 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:59:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:59:03,832 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:59:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:59:03,832 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:59:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:59:03,832 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:59:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:59:03,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:59:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:59:03,832 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:59:03,923 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:59:03,924 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:59:04,404 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:59:04,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:59:04,428 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 19:59:04,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:04 BoogieIcfgContainer [2022-02-20 19:59:04,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:59:04,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:59:04,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:59:04,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:59:04,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:59:03" (1/3) ... [2022-02-20 19:59:04,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb8749d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:04, skipping insertion in model container [2022-02-20 19:59:04,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:59:03" (2/3) ... [2022-02-20 19:59:04,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb8749d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:59:04, skipping insertion in model container [2022-02-20 19:59:04,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:59:04" (3/3) ... [2022-02-20 19:59:04,434 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.04.cil-1.c [2022-02-20 19:59:04,437 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:59:04,437 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:59:04,465 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:59:04,469 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:04,469 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:59:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 241 states have internal predecessors, (371), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:59:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:04,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:04,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:04,493 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1988134503, now seen corresponding path program 1 times [2022-02-20 19:59:04,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:04,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505285134] [2022-02-20 19:59:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:04,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:04,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:04,515 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:04,518 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:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 19:59:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:04,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {287#true} is VALID [2022-02-20 19:59:04,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1; {287#true} is VALID [2022-02-20 19:59:04,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume 0bv32 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {298#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {298#(= (_ 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; {298#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {298#(= (_ bv2 32) ~q_write_ev~0)} call update_channels1(); {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(1bv32 == ~q_req_up~0); {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume true; {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,812 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} {298#(= (_ bv2 32) ~q_write_ev~0)} #989#return; {298#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(= (_ bv2 32) ~q_write_ev~0)} assume { :begin_inline_init_threads1 } true; {298#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {298#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {298#(= (_ bv2 32) ~q_write_ev~0)} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {298#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {298#(= (_ bv2 32) ~q_write_ev~0)} assume { :end_inline_init_threads1 } true; {298#(= (_ bv2 32) ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,815 INFO L272 TraceCheckUtils]: 12: Hoare triple {298#(= (_ bv2 32) ~q_write_ev~0)} call fire_delta_events1(); {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume !(0bv32 == ~q_read_ev~0); {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} is VALID [2022-02-20 19:59:04,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#(= |old(~q_write_ev~0)| ~q_write_ev~0)} assume 0bv32 == ~q_write_ev~0;~q_write_ev~0 := 1bv32; {336#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:04,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {336#(= |old(~q_write_ev~0)| (_ bv0 32))} assume true; {336#(= |old(~q_write_ev~0)| (_ bv0 32))} is VALID [2022-02-20 19:59:04,817 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {336#(= |old(~q_write_ev~0)| (_ bv0 32))} {298#(= (_ bv2 32) ~q_write_ev~0)} #991#return; {288#false} is VALID [2022-02-20 19:59:04,817 INFO L272 TraceCheckUtils]: 17: Hoare triple {288#false} call activate_threads1(); {288#false} is VALID [2022-02-20 19:59:04,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {288#false} havoc ~tmp~1;havoc ~tmp___0~1; {288#false} is VALID [2022-02-20 19:59:04,817 INFO L272 TraceCheckUtils]: 19: Hoare triple {288#false} call #t~ret8 := is_do_write_p_triggered(); {288#false} is VALID [2022-02-20 19:59:04,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {288#false} havoc ~__retres1~0; {288#false} is VALID [2022-02-20 19:59:04,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {288#false} assume 1bv32 == ~p_dw_pc~0; {288#false} is VALID [2022-02-20 19:59:04,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {288#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {288#false} is VALID [2022-02-20 19:59:04,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {288#false} #res := ~__retres1~0; {288#false} is VALID [2022-02-20 19:59:04,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {288#false} assume true; {288#false} is VALID [2022-02-20 19:59:04,818 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {288#false} {288#false} #985#return; {288#false} is VALID [2022-02-20 19:59:04,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {288#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {288#false} is VALID [2022-02-20 19:59:04,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {288#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {288#false} is VALID [2022-02-20 19:59:04,819 INFO L272 TraceCheckUtils]: 28: Hoare triple {288#false} call #t~ret9 := is_do_read_c_triggered(); {288#false} is VALID [2022-02-20 19:59:04,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {288#false} havoc ~__retres1~1; {288#false} is VALID [2022-02-20 19:59:04,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {288#false} assume !(1bv32 == ~c_dr_pc~0); {288#false} is VALID [2022-02-20 19:59:04,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {288#false} ~__retres1~1 := 0bv32; {288#false} is VALID [2022-02-20 19:59:04,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {288#false} #res := ~__retres1~1; {288#false} is VALID [2022-02-20 19:59:04,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {288#false} assume true; {288#false} is VALID [2022-02-20 19:59:04,820 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {288#false} {288#false} #987#return; {288#false} is VALID [2022-02-20 19:59:04,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {288#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {288#false} is VALID [2022-02-20 19:59:04,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {288#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {288#false} is VALID [2022-02-20 19:59:04,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {288#false} assume true; {288#false} is VALID [2022-02-20 19:59:04,821 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {288#false} {288#false} #993#return; {288#false} is VALID [2022-02-20 19:59:04,821 INFO L272 TraceCheckUtils]: 39: Hoare triple {288#false} call reset_delta_events1(); {288#false} is VALID [2022-02-20 19:59:04,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {288#false} assume !(1bv32 == ~q_read_ev~0); {288#false} is VALID [2022-02-20 19:59:04,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {288#false} assume 1bv32 == ~q_write_ev~0;~q_write_ev~0 := 2bv32; {288#false} is VALID [2022-02-20 19:59:04,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {288#false} assume true; {288#false} is VALID [2022-02-20 19:59:04,822 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {288#false} {288#false} #995#return; {288#false} is VALID [2022-02-20 19:59:04,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 19:59:04,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {288#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; {288#false} is VALID [2022-02-20 19:59:04,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 19:59:04,823 INFO L272 TraceCheckUtils]: 47: Hoare triple {288#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {288#false} is VALID [2022-02-20 19:59:04,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {288#false} havoc ~__retres1~2; {288#false} is VALID [2022-02-20 19:59:04,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {288#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {288#false} is VALID [2022-02-20 19:59:04,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {288#false} #res := ~__retres1~2; {288#false} is VALID [2022-02-20 19:59:04,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {288#false} assume true; {288#false} is VALID [2022-02-20 19:59:04,824 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {288#false} {288#false} #997#return; {288#false} is VALID [2022-02-20 19:59:04,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {288#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {288#false} is VALID [2022-02-20 19:59:04,824 INFO L290 TraceCheckUtils]: 54: Hoare triple {288#false} assume 0bv32 != eval1_~tmp___1~0#1; {288#false} is VALID [2022-02-20 19:59:04,834 INFO L290 TraceCheckUtils]: 55: Hoare triple {288#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {288#false} is VALID [2022-02-20 19:59:04,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {288#false} assume !(0bv32 != eval1_~tmp~2#1); {288#false} is VALID [2022-02-20 19:59:04,835 INFO L272 TraceCheckUtils]: 57: Hoare triple {288#false} call error1(); {288#false} is VALID [2022-02-20 19:59:04,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 19:59:04,836 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:04,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:04,836 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:04,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505285134] [2022-02-20 19:59:04,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505285134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:04,837 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:04,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:59:04,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986612512] [2022-02-20 19:59:04,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:04,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:04,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:04,845 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:04,888 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:04,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:59:04,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:04,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:59:04,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:59:04,903 INFO L87 Difference]: Start difference. First operand has 284 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 241 states have internal predecessors, (371), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) 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:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:06,374 INFO L93 Difference]: Finished difference Result 651 states and 1002 transitions. [2022-02-20 19:59:06,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:06,374 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,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:06,376 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:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1002 transitions. [2022-02-20 19:59:06,393 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:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1002 transitions. [2022-02-20 19:59:06,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1002 transitions. [2022-02-20 19:59:07,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1002 edges. 1002 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:07,122 INFO L225 Difference]: With dead ends: 651 [2022-02-20 19:59:07,122 INFO L226 Difference]: Without dead ends: 377 [2022-02-20 19:59:07,134 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:07,137 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 313 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:07,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 1056 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:07,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-02-20 19:59:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 370. [2022-02-20 19:59:07,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:07,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 370 states, 302 states have (on average 1.4635761589403973) internal successors, (442), 309 states have internal predecessors, (442), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:59:07,224 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 370 states, 302 states have (on average 1.4635761589403973) internal successors, (442), 309 states have internal predecessors, (442), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:59:07,225 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 370 states, 302 states have (on average 1.4635761589403973) internal successors, (442), 309 states have internal predecessors, (442), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:59:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:07,253 INFO L93 Difference]: Finished difference Result 377 states and 539 transitions. [2022-02-20 19:59:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 539 transitions. [2022-02-20 19:59:07,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:07,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:07,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 370 states, 302 states have (on average 1.4635761589403973) internal successors, (442), 309 states have internal predecessors, (442), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) Second operand 377 states. [2022-02-20 19:59:07,258 INFO L87 Difference]: Start difference. First operand has 370 states, 302 states have (on average 1.4635761589403973) internal successors, (442), 309 states have internal predecessors, (442), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) Second operand 377 states. [2022-02-20 19:59:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:07,270 INFO L93 Difference]: Finished difference Result 377 states and 539 transitions. [2022-02-20 19:59:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 539 transitions. [2022-02-20 19:59:07,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:07,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:07,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:07,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 302 states have (on average 1.4635761589403973) internal successors, (442), 309 states have internal predecessors, (442), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-02-20 19:59:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 532 transitions. [2022-02-20 19:59:07,301 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 532 transitions. Word has length 59 [2022-02-20 19:59:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:07,301 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 532 transitions. [2022-02-20 19:59:07,302 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:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 532 transitions. [2022-02-20 19:59:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:07,303 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:07,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:07,326 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:07,512 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:07,512 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash 887476135, now seen corresponding path program 1 times [2022-02-20 19:59:07,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:07,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339262527] [2022-02-20 19:59:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:07,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:07,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:07,515 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:07,557 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:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:07,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 19:59:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:07,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:07,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {2614#true} is VALID [2022-02-20 19:59:07,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {2614#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1; {2614#true} is VALID [2022-02-20 19:59:07,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {2614#true} assume 0bv32 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0bv32; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} call update_channels1(); {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume !(1bv32 == ~q_req_up~0); {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume true; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,718 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2625#(= ~p_dw_pc~0 (_ bv0 32))} {2625#(= ~p_dw_pc~0 (_ bv0 32))} #989#return; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume { :begin_inline_init_threads1 } true; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume { :end_inline_init_threads1 } true; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,719 INFO L272 TraceCheckUtils]: 12: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} call fire_delta_events1(); {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume !(0bv32 == ~q_read_ev~0); {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume !(0bv32 == ~q_write_ev~0); {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume true; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,721 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2625#(= ~p_dw_pc~0 (_ bv0 32))} {2625#(= ~p_dw_pc~0 (_ bv0 32))} #991#return; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,721 INFO L272 TraceCheckUtils]: 17: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} call activate_threads1(); {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} havoc ~tmp~1;havoc ~tmp___0~1; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,722 INFO L272 TraceCheckUtils]: 19: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} call #t~ret8 := is_do_write_p_triggered(); {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} havoc ~__retres1~0; {2625#(= ~p_dw_pc~0 (_ bv0 32))} is VALID [2022-02-20 19:59:07,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {2625#(= ~p_dw_pc~0 (_ bv0 32))} assume 1bv32 == ~p_dw_pc~0; {2615#false} is VALID [2022-02-20 19:59:07,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {2615#false} assume 1bv32 == ~q_read_ev~0;~__retres1~0 := 1bv32; {2615#false} is VALID [2022-02-20 19:59:07,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {2615#false} #res := ~__retres1~0; {2615#false} is VALID [2022-02-20 19:59:07,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {2615#false} assume true; {2615#false} is VALID [2022-02-20 19:59:07,723 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2615#false} {2625#(= ~p_dw_pc~0 (_ bv0 32))} #985#return; {2615#false} is VALID [2022-02-20 19:59:07,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {2615#false} ~tmp~1 := #t~ret8;havoc #t~ret8; {2615#false} is VALID [2022-02-20 19:59:07,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {2615#false} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {2615#false} is VALID [2022-02-20 19:59:07,724 INFO L272 TraceCheckUtils]: 28: Hoare triple {2615#false} call #t~ret9 := is_do_read_c_triggered(); {2615#false} is VALID [2022-02-20 19:59:07,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {2615#false} havoc ~__retres1~1; {2615#false} is VALID [2022-02-20 19:59:07,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {2615#false} assume !(1bv32 == ~c_dr_pc~0); {2615#false} is VALID [2022-02-20 19:59:07,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {2615#false} ~__retres1~1 := 0bv32; {2615#false} is VALID [2022-02-20 19:59:07,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {2615#false} #res := ~__retres1~1; {2615#false} is VALID [2022-02-20 19:59:07,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {2615#false} assume true; {2615#false} is VALID [2022-02-20 19:59:07,725 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2615#false} {2615#false} #987#return; {2615#false} is VALID [2022-02-20 19:59:07,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {2615#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {2615#false} is VALID [2022-02-20 19:59:07,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {2615#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {2615#false} is VALID [2022-02-20 19:59:07,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {2615#false} assume true; {2615#false} is VALID [2022-02-20 19:59:07,726 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2615#false} {2625#(= ~p_dw_pc~0 (_ bv0 32))} #993#return; {2615#false} is VALID [2022-02-20 19:59:07,726 INFO L272 TraceCheckUtils]: 39: Hoare triple {2615#false} call reset_delta_events1(); {2615#false} is VALID [2022-02-20 19:59:07,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {2615#false} assume !(1bv32 == ~q_read_ev~0); {2615#false} is VALID [2022-02-20 19:59:07,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {2615#false} assume !(1bv32 == ~q_write_ev~0); {2615#false} is VALID [2022-02-20 19:59:07,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {2615#false} assume true; {2615#false} is VALID [2022-02-20 19:59:07,726 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2615#false} {2615#false} #995#return; {2615#false} is VALID [2022-02-20 19:59:07,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2022-02-20 19:59:07,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {2615#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; {2615#false} is VALID [2022-02-20 19:59:07,727 INFO L290 TraceCheckUtils]: 46: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2022-02-20 19:59:07,727 INFO L272 TraceCheckUtils]: 47: Hoare triple {2615#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2615#false} is VALID [2022-02-20 19:59:07,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {2615#false} havoc ~__retres1~2; {2615#false} is VALID [2022-02-20 19:59:07,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {2615#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {2615#false} is VALID [2022-02-20 19:59:07,728 INFO L290 TraceCheckUtils]: 50: Hoare triple {2615#false} #res := ~__retres1~2; {2615#false} is VALID [2022-02-20 19:59:07,728 INFO L290 TraceCheckUtils]: 51: Hoare triple {2615#false} assume true; {2615#false} is VALID [2022-02-20 19:59:07,728 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2615#false} {2615#false} #997#return; {2615#false} is VALID [2022-02-20 19:59:07,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {2615#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {2615#false} is VALID [2022-02-20 19:59:07,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {2615#false} assume 0bv32 != eval1_~tmp___1~0#1; {2615#false} is VALID [2022-02-20 19:59:07,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {2615#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {2615#false} is VALID [2022-02-20 19:59:07,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {2615#false} assume !(0bv32 != eval1_~tmp~2#1); {2615#false} is VALID [2022-02-20 19:59:07,729 INFO L272 TraceCheckUtils]: 57: Hoare triple {2615#false} call error1(); {2615#false} is VALID [2022-02-20 19:59:07,729 INFO L290 TraceCheckUtils]: 58: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2022-02-20 19:59:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:07,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:07,730 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:07,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339262527] [2022-02-20 19:59:07,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339262527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:07,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:07,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:59:07,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119458300] [2022-02-20 19:59:07,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:07,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:07,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:07,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:07,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:07,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:59:07,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:59:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:07,775 INFO L87 Difference]: Start difference. First operand 370 states and 532 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,111 INFO L93 Difference]: Finished difference Result 718 states and 1001 transitions. [2022-02-20 19:59:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:59:08,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-02-20 19:59:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2022-02-20 19:59:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2022-02-20 19:59:08,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 632 transitions. [2022-02-20 19:59:08,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:08,566 INFO L225 Difference]: With dead ends: 718 [2022-02-20 19:59:08,566 INFO L226 Difference]: Without dead ends: 540 [2022-02-20 19:59:08,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:59:08,568 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 372 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:08,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [372 Valid, 525 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:59:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-02-20 19:59:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 529. [2022-02-20 19:59:08,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:08,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 529 states, 429 states have (on average 1.4335664335664335) internal successors, (615), 438 states have internal predecessors, (615), 60 states have call successors, (60), 35 states have call predecessors, (60), 38 states have return successors, (65), 58 states have call predecessors, (65), 57 states have call successors, (65) [2022-02-20 19:59:08,588 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 529 states, 429 states have (on average 1.4335664335664335) internal successors, (615), 438 states have internal predecessors, (615), 60 states have call successors, (60), 35 states have call predecessors, (60), 38 states have return successors, (65), 58 states have call predecessors, (65), 57 states have call successors, (65) [2022-02-20 19:59:08,589 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 529 states, 429 states have (on average 1.4335664335664335) internal successors, (615), 438 states have internal predecessors, (615), 60 states have call successors, (60), 35 states have call predecessors, (60), 38 states have return successors, (65), 58 states have call predecessors, (65), 57 states have call successors, (65) [2022-02-20 19:59:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,605 INFO L93 Difference]: Finished difference Result 540 states and 752 transitions. [2022-02-20 19:59:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 752 transitions. [2022-02-20 19:59:08,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:08,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:08,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 529 states, 429 states have (on average 1.4335664335664335) internal successors, (615), 438 states have internal predecessors, (615), 60 states have call successors, (60), 35 states have call predecessors, (60), 38 states have return successors, (65), 58 states have call predecessors, (65), 57 states have call successors, (65) Second operand 540 states. [2022-02-20 19:59:08,609 INFO L87 Difference]: Start difference. First operand has 529 states, 429 states have (on average 1.4335664335664335) internal successors, (615), 438 states have internal predecessors, (615), 60 states have call successors, (60), 35 states have call predecessors, (60), 38 states have return successors, (65), 58 states have call predecessors, (65), 57 states have call successors, (65) Second operand 540 states. [2022-02-20 19:59:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,626 INFO L93 Difference]: Finished difference Result 540 states and 752 transitions. [2022-02-20 19:59:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 752 transitions. [2022-02-20 19:59:08,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:08,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:08,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:08,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 429 states have (on average 1.4335664335664335) internal successors, (615), 438 states have internal predecessors, (615), 60 states have call successors, (60), 35 states have call predecessors, (60), 38 states have return successors, (65), 58 states have call predecessors, (65), 57 states have call successors, (65) [2022-02-20 19:59:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 740 transitions. [2022-02-20 19:59:08,646 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 740 transitions. Word has length 59 [2022-02-20 19:59:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:08,646 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 740 transitions. [2022-02-20 19:59:08,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:59:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 740 transitions. [2022-02-20 19:59:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:08,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:08,647 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,666 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:08,856 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:08,857 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:08,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1410796806, now seen corresponding path program 1 times [2022-02-20 19:59:08,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:08,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705757579] [2022-02-20 19:59:08,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:08,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:08,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:08,860 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:08,891 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:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:08,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:09,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {5571#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {5571#true} is VALID [2022-02-20 19:59:09,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1; {5571#true} is VALID [2022-02-20 19:59:09,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {5571#true} assume 0bv32 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {5571#true} is VALID [2022-02-20 19:59:09,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {5571#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; {5571#true} is VALID [2022-02-20 19:59:09,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {5571#true} call update_channels1(); {5571#true} is VALID [2022-02-20 19:59:09,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {5571#true} assume !(1bv32 == ~q_req_up~0); {5571#true} is VALID [2022-02-20 19:59:09,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-02-20 19:59:09,071 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5571#true} {5571#true} #989#return; {5571#true} is VALID [2022-02-20 19:59:09,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {5571#true} assume { :begin_inline_init_threads1 } true; {5571#true} is VALID [2022-02-20 19:59:09,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {5571#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {5571#true} is VALID [2022-02-20 19:59:09,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {5571#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {5571#true} is VALID [2022-02-20 19:59:09,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {5571#true} assume { :end_inline_init_threads1 } true; {5571#true} is VALID [2022-02-20 19:59:09,072 INFO L272 TraceCheckUtils]: 12: Hoare triple {5571#true} call fire_delta_events1(); {5571#true} is VALID [2022-02-20 19:59:09,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {5571#true} assume !(0bv32 == ~q_read_ev~0); {5571#true} is VALID [2022-02-20 19:59:09,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {5571#true} assume !(0bv32 == ~q_write_ev~0); {5571#true} is VALID [2022-02-20 19:59:09,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-02-20 19:59:09,073 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5571#true} {5571#true} #991#return; {5571#true} is VALID [2022-02-20 19:59:09,073 INFO L272 TraceCheckUtils]: 17: Hoare triple {5571#true} call activate_threads1(); {5571#true} is VALID [2022-02-20 19:59:09,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {5571#true} havoc ~tmp~1;havoc ~tmp___0~1; {5571#true} is VALID [2022-02-20 19:59:09,073 INFO L272 TraceCheckUtils]: 19: Hoare triple {5571#true} call #t~ret8 := is_do_write_p_triggered(); {5571#true} is VALID [2022-02-20 19:59:09,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {5571#true} havoc ~__retres1~0; {5571#true} is VALID [2022-02-20 19:59:09,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#true} assume !(1bv32 == ~p_dw_pc~0); {5571#true} is VALID [2022-02-20 19:59:09,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {5571#true} ~__retres1~0 := 0bv32; {5642#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} is VALID [2022-02-20 19:59:09,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {5642#(= (_ bv0 32) is_do_write_p_triggered_~__retres1~0)} #res := ~__retres1~0; {5646#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:09,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {5646#(= |is_do_write_p_triggered_#res| (_ bv0 32))} assume true; {5646#(= |is_do_write_p_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:09,076 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5646#(= |is_do_write_p_triggered_#res| (_ bv0 32))} {5571#true} #985#return; {5653#(= (_ bv0 32) |activate_threads1_#t~ret8|)} is VALID [2022-02-20 19:59:09,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {5653#(= (_ bv0 32) |activate_threads1_#t~ret8|)} ~tmp~1 := #t~ret8;havoc #t~ret8; {5657#(= activate_threads1_~tmp~1 (_ bv0 32))} is VALID [2022-02-20 19:59:09,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {5657#(= activate_threads1_~tmp~1 (_ bv0 32))} assume 0bv32 != ~tmp~1;~p_dw_st~0 := 0bv32; {5572#false} is VALID [2022-02-20 19:59:09,077 INFO L272 TraceCheckUtils]: 28: Hoare triple {5572#false} call #t~ret9 := is_do_read_c_triggered(); {5572#false} is VALID [2022-02-20 19:59:09,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {5572#false} havoc ~__retres1~1; {5572#false} is VALID [2022-02-20 19:59:09,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {5572#false} assume !(1bv32 == ~c_dr_pc~0); {5572#false} is VALID [2022-02-20 19:59:09,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {5572#false} ~__retres1~1 := 0bv32; {5572#false} is VALID [2022-02-20 19:59:09,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {5572#false} #res := ~__retres1~1; {5572#false} is VALID [2022-02-20 19:59:09,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {5572#false} assume true; {5572#false} is VALID [2022-02-20 19:59:09,078 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5572#false} {5572#false} #987#return; {5572#false} is VALID [2022-02-20 19:59:09,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {5572#false} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {5572#false} is VALID [2022-02-20 19:59:09,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {5572#false} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {5572#false} is VALID [2022-02-20 19:59:09,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {5572#false} assume true; {5572#false} is VALID [2022-02-20 19:59:09,078 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5572#false} {5571#true} #993#return; {5572#false} is VALID [2022-02-20 19:59:09,078 INFO L272 TraceCheckUtils]: 39: Hoare triple {5572#false} call reset_delta_events1(); {5572#false} is VALID [2022-02-20 19:59:09,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {5572#false} assume !(1bv32 == ~q_read_ev~0); {5572#false} is VALID [2022-02-20 19:59:09,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {5572#false} assume !(1bv32 == ~q_write_ev~0); {5572#false} is VALID [2022-02-20 19:59:09,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {5572#false} assume true; {5572#false} is VALID [2022-02-20 19:59:09,079 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5572#false} {5572#false} #995#return; {5572#false} is VALID [2022-02-20 19:59:09,079 INFO L290 TraceCheckUtils]: 44: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-02-20 19:59:09,079 INFO L290 TraceCheckUtils]: 45: Hoare triple {5572#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; {5572#false} is VALID [2022-02-20 19:59:09,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-02-20 19:59:09,080 INFO L272 TraceCheckUtils]: 47: Hoare triple {5572#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5572#false} is VALID [2022-02-20 19:59:09,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {5572#false} havoc ~__retres1~2; {5572#false} is VALID [2022-02-20 19:59:09,080 INFO L290 TraceCheckUtils]: 49: Hoare triple {5572#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {5572#false} is VALID [2022-02-20 19:59:09,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {5572#false} #res := ~__retres1~2; {5572#false} is VALID [2022-02-20 19:59:09,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {5572#false} assume true; {5572#false} is VALID [2022-02-20 19:59:09,081 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5572#false} {5572#false} #997#return; {5572#false} is VALID [2022-02-20 19:59:09,081 INFO L290 TraceCheckUtils]: 53: Hoare triple {5572#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {5572#false} is VALID [2022-02-20 19:59:09,081 INFO L290 TraceCheckUtils]: 54: Hoare triple {5572#false} assume 0bv32 != eval1_~tmp___1~0#1; {5572#false} is VALID [2022-02-20 19:59:09,081 INFO L290 TraceCheckUtils]: 55: Hoare triple {5572#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {5572#false} is VALID [2022-02-20 19:59:09,081 INFO L290 TraceCheckUtils]: 56: Hoare triple {5572#false} assume !(0bv32 != eval1_~tmp~2#1); {5572#false} is VALID [2022-02-20 19:59:09,081 INFO L272 TraceCheckUtils]: 57: Hoare triple {5572#false} call error1(); {5572#false} is VALID [2022-02-20 19:59:09,082 INFO L290 TraceCheckUtils]: 58: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-02-20 19:59:09,082 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,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:09,082 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:09,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705757579] [2022-02-20 19:59:09,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705757579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:09,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:09,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:09,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698877086] [2022-02-20 19:59:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:09,084 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,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:09,084 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,123 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,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:09,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:09,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:09,124 INFO L87 Difference]: Start difference. First operand 529 states and 740 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,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,009 INFO L93 Difference]: Finished difference Result 886 states and 1219 transitions. [2022-02-20 19:59:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:10,009 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,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:10,010 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,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 533 transitions. [2022-02-20 19:59:10,015 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,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 533 transitions. [2022-02-20 19:59:10,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 533 transitions. [2022-02-20 19:59:10,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 533 edges. 533 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:10,390 INFO L225 Difference]: With dead ends: 886 [2022-02-20 19:59:10,391 INFO L226 Difference]: Without dead ends: 549 [2022-02-20 19:59:10,391 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,392 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 7 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1989 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,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1989 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,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-02-20 19:59:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 539. [2022-02-20 19:59:10,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:10,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 549 states. Second operand has 539 states, 437 states have (on average 1.4210526315789473) internal successors, (621), 446 states have internal predecessors, (621), 60 states have call successors, (60), 35 states have call predecessors, (60), 40 states have return successors, (67), 60 states have call predecessors, (67), 57 states have call successors, (67) [2022-02-20 19:59:10,408 INFO L74 IsIncluded]: Start isIncluded. First operand 549 states. Second operand has 539 states, 437 states have (on average 1.4210526315789473) internal successors, (621), 446 states have internal predecessors, (621), 60 states have call successors, (60), 35 states have call predecessors, (60), 40 states have return successors, (67), 60 states have call predecessors, (67), 57 states have call successors, (67) [2022-02-20 19:59:10,409 INFO L87 Difference]: Start difference. First operand 549 states. Second operand has 539 states, 437 states have (on average 1.4210526315789473) internal successors, (621), 446 states have internal predecessors, (621), 60 states have call successors, (60), 35 states have call predecessors, (60), 40 states have return successors, (67), 60 states have call predecessors, (67), 57 states have call successors, (67) [2022-02-20 19:59:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,423 INFO L93 Difference]: Finished difference Result 549 states and 762 transitions. [2022-02-20 19:59:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 762 transitions. [2022-02-20 19:59:10,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 539 states, 437 states have (on average 1.4210526315789473) internal successors, (621), 446 states have internal predecessors, (621), 60 states have call successors, (60), 35 states have call predecessors, (60), 40 states have return successors, (67), 60 states have call predecessors, (67), 57 states have call successors, (67) Second operand 549 states. [2022-02-20 19:59:10,426 INFO L87 Difference]: Start difference. First operand has 539 states, 437 states have (on average 1.4210526315789473) internal successors, (621), 446 states have internal predecessors, (621), 60 states have call successors, (60), 35 states have call predecessors, (60), 40 states have return successors, (67), 60 states have call predecessors, (67), 57 states have call successors, (67) Second operand 549 states. [2022-02-20 19:59:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,440 INFO L93 Difference]: Finished difference Result 549 states and 762 transitions. [2022-02-20 19:59:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 762 transitions. [2022-02-20 19:59:10,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:10,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 437 states have (on average 1.4210526315789473) internal successors, (621), 446 states have internal predecessors, (621), 60 states have call successors, (60), 35 states have call predecessors, (60), 40 states have return successors, (67), 60 states have call predecessors, (67), 57 states have call successors, (67) [2022-02-20 19:59:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 748 transitions. [2022-02-20 19:59:10,459 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 748 transitions. Word has length 59 [2022-02-20 19:59:10,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:10,460 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 748 transitions. [2022-02-20 19:59:10,460 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,460 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 748 transitions. [2022-02-20 19:59:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:10,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:10,461 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,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 19:59:10,669 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:10,669 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:10,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1685556420, now seen corresponding path program 1 times [2022-02-20 19:59:10,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:10,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935451903] [2022-02-20 19:59:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:10,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:10,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:10,672 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:10,673 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:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 19:59:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:10,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:10,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {8782#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~q_buf_0~0 := 0bv32;~q_free~0 := 0bv32;~q_read_ev~0 := 0bv32;~q_write_ev~0 := 0bv32;~q_req_up~0 := 0bv32;~q_ev~0 := 0bv32;~p_num_write~0 := 0bv32;~p_last_write~0 := 0bv32;~p_dw_st~0 := 0bv32;~p_dw_pc~0 := 0bv32;~p_dw_i~0 := 0bv32;~c_num_read~0 := 0bv32;~c_last_read~0 := 0bv32;~c_dr_st~0 := 0bv32;~c_dr_pc~0 := 0bv32;~c_dr_i~0 := 0bv32;~a_t~0 := 0bv32;~m_pc~0 := 0bv32;~t1_pc~0 := 0bv32;~t2_pc~0 := 0bv32;~t3_pc~0 := 0bv32;~t4_pc~0 := 0bv32;~m_st~0 := 0bv32;~t1_st~0 := 0bv32;~t2_st~0 := 0bv32;~t3_st~0 := 0bv32;~t4_st~0 := 0bv32;~m_i~0 := 0bv32;~t1_i~0 := 0bv32;~t2_i~0 := 0bv32;~t3_i~0 := 0bv32;~t4_i~0 := 0bv32;~M_E~0 := 2bv32;~T1_E~0 := 2bv32;~T2_E~0 := 2bv32;~T3_E~0 := 2bv32;~T4_E~0 := 2bv32;~E_M~0 := 2bv32;~E_1~0 := 2bv32;~E_2~0 := 2bv32;~E_3~0 := 2bv32;~E_4~0 := 2bv32;~token~0 := 0bv32;~local~0 := 0bv32; {8782#true} is VALID [2022-02-20 19:59:10,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {8782#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1; {8782#true} is VALID [2022-02-20 19:59:10,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {8782#true} assume 0bv32 != main_#t~nondet34#1;havoc main_#t~nondet34#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; {8782#true} is VALID [2022-02-20 19:59:10,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {8782#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; {8782#true} is VALID [2022-02-20 19:59:10,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {8782#true} call update_channels1(); {8782#true} is VALID [2022-02-20 19:59:10,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {8782#true} assume !(1bv32 == ~q_req_up~0); {8782#true} is VALID [2022-02-20 19:59:10,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {8782#true} assume true; {8782#true} is VALID [2022-02-20 19:59:10,854 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8782#true} {8782#true} #989#return; {8782#true} is VALID [2022-02-20 19:59:10,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {8782#true} assume { :begin_inline_init_threads1 } true; {8782#true} is VALID [2022-02-20 19:59:10,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {8782#true} assume 1bv32 == ~p_dw_i~0;~p_dw_st~0 := 0bv32; {8782#true} is VALID [2022-02-20 19:59:10,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {8782#true} assume 1bv32 == ~c_dr_i~0;~c_dr_st~0 := 0bv32; {8782#true} is VALID [2022-02-20 19:59:10,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {8782#true} assume { :end_inline_init_threads1 } true; {8782#true} is VALID [2022-02-20 19:59:10,855 INFO L272 TraceCheckUtils]: 12: Hoare triple {8782#true} call fire_delta_events1(); {8782#true} is VALID [2022-02-20 19:59:10,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {8782#true} assume !(0bv32 == ~q_read_ev~0); {8782#true} is VALID [2022-02-20 19:59:10,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {8782#true} assume !(0bv32 == ~q_write_ev~0); {8782#true} is VALID [2022-02-20 19:59:10,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {8782#true} assume true; {8782#true} is VALID [2022-02-20 19:59:10,855 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8782#true} {8782#true} #991#return; {8782#true} is VALID [2022-02-20 19:59:10,856 INFO L272 TraceCheckUtils]: 17: Hoare triple {8782#true} call activate_threads1(); {8782#true} is VALID [2022-02-20 19:59:10,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {8782#true} havoc ~tmp~1;havoc ~tmp___0~1; {8782#true} is VALID [2022-02-20 19:59:10,856 INFO L272 TraceCheckUtils]: 19: Hoare triple {8782#true} call #t~ret8 := is_do_write_p_triggered(); {8782#true} is VALID [2022-02-20 19:59:10,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {8782#true} havoc ~__retres1~0; {8782#true} is VALID [2022-02-20 19:59:10,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {8782#true} assume !(1bv32 == ~p_dw_pc~0); {8782#true} is VALID [2022-02-20 19:59:10,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {8782#true} ~__retres1~0 := 0bv32; {8782#true} is VALID [2022-02-20 19:59:10,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {8782#true} #res := ~__retres1~0; {8782#true} is VALID [2022-02-20 19:59:10,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {8782#true} assume true; {8782#true} is VALID [2022-02-20 19:59:10,857 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8782#true} {8782#true} #985#return; {8782#true} is VALID [2022-02-20 19:59:10,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {8782#true} ~tmp~1 := #t~ret8;havoc #t~ret8; {8782#true} is VALID [2022-02-20 19:59:10,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {8782#true} assume !(0bv32 != ~tmp~1); {8782#true} is VALID [2022-02-20 19:59:10,857 INFO L272 TraceCheckUtils]: 28: Hoare triple {8782#true} call #t~ret9 := is_do_read_c_triggered(); {8782#true} is VALID [2022-02-20 19:59:10,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {8782#true} havoc ~__retres1~1; {8782#true} is VALID [2022-02-20 19:59:10,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {8782#true} assume !(1bv32 == ~c_dr_pc~0); {8782#true} is VALID [2022-02-20 19:59:10,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {8782#true} ~__retres1~1 := 0bv32; {8880#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} is VALID [2022-02-20 19:59:10,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {8880#(= is_do_read_c_triggered_~__retres1~1 (_ bv0 32))} #res := ~__retres1~1; {8884#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:10,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {8884#(= |is_do_read_c_triggered_#res| (_ bv0 32))} assume true; {8884#(= |is_do_read_c_triggered_#res| (_ bv0 32))} is VALID [2022-02-20 19:59:10,859 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8884#(= |is_do_read_c_triggered_#res| (_ bv0 32))} {8782#true} #987#return; {8891#(= (_ bv0 32) |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:59:10,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {8891#(= (_ bv0 32) |activate_threads1_#t~ret9|)} ~tmp___0~1 := #t~ret9;havoc #t~ret9; {8895#(= activate_threads1_~tmp___0~1 (_ bv0 32))} is VALID [2022-02-20 19:59:10,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {8895#(= activate_threads1_~tmp___0~1 (_ bv0 32))} assume 0bv32 != ~tmp___0~1;~c_dr_st~0 := 0bv32; {8783#false} is VALID [2022-02-20 19:59:10,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {8783#false} assume true; {8783#false} is VALID [2022-02-20 19:59:10,860 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8783#false} {8782#true} #993#return; {8783#false} is VALID [2022-02-20 19:59:10,860 INFO L272 TraceCheckUtils]: 39: Hoare triple {8783#false} call reset_delta_events1(); {8783#false} is VALID [2022-02-20 19:59:10,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {8783#false} assume !(1bv32 == ~q_read_ev~0); {8783#false} is VALID [2022-02-20 19:59:10,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {8783#false} assume !(1bv32 == ~q_write_ev~0); {8783#false} is VALID [2022-02-20 19:59:10,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {8783#false} assume true; {8783#false} is VALID [2022-02-20 19:59:10,861 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8783#false} {8783#false} #995#return; {8783#false} is VALID [2022-02-20 19:59:10,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {8783#false} assume !false; {8783#false} is VALID [2022-02-20 19:59:10,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {8783#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; {8783#false} is VALID [2022-02-20 19:59:10,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {8783#false} assume !false; {8783#false} is VALID [2022-02-20 19:59:10,862 INFO L272 TraceCheckUtils]: 47: Hoare triple {8783#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8783#false} is VALID [2022-02-20 19:59:10,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {8783#false} havoc ~__retres1~2; {8783#false} is VALID [2022-02-20 19:59:10,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {8783#false} assume 0bv32 == ~p_dw_st~0;~__retres1~2 := 1bv32; {8783#false} is VALID [2022-02-20 19:59:10,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {8783#false} #res := ~__retres1~2; {8783#false} is VALID [2022-02-20 19:59:10,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {8783#false} assume true; {8783#false} is VALID [2022-02-20 19:59:10,862 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8783#false} {8783#false} #997#return; {8783#false} is VALID [2022-02-20 19:59:10,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {8783#false} eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {8783#false} is VALID [2022-02-20 19:59:10,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {8783#false} assume 0bv32 != eval1_~tmp___1~0#1; {8783#false} is VALID [2022-02-20 19:59:10,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {8783#false} assume 0bv32 == ~p_dw_st~0;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {8783#false} is VALID [2022-02-20 19:59:10,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {8783#false} assume !(0bv32 != eval1_~tmp~2#1); {8783#false} is VALID [2022-02-20 19:59:10,863 INFO L272 TraceCheckUtils]: 57: Hoare triple {8783#false} call error1(); {8783#false} is VALID [2022-02-20 19:59:10,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {8783#false} assume !false; {8783#false} is VALID [2022-02-20 19:59:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:10,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:59:10,864 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:59:10,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935451903] [2022-02-20 19:59:10,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935451903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:10,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:10,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:10,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849555665] [2022-02-20 19:59:10,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:10,865 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,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:10,866 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:10,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:10,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:10,906 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:59:10,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:10,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:10,907 INFO L87 Difference]: Start difference. First operand 539 states and 748 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:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:11,699 INFO L93 Difference]: Finished difference Result 900 states and 1226 transitions. [2022-02-20 19:59:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:59:11,700 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,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:11,700 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:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2022-02-20 19:59:11,705 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:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2022-02-20 19:59:11,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 529 transitions. [2022-02-20 19:59:12,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:12,092 INFO L225 Difference]: With dead ends: 900 [2022-02-20 19:59:12,092 INFO L226 Difference]: Without dead ends: 553 [2022-02-20 19:59:12,096 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,097 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 4 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1980 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,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1980 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,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-02-20 19:59:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 549. [2022-02-20 19:59:12,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:12,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 553 states. Second operand has 549 states, 445 states have (on average 1.4089887640449439) internal successors, (627), 454 states have internal predecessors, (627), 60 states have call successors, (60), 35 states have call predecessors, (60), 42 states have return successors, (69), 62 states have call predecessors, (69), 57 states have call successors, (69) [2022-02-20 19:59:12,116 INFO L74 IsIncluded]: Start isIncluded. First operand 553 states. Second operand has 549 states, 445 states have (on average 1.4089887640449439) internal successors, (627), 454 states have internal predecessors, (627), 60 states have call successors, (60), 35 states have call predecessors, (60), 42 states have return successors, (69), 62 states have call predecessors, (69), 57 states have call successors, (69) [2022-02-20 19:59:12,118 INFO L87 Difference]: Start difference. First operand 553 states. Second operand has 549 states, 445 states have (on average 1.4089887640449439) internal successors, (627), 454 states have internal predecessors, (627), 60 states have call successors, (60), 35 states have call predecessors, (60), 42 states have return successors, (69), 62 states have call predecessors, (69), 57 states have call successors, (69) [2022-02-20 19:59:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,131 INFO L93 Difference]: Finished difference Result 553 states and 761 transitions. [2022-02-20 19:59:12,131 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 761 transitions. [2022-02-20 19:59:12,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 549 states, 445 states have (on average 1.4089887640449439) internal successors, (627), 454 states have internal predecessors, (627), 60 states have call successors, (60), 35 states have call predecessors, (60), 42 states have return successors, (69), 62 states have call predecessors, (69), 57 states have call successors, (69) Second operand 553 states. [2022-02-20 19:59:12,135 INFO L87 Difference]: Start difference. First operand has 549 states, 445 states have (on average 1.4089887640449439) internal successors, (627), 454 states have internal predecessors, (627), 60 states have call successors, (60), 35 states have call predecessors, (60), 42 states have return successors, (69), 62 states have call predecessors, (69), 57 states have call successors, (69) Second operand 553 states. [2022-02-20 19:59:12,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:12,148 INFO L93 Difference]: Finished difference Result 553 states and 761 transitions. [2022-02-20 19:59:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 761 transitions. [2022-02-20 19:59:12,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:12,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:12,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:12,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 445 states have (on average 1.4089887640449439) internal successors, (627), 454 states have internal predecessors, (627), 60 states have call successors, (60), 35 states have call predecessors, (60), 42 states have return successors, (69), 62 states have call predecessors, (69), 57 states have call successors, (69) [2022-02-20 19:59:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 756 transitions. [2022-02-20 19:59:12,165 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 756 transitions. Word has length 59 [2022-02-20 19:59:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:12,166 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 756 transitions. [2022-02-20 19:59:12,166 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,166 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 756 transitions. [2022-02-20 19:59:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 19:59:12,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:12,168 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,179 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:12,379 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:12,380 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:12,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash -119881914, now seen corresponding path program 1 times [2022-02-20 19:59:12,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:59:12,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510440864] [2022-02-20 19:59:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:12,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:59:12,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:59:12,382 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:12,431 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:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:12,487 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:59:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:59:12,591 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:59:12,592 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:59:12,592 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:59:12,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:59:12,615 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:12,801 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:12,804 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 19:59:12,806 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:59:12,864 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call update_channels1(); [2022-02-20 19:59:12,864 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 19:59:12,868 INFO L158 Benchmark]: Toolchain (without parser) took 9683.89ms. Allocated memory was 71.3MB in the beginning and 167.8MB in the end (delta: 96.5MB). Free memory was 52.9MB in the beginning and 89.5MB in the end (delta: -36.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,869 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 71.3MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:59:12,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.71ms. Allocated memory is still 71.3MB. Free memory was 52.8MB in the beginning and 44.2MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.63ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 40.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,871 INFO L158 Benchmark]: Boogie Preprocessor took 68.53ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 36.7MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,871 INFO L158 Benchmark]: RCFGBuilder took 676.73ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 36.7MB in the beginning and 83.5MB in the end (delta: -46.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,871 INFO L158 Benchmark]: TraceAbstraction took 8437.38ms. Allocated memory was 104.9MB in the beginning and 167.8MB in the end (delta: 62.9MB). Free memory was 83.0MB in the beginning and 89.5MB in the end (delta: -6.5MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-02-20 19:59:12,873 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.10ms. Allocated memory is still 71.3MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 43.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.71ms. Allocated memory is still 71.3MB. Free memory was 52.8MB in the beginning and 44.2MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.63ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 40.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.53ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 36.7MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 676.73ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 36.7MB in the beginning and 83.5MB in the end (delta: -46.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8437.38ms. Allocated memory was 104.9MB in the beginning and 167.8MB in the end (delta: 62.9MB). Free memory was 83.0MB in the beginning and 89.5MB in the end (delta: -6.5MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 19:59:12,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator