./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:57:16,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:57:16,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:57:16,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:57:16,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:57:16,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:57:16,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:57:16,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:57:16,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:57:16,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:57:16,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:57:16,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:57:16,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:57:16,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:57:16,811 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:57:16,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:57:16,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:57:16,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:57:16,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:57:16,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:57:16,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:57:16,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:57:16,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:57:16,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:57:16,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:57:16,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:57:16,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:57:16,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:57:16,815 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:57:16,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:57:16,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:57:16,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:57:16,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:57:16,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:57:16,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:57:16,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:57:16,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:57:16,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:57:16,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:57:16,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:57:16,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:57:16,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:57:16,818 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e [2024-11-16 09:57:17,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:57:17,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:57:17,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:57:17,076 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:57:17,076 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:57:17,077 INFO L431 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.07.cil-1.c [2024-11-16 09:57:18,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:57:18,789 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:57:18,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2024-11-16 09:57:18,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccaf891e1/49d9d3e5380a4228a4dbb82e39db4877/FLAG425bdf680 [2024-11-16 09:57:18,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccaf891e1/49d9d3e5380a4228a4dbb82e39db4877 [2024-11-16 09:57:18,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:57:18,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:57:18,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:57:18,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:57:18,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:57:18,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:57:18" (1/1) ... [2024-11-16 09:57:18,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6867c346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:18, skipping insertion in model container [2024-11-16 09:57:18,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:57:18" (1/1) ... [2024-11-16 09:57:18,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:57:19,100 WARN L250 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.07.cil-1.c[914,927] [2024-11-16 09:57:19,214 WARN L250 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.07.cil-1.c[7125,7138] [2024-11-16 09:57:19,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:57:19,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:57:19,351 WARN L250 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.07.cil-1.c[914,927] [2024-11-16 09:57:19,378 WARN L250 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.07.cil-1.c[7125,7138] [2024-11-16 09:57:19,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:57:19,442 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:57:19,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19 WrapperNode [2024-11-16 09:57:19,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:57:19,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:57:19,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:57:19,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:57:19,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,507 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 755 [2024-11-16 09:57:19,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:57:19,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:57:19,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:57:19,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:57:19,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,521 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,538 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 09:57:19,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,550 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:57:19,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:57:19,574 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:57:19,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:57:19,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (1/1) ... [2024-11-16 09:57:19,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:57:19,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:57:19,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 09:57:19,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 09:57:19,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:57:19,673 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-16 09:57:19,673 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-16 09:57:19,674 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-16 09:57:19,674 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-16 09:57:19,674 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-16 09:57:19,675 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-16 09:57:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-16 09:57:19,676 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-16 09:57:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-16 09:57:19,676 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-16 09:57:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-16 09:57:19,676 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-16 09:57:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-16 09:57:19,676 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-16 09:57:19,677 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-16 09:57:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-16 09:57:19,677 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-16 09:57:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-16 09:57:19,677 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-16 09:57:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-16 09:57:19,677 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-16 09:57:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-16 09:57:19,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:57:19,677 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-16 09:57:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-16 09:57:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-16 09:57:19,678 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-16 09:57:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:57:19,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:57:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-16 09:57:19,678 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-16 09:57:19,818 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:57:19,821 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:57:20,643 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2024-11-16 09:57:20,643 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:57:20,680 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:57:20,681 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:57:20,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:57:20 BoogieIcfgContainer [2024-11-16 09:57:20,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:57:20,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:57:20,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:57:20,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:57:20,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:57:18" (1/3) ... [2024-11-16 09:57:20,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2c04cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:57:20, skipping insertion in model container [2024-11-16 09:57:20,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:57:19" (2/3) ... [2024-11-16 09:57:20,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2c04cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:57:20, skipping insertion in model container [2024-11-16 09:57:20,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:57:20" (3/3) ... [2024-11-16 09:57:20,692 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2024-11-16 09:57:20,715 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:57:20,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:57:20,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:57:20,810 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62ad7ee8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:57:20,811 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:57:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 425 states, 372 states have (on average 1.5053763440860215) internal successors, (560), 379 states have internal predecessors, (560), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 09:57:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:20,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:20,833 INFO L215 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, 1, 1, 1, 1] [2024-11-16 09:57:20,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:20,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:20,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2004031278, now seen corresponding path program 1 times [2024-11-16 09:57:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:20,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924609521] [2024-11-16 09:57:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:21,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:21,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:21,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924609521] [2024-11-16 09:57:21,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924609521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:21,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:21,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:57:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562257146] [2024-11-16 09:57:21,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:21,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:57:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:57:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:21,484 INFO L87 Difference]: Start difference. First operand has 425 states, 372 states have (on average 1.5053763440860215) internal successors, (560), 379 states have internal predecessors, (560), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-11-16 09:57:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:22,807 INFO L93 Difference]: Finished difference Result 966 states and 1437 transitions. [2024-11-16 09:57:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 09:57:22,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2024-11-16 09:57:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:22,827 INFO L225 Difference]: With dead ends: 966 [2024-11-16 09:57:22,827 INFO L226 Difference]: Without dead ends: 551 [2024-11-16 09:57:22,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:57:22,836 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 680 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:22,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1857 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 09:57:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-16 09:57:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 510. [2024-11-16 09:57:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 439 states have (on average 1.4214123006833712) internal successors, (624), 446 states have internal predecessors, (624), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-16 09:57:22,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 720 transitions. [2024-11-16 09:57:22,938 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 720 transitions. Word has length 63 [2024-11-16 09:57:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:22,938 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 720 transitions. [2024-11-16 09:57:22,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-11-16 09:57:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 720 transitions. [2024-11-16 09:57:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:22,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:22,942 INFO L215 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, 1, 1, 1, 1] [2024-11-16 09:57:22,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:57:22,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:22,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1286711666, now seen corresponding path program 1 times [2024-11-16 09:57:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777908653] [2024-11-16 09:57:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:23,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:23,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:23,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:23,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:23,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:23,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777908653] [2024-11-16 09:57:23,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777908653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:23,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:23,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:57:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508897249] [2024-11-16 09:57:23,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:23,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:57:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:57:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:23,199 INFO L87 Difference]: Start difference. First operand 510 states and 720 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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) [2024-11-16 09:57:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:24,423 INFO L93 Difference]: Finished difference Result 900 states and 1240 transitions. [2024-11-16 09:57:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 09:57:24,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2024-11-16 09:57:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:24,428 INFO L225 Difference]: With dead ends: 900 [2024-11-16 09:57:24,429 INFO L226 Difference]: Without dead ends: 695 [2024-11-16 09:57:24,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-16 09:57:24,431 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 1344 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:24,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 1835 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 09:57:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-16 09:57:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 619. [2024-11-16 09:57:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 528 states have (on average 1.4034090909090908) internal successors, (741), 537 states have internal predecessors, (741), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2024-11-16 09:57:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 867 transitions. [2024-11-16 09:57:24,494 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 867 transitions. Word has length 63 [2024-11-16 09:57:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:24,495 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 867 transitions. [2024-11-16 09:57:24,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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) [2024-11-16 09:57:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 867 transitions. [2024-11-16 09:57:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:24,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:24,502 INFO L215 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, 1, 1, 1, 1] [2024-11-16 09:57:24,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:57:24,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1294471025, now seen corresponding path program 1 times [2024-11-16 09:57:24,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:24,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132880569] [2024-11-16 09:57:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:24,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:24,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:24,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:24,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:24,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132880569] [2024-11-16 09:57:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132880569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:24,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:24,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 09:57:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715323709] [2024-11-16 09:57:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:24,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 09:57:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:24,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 09:57:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:57:24,714 INFO L87 Difference]: Start difference. First operand 619 states and 867 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-11-16 09:57:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:25,724 INFO L93 Difference]: Finished difference Result 959 states and 1319 transitions. [2024-11-16 09:57:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 09:57:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2024-11-16 09:57:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:25,730 INFO L225 Difference]: With dead ends: 959 [2024-11-16 09:57:25,731 INFO L226 Difference]: Without dead ends: 651 [2024-11-16 09:57:25,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 09:57:25,733 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 669 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:25,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 2187 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 09:57:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-16 09:57:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 624. [2024-11-16 09:57:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 532 states have (on average 1.3966165413533835) internal successors, (743), 541 states have internal predecessors, (743), 58 states have call successors, (58), 28 states have call predecessors, (58), 32 states have return successors, (69), 58 states have call predecessors, (69), 55 states have call successors, (69) [2024-11-16 09:57:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 870 transitions. [2024-11-16 09:57:25,784 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 870 transitions. Word has length 63 [2024-11-16 09:57:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:25,784 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 870 transitions. [2024-11-16 09:57:25,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-11-16 09:57:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 870 transitions. [2024-11-16 09:57:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:25,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:25,790 INFO L215 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, 1, 1, 1, 1] [2024-11-16 09:57:25,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:57:25,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:25,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:25,791 INFO L85 PathProgramCache]: Analyzing trace with hash 655829230, now seen corresponding path program 1 times [2024-11-16 09:57:25,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:25,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381732248] [2024-11-16 09:57:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:25,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:25,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:25,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:25,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:25,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381732248] [2024-11-16 09:57:25,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381732248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:25,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:25,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 09:57:25,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747063513] [2024-11-16 09:57:25,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:25,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 09:57:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 09:57:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 09:57:25,948 INFO L87 Difference]: Start difference. First operand 624 states and 870 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 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) [2024-11-16 09:57:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:27,889 INFO L93 Difference]: Finished difference Result 2158 states and 2874 transitions. [2024-11-16 09:57:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 09:57:27,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 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 63 [2024-11-16 09:57:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:27,901 INFO L225 Difference]: With dead ends: 2158 [2024-11-16 09:57:27,902 INFO L226 Difference]: Without dead ends: 1827 [2024-11-16 09:57:27,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 09:57:27,911 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 3034 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3048 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:27,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3048 Valid, 2512 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 09:57:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2024-11-16 09:57:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1658. [2024-11-16 09:57:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1380 states have (on average 1.315217391304348) internal successors, (1815), 1404 states have internal predecessors, (1815), 146 states have call successors, (146), 111 states have call predecessors, (146), 130 states have return successors, (183), 145 states have call predecessors, (183), 143 states have call successors, (183) [2024-11-16 09:57:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2144 transitions. [2024-11-16 09:57:28,022 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2144 transitions. Word has length 63 [2024-11-16 09:57:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:28,026 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2144 transitions. [2024-11-16 09:57:28,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 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) [2024-11-16 09:57:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2144 transitions. [2024-11-16 09:57:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:28,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:28,027 INFO L215 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, 1, 1, 1, 1] [2024-11-16 09:57:28,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:57:28,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:28,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1802607311, now seen corresponding path program 1 times [2024-11-16 09:57:28,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:28,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494227000] [2024-11-16 09:57:28,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:28,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:28,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:28,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:28,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:28,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:28,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494227000] [2024-11-16 09:57:28,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494227000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:28,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:28,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 09:57:28,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500456095] [2024-11-16 09:57:28,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:28,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 09:57:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:28,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 09:57:28,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 09:57:28,219 INFO L87 Difference]: Start difference. First operand 1658 states and 2144 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-11-16 09:57:29,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:29,239 INFO L93 Difference]: Finished difference Result 3119 states and 3987 transitions. [2024-11-16 09:57:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 09:57:29,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2024-11-16 09:57:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:29,248 INFO L225 Difference]: With dead ends: 3119 [2024-11-16 09:57:29,248 INFO L226 Difference]: Without dead ends: 1760 [2024-11-16 09:57:29,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-16 09:57:29,253 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 676 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:29,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 2184 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 09:57:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2024-11-16 09:57:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1688. [2024-11-16 09:57:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1688 states, 1404 states have (on average 1.3041310541310542) internal successors, (1831), 1428 states have internal predecessors, (1831), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2024-11-16 09:57:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 2166 transitions. [2024-11-16 09:57:29,381 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 2166 transitions. Word has length 63 [2024-11-16 09:57:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:29,381 INFO L471 AbstractCegarLoop]: Abstraction has 1688 states and 2166 transitions. [2024-11-16 09:57:29,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-11-16 09:57:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 2166 transitions. [2024-11-16 09:57:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:29,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:29,382 INFO L215 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, 1, 1, 1, 1] [2024-11-16 09:57:29,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:57:29,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:29,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash -840993294, now seen corresponding path program 1 times [2024-11-16 09:57:29,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:29,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682346019] [2024-11-16 09:57:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:29,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 09:57:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:29,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 09:57:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 09:57:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 09:57:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:29,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-16 09:57:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:29,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 09:57:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:29,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 09:57:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:57:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:57:29,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:57:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682346019] [2024-11-16 09:57:29,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682346019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:57:29,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:57:29,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:57:29,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314190785] [2024-11-16 09:57:29,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:57:29,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:57:29,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:57:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:57:29,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:57:29,568 INFO L87 Difference]: Start difference. First operand 1688 states and 2166 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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) [2024-11-16 09:57:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:57:30,731 INFO L93 Difference]: Finished difference Result 3078 states and 3848 transitions. [2024-11-16 09:57:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 09:57:30,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2024-11-16 09:57:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:57:30,742 INFO L225 Difference]: With dead ends: 3078 [2024-11-16 09:57:30,742 INFO L226 Difference]: Without dead ends: 1945 [2024-11-16 09:57:30,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-16 09:57:30,746 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 1095 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 09:57:30,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1837 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 09:57:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2024-11-16 09:57:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1622. [2024-11-16 09:57:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1354 states have (on average 1.3013293943870015) internal successors, (1762), 1373 states have internal predecessors, (1762), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2024-11-16 09:57:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2076 transitions. [2024-11-16 09:57:30,859 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2076 transitions. Word has length 63 [2024-11-16 09:57:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:57:30,861 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2076 transitions. [2024-11-16 09:57:30,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 6 states have internal predecessors, (48), 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) [2024-11-16 09:57:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2076 transitions. [2024-11-16 09:57:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:57:30,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:57:30,862 INFO L215 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, 1, 1, 1, 1] [2024-11-16 09:57:30,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:57:30,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:57:30,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:57:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1415917713, now seen corresponding path program 1 times [2024-11-16 09:57:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:57:30,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994915386] [2024-11-16 09:57:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:57:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:57:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 09:57:30,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 09:57:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 09:57:30,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 09:57:30,937 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 09:57:30,938 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-16 09:57:30,939 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-16 09:57:30,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:57:30,943 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:57:31,053 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 09:57:31,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 09:57:31 BoogieIcfgContainer [2024-11-16 09:57:31,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 09:57:31,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 09:57:31,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 09:57:31,059 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 09:57:31,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:57:20" (3/4) ... [2024-11-16 09:57:31,060 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 09:57:31,163 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 09:57:31,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 09:57:31,164 INFO L158 Benchmark]: Toolchain (without parser) took 12325.98ms. Allocated memory was 174.1MB in the beginning and 268.4MB in the end (delta: 94.4MB). Free memory was 103.0MB in the beginning and 136.3MB in the end (delta: -33.3MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2024-11-16 09:57:31,164 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 115.3MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 09:57:31,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.68ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 135.7MB in the end (delta: -33.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 09:57:31,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.47ms. Allocated memory is still 174.1MB. Free memory was 135.1MB in the beginning and 131.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 09:57:31,165 INFO L158 Benchmark]: Boogie Preprocessor took 63.03ms. Allocated memory is still 174.1MB. Free memory was 131.5MB in the beginning and 128.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 09:57:31,165 INFO L158 Benchmark]: IcfgBuilder took 1109.29ms. Allocated memory is still 174.1MB. Free memory was 128.1MB in the beginning and 137.4MB in the end (delta: -9.2MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2024-11-16 09:57:31,165 INFO L158 Benchmark]: TraceAbstraction took 10371.84ms. Allocated memory was 174.1MB in the beginning and 268.4MB in the end (delta: 94.4MB). Free memory was 136.3MB in the beginning and 152.0MB in the end (delta: -15.7MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2024-11-16 09:57:31,165 INFO L158 Benchmark]: Witness Printer took 104.83ms. Allocated memory is still 268.4MB. Free memory was 152.0MB in the beginning and 136.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 09:57:31,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 115.3MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.68ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 135.7MB in the end (delta: -33.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.47ms. Allocated memory is still 174.1MB. Free memory was 135.1MB in the beginning and 131.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.03ms. Allocated memory is still 174.1MB. Free memory was 131.5MB in the beginning and 128.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1109.29ms. Allocated memory is still 174.1MB. Free memory was 128.1MB in the beginning and 137.4MB in the end (delta: -9.2MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10371.84ms. Allocated memory was 174.1MB in the beginning and 268.4MB in the end (delta: 94.4MB). Free memory was 136.3MB in the beginning and 152.0MB in the end (delta: -15.7MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. * Witness Printer took 104.83ms. Allocated memory is still 268.4MB. Free memory was 152.0MB in the beginning and 136.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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 t7_pc = 0; [L508] int m_st ; [L509] int t1_st ; [L510] int t2_st ; [L511] int t3_st ; [L512] int t4_st ; [L513] int t5_st ; [L514] int t6_st ; [L515] int t7_st ; [L516] int m_i ; [L517] int t1_i ; [L518] int t2_i ; [L519] int t3_i ; [L520] int t4_i ; [L521] int t5_i ; [L522] int t6_i ; [L523] int t7_i ; [L524] int M_E = 2; [L525] int T1_E = 2; [L526] int T2_E = 2; [L527] int T3_E = 2; [L528] int T4_E = 2; [L529] int T5_E = 2; [L530] int T6_E = 2; [L531] int T7_E = 2; [L532] int E_M = 2; [L533] int E_1 = 2; [L534] int E_2 = 2; [L535] int E_3 = 2; [L536] int E_4 = 2; [L537] int E_5 = 2; [L538] int E_6 = 2; [L539] int E_7 = 2; [L549] int token ; [L551] int local ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L1712] COND TRUE __VERIFIER_nondet_int() [L1713] 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 [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L85] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L104] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L427] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, __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, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, \result=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, T4_E=2, T5_E=2, T6_E=2, T7_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, 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_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, t3_i=0, t3_pc=0, t3_st=0, t4_i=0, t4_pc=0, t4_st=0, t5_i=0, t5_pc=0, t5_st=0, t6_i=0, t6_pc=0, t6_st=0, t7_i=0, t7_pc=0, t7_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 425 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7571 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7498 mSDsluCounter, 12412 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10193 mSDsCounter, 1177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7985 IncrementalHoareTripleChecker+Invalid, 9162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1177 mSolverCounterUnsat, 2219 mSDtfsCounter, 7985 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1688occurred in iteration=5, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 708 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 441 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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! [2024-11-16 09:57:31,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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