./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:25:58,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:25:59,071 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:25:59,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:25:59,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:25:59,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:25:59,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:25:59,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:25:59,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:25:59,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:25:59,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:25:59,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:25:59,134 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:25:59,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:25:59,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:25:59,137 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:25:59,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:25:59,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:25:59,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:25:59,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:25:59,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:25:59,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:25:59,140 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:25:59,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:25:59,141 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:25:59,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:25:59,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:25:59,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:25:59,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:25:59,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:25:59,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:25:59,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:25:59,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:25:59,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:25:59,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:25:59,146 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:25:59,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:25:59,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:25:59,147 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:25:59,147 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1d84228246cc640f111b0bf0907a0ec6838e3ee0e70770c8d77ae15dd23f4db [2023-11-06 22:25:59,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:25:59,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:25:59,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:25:59,508 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:25:59,510 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:25:59,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/rfi008.oepc.i [2023-11-06 22:26:02,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:26:02,893 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:26:02,894 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i [2023-11-06 22:26:02,912 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/data/85a89aaaf/b49e77615fc341cf94d440014d99d6e3/FLAGf561d9faf [2023-11-06 22:26:02,928 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/data/85a89aaaf/b49e77615fc341cf94d440014d99d6e3 [2023-11-06 22:26:02,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:26:02,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:26:02,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:02,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:26:02,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:26:02,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:02,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa741ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:02, skipping insertion in model container [2023-11-06 22:26:02,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:02" (1/1) ... [2023-11-06 22:26:03,053 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:26:03,287 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i[988,1001] [2023-11-06 22:26:03,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:03,651 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:26:03,668 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/sv-benchmarks/c/pthread-wmm/rfi008.oepc.i[988,1001] [2023-11-06 22:26:03,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:26:03,791 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:26:03,791 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:26:03,797 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:26:03,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03 WrapperNode [2023-11-06 22:26:03,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:26:03,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:03,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:26:03,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:26:03,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,886 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2023-11-06 22:26:03,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:26:03,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:26:03,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:26:03,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:26:03,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:26:03,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:26:03,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:26:03,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:26:03,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (1/1) ... [2023-11-06 22:26:03,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:26:03,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:26:03,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:26:03,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:26:04,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:26:04,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:26:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:26:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:26:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:26:04,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:26:04,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:26:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:26:04,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:26:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:26:04,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:26:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:26:04,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:26:04,028 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:26:04,165 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:26:04,167 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:26:04,650 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:26:04,851 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:26:04,852 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:26:04,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:04 BoogieIcfgContainer [2023-11-06 22:26:04,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:26:04,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:26:04,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:26:04,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:26:04,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:26:02" (1/3) ... [2023-11-06 22:26:04,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954564a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:04, skipping insertion in model container [2023-11-06 22:26:04,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:03" (2/3) ... [2023-11-06 22:26:04,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7954564a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:04, skipping insertion in model container [2023-11-06 22:26:04,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:04" (3/3) ... [2023-11-06 22:26:04,870 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.oepc.i [2023-11-06 22:26:04,885 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:26:04,898 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:26:04,899 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:26:04,899 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:26:04,994 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:26:05,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 198 flow [2023-11-06 22:26:05,118 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2023-11-06 22:26:05,119 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:26:05,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-06 22:26:05,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 198 flow [2023-11-06 22:26:05,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2023-11-06 22:26:05,135 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:26:05,151 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2023-11-06 22:26:05,156 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2023-11-06 22:26:05,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2023-11-06 22:26:05,197 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2023-11-06 22:26:05,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:26:05,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-06 22:26:05,201 INFO L119 LiptonReduction]: Number of co-enabled transitions 1324 [2023-11-06 22:26:09,251 INFO L134 LiptonReduction]: Checked pairs total: 3599 [2023-11-06 22:26:09,251 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-11-06 22:26:09,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:26:09,296 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fded927, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:26:09,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-06 22:26:09,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:26:09,300 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-06 22:26:09,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:26:09,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:26:09,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:26:09,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:26:09,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash 459958, now seen corresponding path program 1 times [2023-11-06 22:26:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:09,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662185699] [2023-11-06 22:26:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:09,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662185699] [2023-11-06 22:26:09,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662185699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:09,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:09,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:26:09,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236871274] [2023-11-06 22:26:09,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:09,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:09,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:26:09,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 181 [2023-11-06 22:26:09,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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) [2023-11-06 22:26:09,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:26:09,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 181 [2023-11-06 22:26:09,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:26:10,008 INFO L124 PetriNetUnfolderBase]: 184/333 cut-off events. [2023-11-06 22:26:10,009 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:26:10,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 333 events. 184/333 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1305 event pairs, 61 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 659. Up to 277 conditions per place. [2023-11-06 22:26:10,014 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 22 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2023-11-06 22:26:10,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 117 flow [2023-11-06 22:26:10,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:26:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-11-06 22:26:10,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064456721915286 [2023-11-06 22:26:10,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-11-06 22:26:10,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-11-06 22:26:10,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:26:10,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-11-06 22:26:10,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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) [2023-11-06 22:26:10,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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) [2023-11-06 22:26:10,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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) [2023-11-06 22:26:10,048 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 275 transitions. [2023-11-06 22:26:10,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 117 flow [2023-11-06 22:26:10,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:26:10,053 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-11-06 22:26:10,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-06 22:26:10,059 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-06 22:26:10,059 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-11-06 22:26:10,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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) [2023-11-06 22:26:10,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:26:10,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:10,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:26:10,061 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:26:10,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:10,061 INFO L85 PathProgramCache]: Analyzing trace with hash -374956255, now seen corresponding path program 1 times [2023-11-06 22:26:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465934690] [2023-11-06 22:26:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:10,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:10,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465934690] [2023-11-06 22:26:10,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465934690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:10,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:10,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:26:10,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312329851] [2023-11-06 22:26:10,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:10,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:26:10,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 181 [2023-11-06 22:26:10,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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) [2023-11-06 22:26:10,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:26:10,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 181 [2023-11-06 22:26:10,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:26:10,647 INFO L124 PetriNetUnfolderBase]: 207/360 cut-off events. [2023-11-06 22:26:10,648 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 22:26:10,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 360 events. 207/360 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1248 event pairs, 87 based on Foata normal form. 4/364 useless extension candidates. Maximal degree in co-relation 752. Up to 333 conditions per place. [2023-11-06 22:26:10,653 INFO L140 encePairwiseOnDemand]: 177/181 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-11-06 22:26:10,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 112 flow [2023-11-06 22:26:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:26:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-11-06 22:26:10,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732965009208103 [2023-11-06 22:26:10,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-11-06 22:26:10,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-11-06 22:26:10,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:26:10,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-11-06 22:26:10,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) [2023-11-06 22:26:10,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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) [2023-11-06 22:26:10,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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) [2023-11-06 22:26:10,679 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 3 states and 257 transitions. [2023-11-06 22:26:10,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 112 flow [2023-11-06 22:26:10,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:26:10,683 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 57 flow [2023-11-06 22:26:10,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-11-06 22:26:10,686 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-06 22:26:10,687 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 57 flow [2023-11-06 22:26:10,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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) [2023-11-06 22:26:10,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:26:10,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:10,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:26:10,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:26:10,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1356559676, now seen corresponding path program 1 times [2023-11-06 22:26:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:10,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819480363] [2023-11-06 22:26:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:10,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:11,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:11,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819480363] [2023-11-06 22:26:11,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819480363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:11,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:26:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598494169] [2023-11-06 22:26:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:11,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:26:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:26:11,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:26:11,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 181 [2023-11-06 22:26:11,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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) [2023-11-06 22:26:11,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:26:11,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 181 [2023-11-06 22:26:11,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:26:11,227 INFO L124 PetriNetUnfolderBase]: 157/280 cut-off events. [2023-11-06 22:26:11,228 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-06 22:26:11,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 280 events. 157/280 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 957 event pairs, 53 based on Foata normal form. 6/285 useless extension candidates. Maximal degree in co-relation 637. Up to 200 conditions per place. [2023-11-06 22:26:11,232 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-11-06 22:26:11,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 113 flow [2023-11-06 22:26:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:26:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2023-11-06 22:26:11,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48987108655616945 [2023-11-06 22:26:11,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 266 transitions. [2023-11-06 22:26:11,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 266 transitions. [2023-11-06 22:26:11,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:26:11,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 266 transitions. [2023-11-06 22:26:11,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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) [2023-11-06 22:26:11,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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) [2023-11-06 22:26:11,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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) [2023-11-06 22:26:11,241 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 57 flow. Second operand 3 states and 266 transitions. [2023-11-06 22:26:11,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 113 flow [2023-11-06 22:26:11,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:26:11,244 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 65 flow [2023-11-06 22:26:11,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-11-06 22:26:11,245 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2023-11-06 22:26:11,246 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 65 flow [2023-11-06 22:26:11,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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) [2023-11-06 22:26:11,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:26:11,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:11,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:26:11,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:26:11,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash 392404000, now seen corresponding path program 1 times [2023-11-06 22:26:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:11,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019593010] [2023-11-06 22:26:11,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:11,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:11,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:11,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019593010] [2023-11-06 22:26:11,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019593010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:11,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:11,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:26:11,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523679570] [2023-11-06 22:26:11,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:11,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:11,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:11,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:11,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:11,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 181 [2023-11-06 22:26:11,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 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) [2023-11-06 22:26:11,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:26:11,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 181 [2023-11-06 22:26:11,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:26:11,580 INFO L124 PetriNetUnfolderBase]: 179/316 cut-off events. [2023-11-06 22:26:11,580 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-06 22:26:11,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 316 events. 179/316 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1049 event pairs, 99 based on Foata normal form. 8/324 useless extension candidates. Maximal degree in co-relation 746. Up to 237 conditions per place. [2023-11-06 22:26:11,583 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 24 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-11-06 22:26:11,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 137 flow [2023-11-06 22:26:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:26:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:26:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2023-11-06 22:26:11,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47513812154696133 [2023-11-06 22:26:11,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2023-11-06 22:26:11,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2023-11-06 22:26:11,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:26:11,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2023-11-06 22:26:11,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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) [2023-11-06 22:26:11,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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) [2023-11-06 22:26:11,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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) [2023-11-06 22:26:11,590 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 65 flow. Second operand 3 states and 258 transitions. [2023-11-06 22:26:11,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 137 flow [2023-11-06 22:26:11,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:26:11,593 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 70 flow [2023-11-06 22:26:11,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-11-06 22:26:11,594 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-11-06 22:26:11,594 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 70 flow [2023-11-06 22:26:11,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 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) [2023-11-06 22:26:11,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:26:11,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:11,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:26:11,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:26:11,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1111630301, now seen corresponding path program 1 times [2023-11-06 22:26:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:11,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619303004] [2023-11-06 22:26:11,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:11,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:11,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:11,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619303004] [2023-11-06 22:26:11,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619303004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:11,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:11,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:11,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45210119] [2023-11-06 22:26:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:11,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:11,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:11,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:11,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 181 [2023-11-06 22:26:11,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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) [2023-11-06 22:26:11,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:26:11,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 181 [2023-11-06 22:26:11,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:26:11,943 INFO L124 PetriNetUnfolderBase]: 80/175 cut-off events. [2023-11-06 22:26:11,943 INFO L125 PetriNetUnfolderBase]: For 68/69 co-relation queries the response was YES. [2023-11-06 22:26:11,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 175 events. 80/175 cut-off events. For 68/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 619 event pairs, 16 based on Foata normal form. 28/202 useless extension candidates. Maximal degree in co-relation 423. Up to 66 conditions per place. [2023-11-06 22:26:11,945 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 23 selfloop transitions, 3 changer transitions 18/47 dead transitions. [2023-11-06 22:26:11,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 47 transitions, 236 flow [2023-11-06 22:26:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:26:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:26:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2023-11-06 22:26:11,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46298342541436466 [2023-11-06 22:26:11,948 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 419 transitions. [2023-11-06 22:26:11,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 419 transitions. [2023-11-06 22:26:11,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:26:11,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 419 transitions. [2023-11-06 22:26:11,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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) [2023-11-06 22:26:11,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 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) [2023-11-06 22:26:11,953 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 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) [2023-11-06 22:26:11,954 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 70 flow. Second operand 5 states and 419 transitions. [2023-11-06 22:26:11,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 47 transitions, 236 flow [2023-11-06 22:26:11,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:26:11,956 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 91 flow [2023-11-06 22:26:11,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2023-11-06 22:26:11,957 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2023-11-06 22:26:11,958 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 91 flow [2023-11-06 22:26:11,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 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) [2023-11-06 22:26:11,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:26:11,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:11,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:26:11,959 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:26:11,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1722382816, now seen corresponding path program 1 times [2023-11-06 22:26:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:11,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5772423] [2023-11-06 22:26:11,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:11,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:12,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:12,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5772423] [2023-11-06 22:26:12,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5772423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:12,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:12,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:26:12,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738616040] [2023-11-06 22:26:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:12,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:26:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:26:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:26:12,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 181 [2023-11-06 22:26:12,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 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) [2023-11-06 22:26:12,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:26:12,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 181 [2023-11-06 22:26:12,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:26:12,432 INFO L124 PetriNetUnfolderBase]: 32/86 cut-off events. [2023-11-06 22:26:12,432 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-06 22:26:12,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 86 events. 32/86 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 233 event pairs, 13 based on Foata normal form. 9/94 useless extension candidates. Maximal degree in co-relation 240. Up to 41 conditions per place. [2023-11-06 22:26:12,434 INFO L140 encePairwiseOnDemand]: 176/181 looper letters, 21 selfloop transitions, 5 changer transitions 9/38 dead transitions. [2023-11-06 22:26:12,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 213 flow [2023-11-06 22:26:12,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:26:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:26:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 486 transitions. [2023-11-06 22:26:12,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44751381215469616 [2023-11-06 22:26:12,438 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 486 transitions. [2023-11-06 22:26:12,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 486 transitions. [2023-11-06 22:26:12,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:26:12,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 486 transitions. [2023-11-06 22:26:12,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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) [2023-11-06 22:26:12,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 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) [2023-11-06 22:26:12,447 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 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) [2023-11-06 22:26:12,448 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 91 flow. Second operand 6 states and 486 transitions. [2023-11-06 22:26:12,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 213 flow [2023-11-06 22:26:12,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 186 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-06 22:26:12,452 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 90 flow [2023-11-06 22:26:12,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2023-11-06 22:26:12,453 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2023-11-06 22:26:12,454 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 90 flow [2023-11-06 22:26:12,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 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) [2023-11-06 22:26:12,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:26:12,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:12,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:26:12,455 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:26:12,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash 194552925, now seen corresponding path program 1 times [2023-11-06 22:26:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:12,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498080953] [2023-11-06 22:26:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:14,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:14,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498080953] [2023-11-06 22:26:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498080953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:14,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:14,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:26:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424591373] [2023-11-06 22:26:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:14,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:26:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:26:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:26:14,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 181 [2023-11-06 22:26:14,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 90 flow. Second operand has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 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) [2023-11-06 22:26:14,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:26:14,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 181 [2023-11-06 22:26:14,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:26:14,874 INFO L124 PetriNetUnfolderBase]: 32/101 cut-off events. [2023-11-06 22:26:14,875 INFO L125 PetriNetUnfolderBase]: For 87/88 co-relation queries the response was YES. [2023-11-06 22:26:14,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 101 events. 32/101 cut-off events. For 87/88 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 318 event pairs, 2 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 281. Up to 31 conditions per place. [2023-11-06 22:26:14,876 INFO L140 encePairwiseOnDemand]: 173/181 looper letters, 31 selfloop transitions, 9 changer transitions 12/55 dead transitions. [2023-11-06 22:26:14,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 345 flow [2023-11-06 22:26:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:26:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:26:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 670 transitions. [2023-11-06 22:26:14,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462707182320442 [2023-11-06 22:26:14,881 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 670 transitions. [2023-11-06 22:26:14,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 670 transitions. [2023-11-06 22:26:14,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:26:14,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 670 transitions. [2023-11-06 22:26:14,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 83.75) internal successors, (670), 8 states have internal predecessors, (670), 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) [2023-11-06 22:26:14,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 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) [2023-11-06 22:26:14,890 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 181.0) internal successors, (1629), 9 states have internal predecessors, (1629), 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) [2023-11-06 22:26:14,890 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 90 flow. Second operand 8 states and 670 transitions. [2023-11-06 22:26:14,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 345 flow [2023-11-06 22:26:14,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 298 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-06 22:26:14,897 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 141 flow [2023-11-06 22:26:14,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 22:26:14,899 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2023-11-06 22:26:14,899 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 141 flow [2023-11-06 22:26:14,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 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) [2023-11-06 22:26:14,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:26:14,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:14,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:26:14,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:26:14,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash -259946567, now seen corresponding path program 2 times [2023-11-06 22:26:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:14,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117622184] [2023-11-06 22:26:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:26:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:26:15,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:26:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117622184] [2023-11-06 22:26:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117622184] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:26:15,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:26:15,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:26:15,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954204729] [2023-11-06 22:26:15,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:26:15,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:26:15,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:26:15,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:26:15,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:26:15,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 181 [2023-11-06 22:26:15,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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) [2023-11-06 22:26:15,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:26:15,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 181 [2023-11-06 22:26:15,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:26:15,297 INFO L124 PetriNetUnfolderBase]: 40/122 cut-off events. [2023-11-06 22:26:15,298 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2023-11-06 22:26:15,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 122 events. 40/122 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 415 event pairs, 15 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 428. Up to 49 conditions per place. [2023-11-06 22:26:15,299 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 19 selfloop transitions, 1 changer transitions 24/45 dead transitions. [2023-11-06 22:26:15,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 319 flow [2023-11-06 22:26:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:26:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:26:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2023-11-06 22:26:15,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47651933701657456 [2023-11-06 22:26:15,302 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 345 transitions. [2023-11-06 22:26:15,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 345 transitions. [2023-11-06 22:26:15,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:26:15,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 345 transitions. [2023-11-06 22:26:15,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 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) [2023-11-06 22:26:15,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 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) [2023-11-06 22:26:15,306 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 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) [2023-11-06 22:26:15,306 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 141 flow. Second operand 4 states and 345 transitions. [2023-11-06 22:26:15,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 319 flow [2023-11-06 22:26:15,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 306 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:26:15,309 INFO L231 Difference]: Finished difference. Result has 41 places, 21 transitions, 103 flow [2023-11-06 22:26:15,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=41, PETRI_TRANSITIONS=21} [2023-11-06 22:26:15,310 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2023-11-06 22:26:15,311 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 21 transitions, 103 flow [2023-11-06 22:26:15,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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) [2023-11-06 22:26:15,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:26:15,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:15,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:26:15,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:26:15,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:26:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1893478651, now seen corresponding path program 3 times [2023-11-06 22:26:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:26:15,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811833299] [2023-11-06 22:26:15,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:26:15,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:26:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:26:15,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:26:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:26:15,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:26:15,495 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:26:15,496 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-06 22:26:15,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-06 22:26:15,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-06 22:26:15,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-06 22:26:15,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-06 22:26:15,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:26:15,505 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-11-06 22:26:15,513 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:26:15,513 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:26:15,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:26:15 BasicIcfg [2023-11-06 22:26:15,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:26:15,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:26:15,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:26:15,610 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:26:15,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:04" (3/4) ... [2023-11-06 22:26:15,612 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:26:15,721 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:26:15,722 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:26:15,723 INFO L158 Benchmark]: Toolchain (without parser) took 12790.31ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 100.5MB in the beginning and 227.9MB in the end (delta: -127.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-11-06 22:26:15,723 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 100.7MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:26:15,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.64ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 75.8MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:26:15,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.21ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 73.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:26:15,724 INFO L158 Benchmark]: Boogie Preprocessor took 39.56ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:26:15,725 INFO L158 Benchmark]: RCFGBuilder took 927.62ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 71.2MB in the beginning and 140.1MB in the end (delta: -69.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-11-06 22:26:15,725 INFO L158 Benchmark]: TraceAbstraction took 10751.17ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 139.1MB in the beginning and 235.2MB in the end (delta: -96.1MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. [2023-11-06 22:26:15,726 INFO L158 Benchmark]: Witness Printer took 112.22ms. Allocated memory is still 276.8MB. Free memory was 235.2MB in the beginning and 227.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:26:15,728 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.25ms. Allocated memory is still 100.7MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.64ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 75.8MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.21ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 73.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.56ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 927.62ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 71.2MB in the beginning and 140.1MB in the end (delta: -69.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10751.17ms. Allocated memory was 190.8MB in the beginning and 276.8MB in the end (delta: 86.0MB). Free memory was 139.1MB in the beginning and 235.2MB in the end (delta: -96.1MB). Peak memory consumption was 118.4MB. Max. memory is 16.1GB. * Witness Printer took 112.22ms. Allocated memory is still 276.8MB. Free memory was 235.2MB in the beginning and 227.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 98 PlacesBefore, 26 PlacesAfterwards, 93 TransitionsBefore, 20 TransitionsAfterwards, 1324 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 3599 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1627, independent: 1480, independent conditional: 0, independent unconditional: 1480, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 763, independent: 729, independent conditional: 0, independent unconditional: 729, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1627, independent: 751, independent conditional: 0, independent unconditional: 751, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 763, unknown conditional: 0, unknown unconditional: 763] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1721; [L832] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1721, ((void *)0), P0, ((void *)0))=-2, t1721={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 x$w_buff1 = x$w_buff0 [L744] 1 x$w_buff0 = 1 [L745] 1 x$w_buff1_used = x$w_buff0_used [L746] 1 x$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L748] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1722; [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 x$flush_delayed = weak$$choice2 [L757] 1 x$mem_tmp = x [L758] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L759] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L760] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L761] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L762] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L764] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = x [L766] 1 x = x$flush_delayed ? x$mem_tmp : x [L767] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L834] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1722, ((void *)0), P1, ((void *)0))=-1, t1721={5:0}, t1722={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L770] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 2 x$flush_delayed = weak$$choice2 [L796] 2 x$mem_tmp = x [L797] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L798] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L799] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L800] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L801] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L802] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L803] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 __unbuffered_p1_EBX = x [L805] 2 x = x$flush_delayed ? x$mem_tmp : x [L806] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L773] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L775] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L776] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L777] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L780] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1721={5:0}, t1722={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 19]: 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: 832]: 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: 834]: 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 5 procedures, 115 locations, 5 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: 10.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 585 IncrementalHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 23 mSDtfsCounter, 585 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=7, InterpolantAutomatonStates: 35, 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.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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! [2023-11-06 22:26:15,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8d1c636-a1ae-4170-8990-ecbe2702dcef/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE