./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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.06.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:09:01,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:09:01,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:09:01,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:09:01,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:09:01,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:09:01,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:09:01,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:09:01,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:09:01,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:09:01,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:09:01,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:09:01,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:09:01,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:09:01,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:09:01,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:09:01,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:09:01,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:09:01,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:09:01,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:09:01,528 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:09:01,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:09:01,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:09:01,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:09:01,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:09:01,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:09:01,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:09:01,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:09:01,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:09:01,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:09:01,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:09:01,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:09:01,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:09:01,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:09:01,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:09:01,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:09:01,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:09:01,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:09:01,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:09:01,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:09:01,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:09:01,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:09:01,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:09:01,595 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:09:01,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:09:01,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:09:01,596 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:09:01,597 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:09:01,597 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:09:01,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:09:01,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:09:01,598 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:09:01,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:09:01,599 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:09:01,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:09:01,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:09:01,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:09:01,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:09:01,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:09:01,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:09:01,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:09:01,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:09:01,601 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:09:01,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:09:01,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:09:01,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:09:01,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:09:01,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:09:01,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:09:01,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:09:01,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:09:01,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:09:01,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:09:01,603 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:09:01,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:09:01,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:09:01,603 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 -> e565a6b24d6424f6fb761694db85d86d72d2d2e8ff7a736ef4f3a961a69f6a07 [2022-07-21 08:09:01,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:09:01,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:09:01,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:09:01,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:09:01,968 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:09:01,970 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.06.cil-2.c [2022-07-21 08:09:02,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc5af175/422bdf47735648b2bf0425aa220d090c/FLAGe17089658 [2022-07-21 08:09:02,552 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:09:02,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2022-07-21 08:09:02,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc5af175/422bdf47735648b2bf0425aa220d090c/FLAGe17089658 [2022-07-21 08:09:03,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc5af175/422bdf47735648b2bf0425aa220d090c [2022-07-21 08:09:03,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:09:03,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:09:03,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:09:03,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:09:03,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:09:03,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25122903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03, skipping insertion in model container [2022-07-21 08:09:03,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:09:03,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:09:03,280 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.06.cil-2.c[914,927] [2022-07-21 08:09:03,362 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.06.cil-2.c[7125,7138] [2022-07-21 08:09:03,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:09:03,416 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:09:03,426 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.06.cil-2.c[914,927] [2022-07-21 08:09:03,439 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.06.cil-2.c[7125,7138] [2022-07-21 08:09:03,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:09:03,485 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:09:03,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03 WrapperNode [2022-07-21 08:09:03,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:09:03,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:09:03,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:09:03,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:09:03,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,561 INFO L137 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 693 [2022-07-21 08:09:03,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:09:03,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:09:03,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:09:03,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:09:03,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:09:03,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:09:03,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:09:03,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:09:03,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (1/1) ... [2022-07-21 08:09:03,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:09:03,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:03,672 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-07-21 08:09:03,709 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-07-21 08:09:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:09:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-21 08:09:03,721 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-21 08:09:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-21 08:09:03,723 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-21 08:09:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-21 08:09:03,723 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-21 08:09:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-21 08:09:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-21 08:09:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-21 08:09:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-21 08:09:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-21 08:09:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-21 08:09:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-21 08:09:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-21 08:09:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-21 08:09:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-21 08:09:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-21 08:09:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-21 08:09:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-21 08:09:03,725 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-21 08:09:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-21 08:09:03,726 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-21 08:09:03,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:09:03,741 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-21 08:09:03,741 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-21 08:09:03,741 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-21 08:09:03,742 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-21 08:09:03,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:09:03,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:09:03,742 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-21 08:09:03,743 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-21 08:09:03,891 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:09:03,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:09:04,503 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:09:04,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:09:04,516 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-07-21 08:09:04,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:09:04 BoogieIcfgContainer [2022-07-21 08:09:04,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:09:04,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:09:04,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:09:04,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:09:04,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:09:03" (1/3) ... [2022-07-21 08:09:04,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b54ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:09:04, skipping insertion in model container [2022-07-21 08:09:04,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:03" (2/3) ... [2022-07-21 08:09:04,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b54ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:09:04, skipping insertion in model container [2022-07-21 08:09:04,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:09:04" (3/3) ... [2022-07-21 08:09:04,525 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.06.cil-2.c [2022-07-21 08:09:04,537 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:09:04,538 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:09:04,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:09:04,592 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62db6944, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@daeee00 [2022-07-21 08:09:04,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-21 08:09:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 289 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-21 08:09:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 08:09:04,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:04,610 INFO L195 NwaCegarLoop]: 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-07-21 08:09:04,611 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1975408481, now seen corresponding path program 1 times [2022-07-21 08:09:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:04,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206195357] [2022-07-21 08:09:04,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:04,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:04,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:04,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:04,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:04,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:04,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206195357] [2022-07-21 08:09:04,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206195357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:04,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:04,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:09:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362589351] [2022-07-21 08:09:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:04,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:09:04,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:05,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:09:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:05,046 INFO L87 Difference]: Start difference. First operand has 334 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 289 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:09:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:06,011 INFO L93 Difference]: Finished difference Result 782 states and 1218 transitions. [2022-07-21 08:09:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:09:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-07-21 08:09:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:06,025 INFO L225 Difference]: With dead ends: 782 [2022-07-21 08:09:06,025 INFO L226 Difference]: Without dead ends: 460 [2022-07-21 08:09:06,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:09:06,033 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 837 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:06,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1409 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 08:09:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-07-21 08:09:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 420. [2022-07-21 08:09:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 357 states have internal predecessors, (520), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-07-21 08:09:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 614 transitions. [2022-07-21 08:09:06,115 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 614 transitions. Word has length 59 [2022-07-21 08:09:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:06,115 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 614 transitions. [2022-07-21 08:09:06,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:09:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 614 transitions. [2022-07-21 08:09:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 08:09:06,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:06,119 INFO L195 NwaCegarLoop]: 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-07-21 08:09:06,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:09:06,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:06,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2080229855, now seen corresponding path program 1 times [2022-07-21 08:09:06,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:06,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186059041] [2022-07-21 08:09:06,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:06,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:06,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:06,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:06,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:06,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:06,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:06,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186059041] [2022-07-21 08:09:06,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186059041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:06,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:09:06,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096454105] [2022-07-21 08:09:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:06,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:09:06,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:06,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:09:06,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:06,267 INFO L87 Difference]: Start difference. First operand 420 states and 614 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-07-21 08:09:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:07,272 INFO L93 Difference]: Finished difference Result 769 states and 1093 transitions. [2022-07-21 08:09:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 08:09:07,273 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-07-21 08:09:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:07,279 INFO L225 Difference]: With dead ends: 769 [2022-07-21 08:09:07,280 INFO L226 Difference]: Without dead ends: 591 [2022-07-21 08:09:07,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-21 08:09:07,285 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 956 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:07,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1877 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 08:09:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-21 08:09:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 516. [2022-07-21 08:09:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 435 states have internal predecessors, (624), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-07-21 08:09:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 748 transitions. [2022-07-21 08:09:07,335 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 748 transitions. Word has length 59 [2022-07-21 08:09:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:07,335 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 748 transitions. [2022-07-21 08:09:07,335 INFO L496 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-07-21 08:09:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 748 transitions. [2022-07-21 08:09:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 08:09:07,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:07,338 INFO L195 NwaCegarLoop]: 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-07-21 08:09:07,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:09:07,339 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1186743517, now seen corresponding path program 1 times [2022-07-21 08:09:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:07,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601164432] [2022-07-21 08:09:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:07,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:07,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:07,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:07,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:07,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601164432] [2022-07-21 08:09:07,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601164432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:07,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:07,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:09:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813396497] [2022-07-21 08:09:07,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:07,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:09:07,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:07,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:09:07,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:09:07,531 INFO L87 Difference]: Start difference. First operand 516 states and 748 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-21 08:09:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:09,164 INFO L93 Difference]: Finished difference Result 1862 states and 2604 transitions. [2022-07-21 08:09:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 08:09:09,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2022-07-21 08:09:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:09,175 INFO L225 Difference]: With dead ends: 1862 [2022-07-21 08:09:09,175 INFO L226 Difference]: Without dead ends: 1576 [2022-07-21 08:09:09,181 INFO L412 NwaCegarLoop]: 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-07-21 08:09:09,186 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 2855 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2869 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:09,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2869 Valid, 1890 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-21 08:09:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-07-21 08:09:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1402. [2022-07-21 08:09:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1153 states have internal predecessors, (1559), 145 states have call successors, (145), 111 states have call predecessors, (145), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-07-21 08:09:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1882 transitions. [2022-07-21 08:09:09,283 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1882 transitions. Word has length 59 [2022-07-21 08:09:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:09,284 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1882 transitions. [2022-07-21 08:09:09,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-21 08:09:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1882 transitions. [2022-07-21 08:09:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 08:09:09,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:09,286 INFO L195 NwaCegarLoop]: 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-07-21 08:09:09,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:09:09,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2136549092, now seen corresponding path program 1 times [2022-07-21 08:09:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:09,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739928284] [2022-07-21 08:09:09,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:09,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:09,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:09,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:09,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:09,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:09,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739928284] [2022-07-21 08:09:09,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739928284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:09,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:09,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:09:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395768695] [2022-07-21 08:09:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:09,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:09:09,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:09,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:09:09,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:09:09,396 INFO L87 Difference]: Start difference. First operand 1402 states and 1882 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-07-21 08:09:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:10,265 INFO L93 Difference]: Finished difference Result 2732 states and 3633 transitions. [2022-07-21 08:09:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:09:10,266 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-07-21 08:09:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:10,273 INFO L225 Difference]: With dead ends: 2732 [2022-07-21 08:09:10,273 INFO L226 Difference]: Without dead ends: 1566 [2022-07-21 08:09:10,275 INFO L412 NwaCegarLoop]: 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-07-21 08:09:10,276 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 408 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:10,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 2088 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 08:09:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2022-07-21 08:09:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1432. [2022-07-21 08:09:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1177 states have internal predecessors, (1575), 145 states have call successors, (145), 111 states have call predecessors, (145), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-07-21 08:09:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1904 transitions. [2022-07-21 08:09:10,343 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1904 transitions. Word has length 59 [2022-07-21 08:09:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:10,344 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1904 transitions. [2022-07-21 08:09:10,344 INFO L496 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-07-21 08:09:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1904 transitions. [2022-07-21 08:09:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 08:09:10,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:10,346 INFO L195 NwaCegarLoop]: 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-07-21 08:09:10,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:09:10,346 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash 331110758, now seen corresponding path program 1 times [2022-07-21 08:09:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:10,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450067197] [2022-07-21 08:09:10,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:10,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:10,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:10,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:10,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:10,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:10,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:10,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450067197] [2022-07-21 08:09:10,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450067197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:10,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:10,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:09:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366210497] [2022-07-21 08:09:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:10,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:09:10,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:10,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:09:10,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:10,436 INFO L87 Difference]: Start difference. First operand 1432 states and 1904 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-07-21 08:09:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:11,380 INFO L93 Difference]: Finished difference Result 2783 states and 3608 transitions. [2022-07-21 08:09:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 08:09:11,381 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-07-21 08:09:11,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:11,388 INFO L225 Difference]: With dead ends: 2783 [2022-07-21 08:09:11,388 INFO L226 Difference]: Without dead ends: 1810 [2022-07-21 08:09:11,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-07-21 08:09:11,393 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 966 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:11,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1628 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 08:09:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2022-07-21 08:09:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1374. [2022-07-21 08:09:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1130 states have internal predecessors, (1515), 139 states have call successors, (139), 106 states have call predecessors, (139), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-07-21 08:09:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1823 transitions. [2022-07-21 08:09:11,468 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1823 transitions. Word has length 59 [2022-07-21 08:09:11,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:11,469 INFO L495 AbstractCegarLoop]: Abstraction has 1374 states and 1823 transitions. [2022-07-21 08:09:11,470 INFO L496 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-07-21 08:09:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1823 transitions. [2022-07-21 08:09:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 08:09:11,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:11,471 INFO L195 NwaCegarLoop]: 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-07-21 08:09:11,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:09:11,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1663033948, now seen corresponding path program 1 times [2022-07-21 08:09:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:11,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652755397] [2022-07-21 08:09:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:09:11,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:09:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:09:11,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:09:11,558 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:09:11,559 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-21 08:09:11,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-21 08:09:11,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:09:11,563 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-21 08:09:11,567 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:09:11,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:09:11 BoogieIcfgContainer [2022-07-21 08:09:11,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:09:11,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:09:11,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:09:11,686 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:09:11,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:09:04" (3/4) ... [2022-07-21 08:09:11,688 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:09:11,766 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:09:11,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:09:11,767 INFO L158 Benchmark]: Toolchain (without parser) took 8719.05ms. Allocated memory was 60.8MB in the beginning and 136.3MB in the end (delta: 75.5MB). Free memory was 38.2MB in the beginning and 40.1MB in the end (delta: -1.9MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2022-07-21 08:09:11,768 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 60.8MB. Free memory was 41.3MB in the beginning and 41.3MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:09:11,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.20ms. Allocated memory is still 60.8MB. Free memory was 38.0MB in the beginning and 34.8MB in the end (delta: 3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 08:09:11,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.01ms. Allocated memory is still 60.8MB. Free memory was 34.5MB in the beginning and 31.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 08:09:11,769 INFO L158 Benchmark]: Boogie Preprocessor took 73.16ms. Allocated memory is still 60.8MB. Free memory was 31.1MB in the beginning and 27.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 08:09:11,769 INFO L158 Benchmark]: RCFGBuilder took 878.09ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 27.7MB in the beginning and 49.6MB in the end (delta: -21.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-07-21 08:09:11,771 INFO L158 Benchmark]: TraceAbstraction took 7164.84ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 49.2MB in the beginning and 51.6MB in the end (delta: -2.4MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2022-07-21 08:09:11,771 INFO L158 Benchmark]: Witness Printer took 81.42ms. Allocated memory is still 136.3MB. Free memory was 51.6MB in the beginning and 40.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 08:09:11,775 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 60.8MB. Free memory was 41.3MB in the beginning and 41.3MB in the end (delta: 46.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.20ms. Allocated memory is still 60.8MB. Free memory was 38.0MB in the beginning and 34.8MB in the end (delta: 3.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.01ms. Allocated memory is still 60.8MB. Free memory was 34.5MB in the beginning and 31.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.16ms. Allocated memory is still 60.8MB. Free memory was 31.1MB in the beginning and 27.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 878.09ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 27.7MB in the beginning and 49.6MB in the end (delta: -21.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7164.84ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 49.2MB in the beginning and 51.6MB in the end (delta: -2.4MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * Witness Printer took 81.42ms. Allocated memory is still 136.3MB. Free memory was 51.6MB in the beginning and 40.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int m_st ; [L508] int t1_st ; [L509] int t2_st ; [L510] int t3_st ; [L511] int t4_st ; [L512] int t5_st ; [L513] int t6_st ; [L514] int m_i ; [L515] int t1_i ; [L516] int t2_i ; [L517] int t3_i ; [L518] int t4_i ; [L519] int t5_i ; [L520] int t6_i ; [L521] int M_E = 2; [L522] int T1_E = 2; [L523] int T2_E = 2; [L524] int T3_E = 2; [L525] int T4_E = 2; [L526] int T5_E = 2; [L527] int T6_E = 2; [L528] int E_M = 2; [L529] int E_1 = 2; [L530] int E_2 = 2; [L531] int E_3 = 2; [L532] int E_4 = 2; [L533] int E_5 = 2; [L534] int E_6 = 2; [L543] int token ; [L545] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L1587] COND TRUE __VERIFIER_nondet_int() [L1588] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 334 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6091 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6022 mSDsluCounter, 8892 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6326 mSDsCounter, 1244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5507 IncrementalHoareTripleChecker+Invalid, 6751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1244 mSolverCounterUnsat, 2566 mSDtfsCounter, 5507 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1432occurred in iteration=4, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 859 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 08:09:11,811 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE