./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:14:01,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:14:02,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:14:02,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:14:02,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:14:02,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:14:02,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:14:02,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:14:02,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:14:02,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:14:02,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:14:02,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:14:02,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:14:02,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:14:02,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:14:02,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:14:02,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:14:02,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:14:02,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:14:02,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:14:02,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:14:02,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:14:02,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:14:02,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:14:02,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:14:02,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:14:02,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:14:02,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:14:02,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:14:02,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:14:02,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:14:02,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:14:02,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:14:02,092 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2024-11-07 11:14:02,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:14:02,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:14:02,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:14:02,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:14:02,383 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:14:02,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-07 11:14:03,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:14:04,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:14:04,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-07 11:14:04,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33743d94b/620afd7642c94a61a63e3f7a066fc730/FLAG1f4a7d29c [2024-11-07 11:14:04,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33743d94b/620afd7642c94a61a63e3f7a066fc730 [2024-11-07 11:14:04,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:14:04,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:14:04,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:14:04,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:14:04,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:14:04,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d6caefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04, skipping insertion in model container [2024-11-07 11:14:04,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:14:04,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-11-07 11:14:04,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:14:04,819 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:14:04,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-11-07 11:14:04,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:14:04,897 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:14:04,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04 WrapperNode [2024-11-07 11:14:04,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:14:04,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:14:04,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:14:04,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:14:04,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,944 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-07 11:14:04,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:14:04,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:14:04,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:14:04,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:14:04,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,988 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-07 11:14:04,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:04,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:05,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:14:05,001 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:14:05,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:14:05,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:14:05,002 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (1/1) ... [2024-11-07 11:14:05,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:14:05,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:14:05,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 11:14:05,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 11:14:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 11:14:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:14:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-07 11:14:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-07 11:14:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-07 11:14:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-07 11:14:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-07 11:14:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-07 11:14:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:14:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 11:14:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:14:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:14:05,059 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 11:14:05,155 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:14:05,157 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:14:05,546 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:14:05,546 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:14:05,764 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:14:05,768 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:14:05,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:05 BoogieIcfgContainer [2024-11-07 11:14:05,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:14:05,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:14:05,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:14:05,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:14:05,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:14:04" (1/3) ... [2024-11-07 11:14:05,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffbcc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:14:05, skipping insertion in model container [2024-11-07 11:14:05,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:14:04" (2/3) ... [2024-11-07 11:14:05,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffbcc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:14:05, skipping insertion in model container [2024-11-07 11:14:05,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:05" (3/3) ... [2024-11-07 11:14:05,784 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-07 11:14:05,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:14:05,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 11:14:05,829 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:14:05,885 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 11:14:05,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-07 11:14:05,940 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-07 11:14:05,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:14:05,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-11-07 11:14:05,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-07 11:14:05,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-07 11:14:05,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:14:05,974 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;@77d8b030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:14:05,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 11:14:05,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:14:05,979 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-07 11:14:05,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:14:05,979 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:05,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-07 11:14:05,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:05,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:05,985 INFO L85 PathProgramCache]: Analyzing trace with hash 13200668, now seen corresponding path program 1 times [2024-11-07 11:14:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:05,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158898730] [2024-11-07 11:14:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:05,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:06,304 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-07 11:14:06,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:06,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158898730] [2024-11-07 11:14:06,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158898730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:06,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:06,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 11:14:06,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266450787] [2024-11-07 11:14:06,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:14:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:14:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:14:06,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-11-07 11:14:06,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:06,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:06,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-11-07 11:14:06,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:06,750 INFO L124 PetriNetUnfolderBase]: 912/1625 cut-off events. [2024-11-07 11:14:06,750 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-07 11:14:06,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3029 conditions, 1625 events. 912/1625 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9848 event pairs, 292 based on Foata normal form. 60/1659 useless extension candidates. Maximal degree in co-relation 3018. Up to 1108 conditions per place. [2024-11-07 11:14:06,760 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 33 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2024-11-07 11:14:06,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 189 flow [2024-11-07 11:14:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:14:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:14:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-07 11:14:06,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2024-11-07 11:14:06,770 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 88 transitions. [2024-11-07 11:14:06,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 189 flow [2024-11-07 11:14:06,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 11:14:06,774 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-07 11:14:06,775 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-11-07 11:14:06,777 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-07 11:14:06,777 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-07 11:14:06,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:06,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:06,778 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:06,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:14:06,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1497494827, now seen corresponding path program 1 times [2024-11-07 11:14:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:06,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778194565] [2024-11-07 11:14:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:07,085 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-07 11:14:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778194565] [2024-11-07 11:14:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778194565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:07,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:07,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:14:07,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168731829] [2024-11-07 11:14:07,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:14:07,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:07,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:14:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:14:07,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-07 11:14:07,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:07,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:07,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-07 11:14:07,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:07,502 INFO L124 PetriNetUnfolderBase]: 1783/2979 cut-off events. [2024-11-07 11:14:07,503 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2024-11-07 11:14:07,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 2979 events. 1783/2979 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18370 event pairs, 227 based on Foata normal form. 120/2983 useless extension candidates. Maximal degree in co-relation 5861. Up to 1551 conditions per place. [2024-11-07 11:14:07,514 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 45 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-11-07 11:14:07,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 240 flow [2024-11-07 11:14:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:14:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:14:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-11-07 11:14:07,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6474358974358975 [2024-11-07 11:14:07,516 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 101 transitions. [2024-11-07 11:14:07,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 240 flow [2024-11-07 11:14:07,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:14:07,519 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2024-11-07 11:14:07,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2024-11-07 11:14:07,520 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-11-07 11:14:07,521 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2024-11-07 11:14:07,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:07,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:07,522 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:14:07,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:14:07,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:07,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1548034705, now seen corresponding path program 1 times [2024-11-07 11:14:07,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:07,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156952228] [2024-11-07 11:14:07,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:07,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:07,883 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-07 11:14:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156952228] [2024-11-07 11:14:07,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156952228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:07,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:07,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:14:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771259533] [2024-11-07 11:14:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:07,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:14:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:07,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:14:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:14:07,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-07 11:14:07,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:07,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:07,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-07 11:14:07,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:08,495 INFO L124 PetriNetUnfolderBase]: 1113/1869 cut-off events. [2024-11-07 11:14:08,499 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2024-11-07 11:14:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4267 conditions, 1869 events. 1113/1869 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9997 event pairs, 125 based on Foata normal form. 96/1901 useless extension candidates. Maximal degree in co-relation 4255. Up to 641 conditions per place. [2024-11-07 11:14:08,513 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 57 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2024-11-07 11:14:08,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 337 flow [2024-11-07 11:14:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:14:08,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:14:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-11-07 11:14:08,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6564102564102564 [2024-11-07 11:14:08,514 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 128 transitions. [2024-11-07 11:14:08,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 337 flow [2024-11-07 11:14:08,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 75 transitions, 327 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-07 11:14:08,516 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2024-11-07 11:14:08,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2024-11-07 11:14:08,517 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-11-07 11:14:08,517 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2024-11-07 11:14:08,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:08,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:08,521 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 11:14:08,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:14:08,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:08,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1150707052, now seen corresponding path program 1 times [2024-11-07 11:14:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941523300] [2024-11-07 11:14:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:08,930 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-07 11:14:08,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:08,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941523300] [2024-11-07 11:14:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941523300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:08,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:08,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:14:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230942661] [2024-11-07 11:14:08,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:08,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:14:08,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:08,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:14:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:14:08,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-07 11:14:08,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:08,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:08,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-07 11:14:08,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:09,174 INFO L124 PetriNetUnfolderBase]: 659/1075 cut-off events. [2024-11-07 11:14:09,174 INFO L125 PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES. [2024-11-07 11:14:09,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1075 events. 659/1075 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4934 event pairs, 105 based on Foata normal form. 44/1091 useless extension candidates. Maximal degree in co-relation 2771. Up to 352 conditions per place. [2024-11-07 11:14:09,178 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 49 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-11-07 11:14:09,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 340 flow [2024-11-07 11:14:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:14:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:14:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2024-11-07 11:14:09,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2024-11-07 11:14:09,179 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 135 transitions. [2024-11-07 11:14:09,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 340 flow [2024-11-07 11:14:09,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 315 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-07 11:14:09,183 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2024-11-07 11:14:09,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-11-07 11:14:09,184 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-07 11:14:09,184 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2024-11-07 11:14:09,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:09,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:09,184 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 11:14:09,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:14:09,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:09,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:09,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1237005287, now seen corresponding path program 1 times [2024-11-07 11:14:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:09,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772104408] [2024-11-07 11:14:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:13,618 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-07 11:14:13,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:13,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772104408] [2024-11-07 11:14:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772104408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:13,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:13,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 11:14:13,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722732396] [2024-11-07 11:14:13,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:13,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 11:14:13,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:13,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 11:14:13,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 11:14:13,638 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-07 11:14:13,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 flow. Second operand has 13 states, 13 states have (on average 15.461538461538462) internal successors, (201), 13 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:13,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:13,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-07 11:14:13,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:14,650 INFO L124 PetriNetUnfolderBase]: 998/1857 cut-off events. [2024-11-07 11:14:14,651 INFO L125 PetriNetUnfolderBase]: For 1050/1090 co-relation queries the response was YES. [2024-11-07 11:14:14,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4449 conditions, 1857 events. 998/1857 cut-off events. For 1050/1090 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10764 event pairs, 138 based on Foata normal form. 24/1815 useless extension candidates. Maximal degree in co-relation 4434. Up to 412 conditions per place. [2024-11-07 11:14:14,657 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 43 selfloop transitions, 6 changer transitions 60/126 dead transitions. [2024-11-07 11:14:14,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 126 transitions, 588 flow [2024-11-07 11:14:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 11:14:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-07 11:14:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 322 transitions. [2024-11-07 11:14:14,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5504273504273505 [2024-11-07 11:14:14,659 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 15 states and 322 transitions. [2024-11-07 11:14:14,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 126 transitions, 588 flow [2024-11-07 11:14:14,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 126 transitions, 508 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-11-07 11:14:14,666 INFO L231 Difference]: Finished difference. Result has 70 places, 42 transitions, 160 flow [2024-11-07 11:14:14,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=160, PETRI_PLACES=70, PETRI_TRANSITIONS=42} [2024-11-07 11:14:14,666 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2024-11-07 11:14:14,666 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 42 transitions, 160 flow [2024-11-07 11:14:14,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.461538461538462) internal successors, (201), 13 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:14,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:14,667 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 11:14:14,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:14:14,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:14,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1022581487, now seen corresponding path program 2 times [2024-11-07 11:14:14,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:14,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557823289] [2024-11-07 11:14:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:14,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:15,678 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-07 11:14:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557823289] [2024-11-07 11:14:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557823289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:14:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532049976] [2024-11-07 11:14:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:15,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:14:15,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:15,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:14:15,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:14:15,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-11-07 11:14:15,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 42 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:15,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:15,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-11-07 11:14:15,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:16,354 INFO L124 PetriNetUnfolderBase]: 981/1774 cut-off events. [2024-11-07 11:14:16,354 INFO L125 PetriNetUnfolderBase]: For 652/658 co-relation queries the response was YES. [2024-11-07 11:14:16,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 1774 events. 981/1774 cut-off events. For 652/658 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10253 event pairs, 294 based on Foata normal form. 14/1719 useless extension candidates. Maximal degree in co-relation 4152. Up to 844 conditions per place. [2024-11-07 11:14:16,369 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 34 selfloop transitions, 5 changer transitions 19/74 dead transitions. [2024-11-07 11:14:16,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 370 flow [2024-11-07 11:14:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:14:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:14:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-11-07 11:14:16,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5726495726495726 [2024-11-07 11:14:16,375 INFO L175 Difference]: Start difference. First operand has 70 places, 42 transitions, 160 flow. Second operand 6 states and 134 transitions. [2024-11-07 11:14:16,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 370 flow [2024-11-07 11:14:16,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 328 flow, removed 18 selfloop flow, removed 11 redundant places. [2024-11-07 11:14:16,385 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 149 flow [2024-11-07 11:14:16,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2024-11-07 11:14:16,389 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-11-07 11:14:16,389 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 149 flow [2024-11-07 11:14:16,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:16,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:16,390 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 11:14:16,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:14:16,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:16,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1669772589, now seen corresponding path program 3 times [2024-11-07 11:14:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:16,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831464431] [2024-11-07 11:14:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:16,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:14:18,198 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-07 11:14:18,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:14:18,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831464431] [2024-11-07 11:14:18,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831464431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:14:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:14:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 11:14:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317919142] [2024-11-07 11:14:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:14:18,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 11:14:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:14:18,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 11:14:18,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 11:14:18,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-07 11:14:18,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 149 flow. Second operand has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:18,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:14:18,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-07 11:14:18,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:14:18,912 INFO L124 PetriNetUnfolderBase]: 680/1276 cut-off events. [2024-11-07 11:14:18,912 INFO L125 PetriNetUnfolderBase]: For 266/266 co-relation queries the response was YES. [2024-11-07 11:14:18,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1276 events. 680/1276 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6739 event pairs, 174 based on Foata normal form. 8/1244 useless extension candidates. Maximal degree in co-relation 2945. Up to 477 conditions per place. [2024-11-07 11:14:18,918 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 31 selfloop transitions, 4 changer transitions 38/88 dead transitions. [2024-11-07 11:14:18,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 431 flow [2024-11-07 11:14:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:14:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:14:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-11-07 11:14:18,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-07 11:14:18,920 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 149 flow. Second operand 8 states and 169 transitions. [2024-11-07 11:14:18,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 431 flow [2024-11-07 11:14:18,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 394 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-11-07 11:14:18,922 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 144 flow [2024-11-07 11:14:18,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2024-11-07 11:14:18,923 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-11-07 11:14:18,924 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 144 flow [2024-11-07 11:14:18,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:14:18,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:14:18,924 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 11:14:18,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:14:18,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-07 11:14:18,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:14:18,925 INFO L85 PathProgramCache]: Analyzing trace with hash -422839067, now seen corresponding path program 4 times [2024-11-07 11:14:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:14:18,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747401999] [2024-11-07 11:14:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:14:18,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:14:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:14:19,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:14:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:14:19,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:14:19,161 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:14:19,161 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-07 11:14:19,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-07 11:14:19,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-07 11:14:19,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-07 11:14:19,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-07 11:14:19,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-07 11:14:19,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:14:19,163 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-07 11:14:19,225 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:14:19,226 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:14:19,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:14:19 BasicIcfg [2024-11-07 11:14:19,229 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:14:19,230 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:14:19,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:14:19,230 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:14:19,230 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:14:05" (3/4) ... [2024-11-07 11:14:19,231 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 11:14:19,293 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:14:19,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:14:19,294 INFO L158 Benchmark]: Toolchain (without parser) took 14834.06ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 92.0MB in the beginning and 328.3MB in the end (delta: -236.3MB). Peak memory consumption was 279.7MB. Max. memory is 16.1GB. [2024-11-07 11:14:19,295 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:14:19,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.65ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 66.2MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 11:14:19,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.91ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 63.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:14:19,296 INFO L158 Benchmark]: Boogie Preprocessor took 54.47ms. Allocated memory is still 117.4MB. Free memory was 63.4MB in the beginning and 59.5MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:14:19,296 INFO L158 Benchmark]: RCFGBuilder took 767.76ms. Allocated memory is still 117.4MB. Free memory was 59.1MB in the beginning and 41.9MB in the end (delta: 17.2MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-07 11:14:19,296 INFO L158 Benchmark]: TraceAbstraction took 13459.20ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 41.3MB in the beginning and 340.9MB in the end (delta: -299.6MB). Peak memory consumption was 215.1MB. Max. memory is 16.1GB. [2024-11-07 11:14:19,297 INFO L158 Benchmark]: Witness Printer took 63.27ms. Allocated memory is still 629.1MB. Free memory was 340.9MB in the beginning and 328.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:14:19,298 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.74ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.65ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 66.2MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.91ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 63.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.47ms. Allocated memory is still 117.4MB. Free memory was 63.4MB in the beginning and 59.5MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 767.76ms. Allocated memory is still 117.4MB. Free memory was 59.1MB in the beginning and 41.9MB in the end (delta: 17.2MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13459.20ms. Allocated memory was 117.4MB in the beginning and 629.1MB in the end (delta: 511.7MB). Free memory was 41.3MB in the beginning and 340.9MB in the end (delta: -299.6MB). Peak memory consumption was 215.1MB. Max. memory is 16.1GB. * Witness Printer took 63.27ms. Allocated memory is still 629.1MB. Free memory was 340.9MB in the beginning and 328.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1875; [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 212 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1223 IncrementalHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 13 mSDtfsCounter, 1223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=4, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 1358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-07 11:14:19,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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