./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.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-atomic/read_write_lock-2.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', '3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301'] 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-atomic/read_write_lock-2.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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:07:05,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:07:05,890 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:07:05,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:07:05,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:07:05,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:07:05,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:07:05,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:07:05,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:07:05,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:07:05,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:07:05,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:07:05,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:07:05,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:07:05,929 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:07:05,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:07:05,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:07:05,929 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:07:05,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:07:05,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:07:05,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:07:05,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:07:05,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:07:05,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:07:05,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:07:05,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:07:05,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:07:05,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:07:05,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:07:05,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:07:05,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:07:05,931 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2024-11-07 11:07:06,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:07:06,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:07:06,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:07:06,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:07:06,178 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:07:06,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-07 11:07:07,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:07:07,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:07:07,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-07 11:07:07,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/604222d99/bdc97622e1fa42038d118b4fada620aa/FLAG3009b3681 [2024-11-07 11:07:07,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/604222d99/bdc97622e1fa42038d118b4fada620aa [2024-11-07 11:07:07,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:07:07,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:07:07,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:07:07,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:07:07,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:07:07,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:07:07" (1/1) ... [2024-11-07 11:07:07,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7360cc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:07, skipping insertion in model container [2024-11-07 11:07:07,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:07:07" (1/1) ... [2024-11-07 11:07:07,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:07:08,229 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-atomic/read_write_lock-2.i[31244,31257] [2024-11-07 11:07:08,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:07:08,250 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:07:08,299 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-atomic/read_write_lock-2.i[31244,31257] [2024-11-07 11:07:08,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:07:08,342 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:07:08,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08 WrapperNode [2024-11-07 11:07:08,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:07:08,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:07:08,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:07:08,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:07:08,351 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:07:08" (1/1) ... [2024-11-07 11:07:08,366 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:07:08" (1/1) ... [2024-11-07 11:07:08,384 INFO L138 Inliner]: procedures = 172, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2024-11-07 11:07:08,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:07:08,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:07:08,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:07:08,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:07:08,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,410 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:07:08,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:07:08,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:07:08,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:07:08,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:07:08,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (1/1) ... [2024-11-07 11:07:08,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:07:08,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:07:08,447 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:07:08,449 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:07:08,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 11:07:08,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:07:08,470 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-11-07 11:07:08,470 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-11-07 11:07:08,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:07:08,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 11:07:08,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:07:08,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:07:08,470 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-11-07 11:07:08,470 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-11-07 11:07:08,471 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:07:08,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:07:08,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:07:08,750 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:07:08,750 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:07:08,890 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:07:08,891 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:07:08,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:07:08 BoogieIcfgContainer [2024-11-07 11:07:08,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:07:08,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:07:08,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:07:08,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:07:08,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:07:07" (1/3) ... [2024-11-07 11:07:08,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3baadb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:07:08, skipping insertion in model container [2024-11-07 11:07:08,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:07:08" (2/3) ... [2024-11-07 11:07:08,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3baadb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:07:08, skipping insertion in model container [2024-11-07 11:07:08,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:07:08" (3/3) ... [2024-11-07 11:07:08,903 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-11-07 11:07:08,916 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:07:08,917 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:07:08,917 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:07:08,981 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-07 11:07:09,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 136 flow [2024-11-07 11:07:09,049 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2024-11-07 11:07:09,053 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 11:07:09,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 50 events. 2/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-07 11:07:09,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 136 flow [2024-11-07 11:07:09,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 48 transitions, 117 flow [2024-11-07 11:07:09,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:07:09,085 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;@1af70140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:07:09,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 11:07:09,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:07:09,109 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2024-11-07 11:07:09,109 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 11:07:09,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:09,110 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:09,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 11:07:09,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1720018318, now seen corresponding path program 1 times [2024-11-07 11:07:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:09,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977852062] [2024-11-07 11:07:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:09,414 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:07:09,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977852062] [2024-11-07 11:07:09,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977852062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:07:09,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:07:09,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:07:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642625156] [2024-11-07 11:07:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:07:09,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:07:09,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:07:09,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:07:09,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2024-11-07 11:07:09,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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:07:09,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:09,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2024-11-07 11:07:09,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:11,840 INFO L124 PetriNetUnfolderBase]: 11279/20155 cut-off events. [2024-11-07 11:07:11,840 INFO L125 PetriNetUnfolderBase]: For 1710/1710 co-relation queries the response was YES. [2024-11-07 11:07:11,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37155 conditions, 20155 events. 11279/20155 cut-off events. For 1710/1710 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 173961 event pairs, 1143 based on Foata normal form. 1103/20329 useless extension candidates. Maximal degree in co-relation 32953. Up to 5230 conditions per place. [2024-11-07 11:07:12,014 INFO L140 encePairwiseOnDemand]: 41/54 looper letters, 159 selfloop transitions, 37 changer transitions 6/216 dead transitions. [2024-11-07 11:07:12,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 216 transitions, 944 flow [2024-11-07 11:07:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 11:07:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 11:07:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 452 transitions. [2024-11-07 11:07:12,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6438746438746439 [2024-11-07 11:07:12,030 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 117 flow. Second operand 13 states and 452 transitions. [2024-11-07 11:07:12,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 216 transitions, 944 flow [2024-11-07 11:07:12,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 216 transitions, 880 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-07 11:07:12,060 INFO L231 Difference]: Finished difference. Result has 72 places, 85 transitions, 343 flow [2024-11-07 11:07:12,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=343, PETRI_PLACES=72, PETRI_TRANSITIONS=85} [2024-11-07 11:07:12,067 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2024-11-07 11:07:12,068 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 85 transitions, 343 flow [2024-11-07 11:07:12,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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:07:12,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:12,068 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:12,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:07:12,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 11:07:12,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash 550720275, now seen corresponding path program 1 times [2024-11-07 11:07:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555755640] [2024-11-07 11:07:12,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:12,172 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:07:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555755640] [2024-11-07 11:07:12,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555755640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:07:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:07:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:07:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005654547] [2024-11-07 11:07:12,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:07:12,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 11:07:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:12,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 11:07:12,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 11:07:12,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2024-11-07 11:07:12,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 85 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:07:12,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:12,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2024-11-07 11:07:12,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:13,112 INFO L124 PetriNetUnfolderBase]: 4421/9940 cut-off events. [2024-11-07 11:07:13,113 INFO L125 PetriNetUnfolderBase]: For 1242/1384 co-relation queries the response was YES. [2024-11-07 11:07:13,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19419 conditions, 9940 events. 4421/9940 cut-off events. For 1242/1384 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 98021 event pairs, 1862 based on Foata normal form. 388/9507 useless extension candidates. Maximal degree in co-relation 18385. Up to 3454 conditions per place. [2024-11-07 11:07:13,208 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 35 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2024-11-07 11:07:13,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 457 flow [2024-11-07 11:07:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 11:07:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 11:07:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-11-07 11:07:13,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2024-11-07 11:07:13,213 INFO L175 Difference]: Start difference. First operand has 72 places, 85 transitions, 343 flow. Second operand 3 states and 121 transitions. [2024-11-07 11:07:13,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 457 flow [2024-11-07 11:07:13,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 11:07:13,284 INFO L231 Difference]: Finished difference. Result has 75 places, 85 transitions, 359 flow [2024-11-07 11:07:13,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=75, PETRI_TRANSITIONS=85} [2024-11-07 11:07:13,286 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2024-11-07 11:07:13,286 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 85 transitions, 359 flow [2024-11-07 11:07:13,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:07:13,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:13,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:13,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:07:13,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 11:07:13,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2143072499, now seen corresponding path program 2 times [2024-11-07 11:07:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:13,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595622804] [2024-11-07 11:07:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:13,405 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:07:13,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:13,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595622804] [2024-11-07 11:07:13,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595622804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:07:13,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:07:13,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:07:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502594617] [2024-11-07 11:07:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:07:13,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:07:13,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:07:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:07:13,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2024-11-07 11:07:13,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 85 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:07:13,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:13,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2024-11-07 11:07:13,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:14,302 INFO L124 PetriNetUnfolderBase]: 5047/10609 cut-off events. [2024-11-07 11:07:14,303 INFO L125 PetriNetUnfolderBase]: For 3991/4100 co-relation queries the response was YES. [2024-11-07 11:07:14,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22773 conditions, 10609 events. 5047/10609 cut-off events. For 3991/4100 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 96505 event pairs, 1477 based on Foata normal form. 116/10284 useless extension candidates. Maximal degree in co-relation 21587. Up to 3290 conditions per place. [2024-11-07 11:07:14,375 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 50 selfloop transitions, 9 changer transitions 3/123 dead transitions. [2024-11-07 11:07:14,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 585 flow [2024-11-07 11:07:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:07:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:07:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-11-07 11:07:14,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2024-11-07 11:07:14,377 INFO L175 Difference]: Start difference. First operand has 75 places, 85 transitions, 359 flow. Second operand 4 states and 168 transitions. [2024-11-07 11:07:14,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 585 flow [2024-11-07 11:07:14,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:07:14,449 INFO L231 Difference]: Finished difference. Result has 79 places, 91 transitions, 417 flow [2024-11-07 11:07:14,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=417, PETRI_PLACES=79, PETRI_TRANSITIONS=91} [2024-11-07 11:07:14,450 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2024-11-07 11:07:14,450 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 91 transitions, 417 flow [2024-11-07 11:07:14,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:07:14,450 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:14,450 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:07:14,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:07:14,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 11:07:14,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1215427923, now seen corresponding path program 1 times [2024-11-07 11:07:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826492899] [2024-11-07 11:07:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:14,521 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:07:14,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826492899] [2024-11-07 11:07:14,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826492899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:07:14,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:07:14,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:07:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303663485] [2024-11-07 11:07:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:07:14,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:07:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:14,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:07:14,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:07:14,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2024-11-07 11:07:14,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 91 transitions, 417 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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:07:14,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:14,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2024-11-07 11:07:14,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:15,897 INFO L124 PetriNetUnfolderBase]: 12087/20515 cut-off events. [2024-11-07 11:07:15,897 INFO L125 PetriNetUnfolderBase]: For 17083/17661 co-relation queries the response was YES. [2024-11-07 11:07:15,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51076 conditions, 20515 events. 12087/20515 cut-off events. For 17083/17661 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 161312 event pairs, 1864 based on Foata normal form. 307/20446 useless extension candidates. Maximal degree in co-relation 49364. Up to 4494 conditions per place. [2024-11-07 11:07:15,994 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 159 selfloop transitions, 52 changer transitions 52/288 dead transitions. [2024-11-07 11:07:15,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 288 transitions, 1739 flow [2024-11-07 11:07:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 11:07:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 11:07:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 431 transitions. [2024-11-07 11:07:15,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.613960113960114 [2024-11-07 11:07:15,996 INFO L175 Difference]: Start difference. First operand has 79 places, 91 transitions, 417 flow. Second operand 13 states and 431 transitions. [2024-11-07 11:07:15,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 288 transitions, 1739 flow [2024-11-07 11:07:16,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 288 transitions, 1739 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 11:07:16,182 INFO L231 Difference]: Finished difference. Result has 102 places, 127 transitions, 836 flow [2024-11-07 11:07:16,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=836, PETRI_PLACES=102, PETRI_TRANSITIONS=127} [2024-11-07 11:07:16,184 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 43 predicate places. [2024-11-07 11:07:16,184 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 127 transitions, 836 flow [2024-11-07 11:07:16,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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:07:16,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:16,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] [2024-11-07 11:07:16,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:07:16,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 11:07:16,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash -52753927, now seen corresponding path program 1 times [2024-11-07 11:07:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:16,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719997655] [2024-11-07 11:07:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:16,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:16,280 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:07:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:16,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719997655] [2024-11-07 11:07:16,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719997655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:07:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:07:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:07:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410921569] [2024-11-07 11:07:16,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:07:16,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:07:16,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:16,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:07:16,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:07:16,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2024-11-07 11:07:16,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 127 transitions, 836 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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:07:16,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:16,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2024-11-07 11:07:16,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:18,383 INFO L124 PetriNetUnfolderBase]: 11622/20390 cut-off events. [2024-11-07 11:07:18,384 INFO L125 PetriNetUnfolderBase]: For 28865/29218 co-relation queries the response was YES. [2024-11-07 11:07:18,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59796 conditions, 20390 events. 11622/20390 cut-off events. For 28865/29218 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 167348 event pairs, 2474 based on Foata normal form. 362/20656 useless extension candidates. Maximal degree in co-relation 56600. Up to 5490 conditions per place. [2024-11-07 11:07:18,471 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 163 selfloop transitions, 66 changer transitions 15/269 dead transitions. [2024-11-07 11:07:18,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 269 transitions, 1943 flow [2024-11-07 11:07:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 11:07:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 11:07:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 410 transitions. [2024-11-07 11:07:18,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.584045584045584 [2024-11-07 11:07:18,474 INFO L175 Difference]: Start difference. First operand has 102 places, 127 transitions, 836 flow. Second operand 13 states and 410 transitions. [2024-11-07 11:07:18,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 269 transitions, 1943 flow [2024-11-07 11:07:18,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 269 transitions, 1903 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-07 11:07:18,853 INFO L231 Difference]: Finished difference. Result has 116 places, 149 transitions, 1152 flow [2024-11-07 11:07:18,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1152, PETRI_PLACES=116, PETRI_TRANSITIONS=149} [2024-11-07 11:07:18,854 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 57 predicate places. [2024-11-07 11:07:18,854 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 149 transitions, 1152 flow [2024-11-07 11:07:18,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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:07:18,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:18,854 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] [2024-11-07 11:07:18,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:07:18,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 11:07:18,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash 447331159, now seen corresponding path program 1 times [2024-11-07 11:07:18,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:18,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327304146] [2024-11-07 11:07:18,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:18,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:07:18,922 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:07:18,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:07:18,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327304146] [2024-11-07 11:07:18,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327304146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:07:18,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:07:18,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 11:07:18,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798991969] [2024-11-07 11:07:18,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:07:18,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:07:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:07:18,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:07:18,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:07:18,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 54 [2024-11-07 11:07:18,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 149 transitions, 1152 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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:07:18,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:07:18,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 54 [2024-11-07 11:07:18,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:07:20,920 INFO L124 PetriNetUnfolderBase]: 12661/21860 cut-off events. [2024-11-07 11:07:20,920 INFO L125 PetriNetUnfolderBase]: For 36092/36542 co-relation queries the response was YES. [2024-11-07 11:07:20,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67044 conditions, 21860 events. 12661/21860 cut-off events. For 36092/36542 co-relation queries the response was YES. Maximal size of possible extension queue 1139. Compared 178233 event pairs, 2817 based on Foata normal form. 518/22151 useless extension candidates. Maximal degree in co-relation 64591. Up to 5895 conditions per place. [2024-11-07 11:07:21,001 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 169 selfloop transitions, 72 changer transitions 22/299 dead transitions. [2024-11-07 11:07:21,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 299 transitions, 2346 flow [2024-11-07 11:07:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 11:07:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 11:07:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 416 transitions. [2024-11-07 11:07:21,003 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-11-07 11:07:21,004 INFO L175 Difference]: Start difference. First operand has 116 places, 149 transitions, 1152 flow. Second operand 13 states and 416 transitions. [2024-11-07 11:07:21,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 299 transitions, 2346 flow [2024-11-07 11:07:21,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 299 transitions, 2332 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-07 11:07:21,252 INFO L231 Difference]: Finished difference. Result has 131 places, 171 transitions, 1525 flow [2024-11-07 11:07:21,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1525, PETRI_PLACES=131, PETRI_TRANSITIONS=171} [2024-11-07 11:07:21,253 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places. [2024-11-07 11:07:21,253 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 171 transitions, 1525 flow [2024-11-07 11:07:21,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 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:07:21,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:07:21,253 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] [2024-11-07 11:07:21,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:07:21,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-07 11:07:21,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:07:21,254 INFO L85 PathProgramCache]: Analyzing trace with hash 437649175, now seen corresponding path program 1 times [2024-11-07 11:07:21,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:07:21,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54780651] [2024-11-07 11:07:21,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:07:21,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:07:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:07:21,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 11:07:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 11:07:21,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 11:07:21,329 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 11:07:21,330 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-07 11:07:21,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-07 11:07:21,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-07 11:07:21,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-07 11:07:21,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-07 11:07:21,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-07 11:07:21,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-07 11:07:21,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:07:21,333 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-07 11:07:21,383 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:07:21,383 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:07:21,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:07:21 BasicIcfg [2024-11-07 11:07:21,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:07:21,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:07:21,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:07:21,391 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:07:21,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:07:08" (3/4) ... [2024-11-07 11:07:21,392 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 11:07:21,453 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:07:21,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:07:21,454 INFO L158 Benchmark]: Toolchain (without parser) took 13595.80ms. Allocated memory was 100.7MB in the beginning and 822.1MB in the end (delta: 721.4MB). Free memory was 75.2MB in the beginning and 277.2MB in the end (delta: -202.0MB). Peak memory consumption was 519.7MB. Max. memory is 16.1GB. [2024-11-07 11:07:21,455 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:07:21,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.77ms. Allocated memory is still 100.7MB. Free memory was 75.0MB in the beginning and 55.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:07:21,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 100.7MB. Free memory was 55.3MB in the beginning and 53.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:07:21,456 INFO L158 Benchmark]: Boogie Preprocessor took 33.76ms. Allocated memory is still 100.7MB. Free memory was 53.5MB in the beginning and 52.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:07:21,456 INFO L158 Benchmark]: RCFGBuilder took 473.52ms. Allocated memory is still 100.7MB. Free memory was 52.0MB in the beginning and 70.6MB in the end (delta: -18.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2024-11-07 11:07:21,456 INFO L158 Benchmark]: TraceAbstraction took 12494.31ms. Allocated memory was 100.7MB in the beginning and 822.1MB in the end (delta: 721.4MB). Free memory was 70.1MB in the beginning and 281.5MB in the end (delta: -211.4MB). Peak memory consumption was 507.4MB. Max. memory is 16.1GB. [2024-11-07 11:07:21,457 INFO L158 Benchmark]: Witness Printer took 62.94ms. Allocated memory is still 822.1MB. Free memory was 281.5MB in the beginning and 277.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:07:21,458 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.77ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.77ms. Allocated memory is still 100.7MB. Free memory was 75.0MB in the beginning and 55.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 100.7MB. Free memory was 55.3MB in the beginning and 53.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.76ms. Allocated memory is still 100.7MB. Free memory was 53.5MB in the beginning and 52.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 473.52ms. Allocated memory is still 100.7MB. Free memory was 52.0MB in the beginning and 70.6MB in the end (delta: -18.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12494.31ms. Allocated memory was 100.7MB in the beginning and 822.1MB in the end (delta: 721.4MB). Free memory was 70.1MB in the beginning and 281.5MB in the end (delta: -211.4MB). Peak memory consumption was 507.4MB. Max. memory is 16.1GB. * Witness Printer took 62.94ms. Allocated memory is still 822.1MB. Free memory was 281.5MB in the beginning and 277.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] 4 reach_error() VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: 749]: 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: 750]: 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: 751]: 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: 752]: 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, 76 locations, 7 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: 12.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 684 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1757 IncrementalHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 84 mSDtfsCounter, 1757 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1525occurred in iteration=6, InterpolantAutomatonStates: 59, 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-07 11:07:21,486 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