./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-divine/condvar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-divine/condvar.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 20:57:38,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:57:38,825 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-21 20:57:38,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:57:38,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:57:38,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:57:38,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:57:38,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:57:38,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 20:57:38,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 20:57:38,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:57:38,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:57:38,860 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:57:38,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:57:38,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 20:57:38,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 20:57:38,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:57:38,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 20:57:38,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:57:38,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 20:57:38,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 20:57:38,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 20:57:38,865 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 20:57:38,865 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 20:57:38,866 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 20:57:38,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 20:57:38,867 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:57:38,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:57:38,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:57:38,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 20:57:38,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:57:38,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:57:38,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 20:57:38,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 20:57:38,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:57:38,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 20:57:38,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 20:57:38,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 20:57:38,871 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 20:57:38,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 20:57:38,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 20:57:38,872 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_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/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_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) 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 -> 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a [2023-11-21 20:57:39,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:57:39,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:57:39,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:57:39,139 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:57:39,139 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:57:39,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-divine/condvar.i [2023-11-21 20:57:42,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:57:42,640 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:57:42,641 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/sv-benchmarks/c/pthread-divine/condvar.i [2023-11-21 20:57:42,657 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/data/4abfdc925/1d5d85034a7e48a0b1305c0eda5325f0/FLAG7a44762a5 [2023-11-21 20:57:42,673 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/data/4abfdc925/1d5d85034a7e48a0b1305c0eda5325f0 [2023-11-21 20:57:42,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:57:42,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:57:42,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:57:42,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:57:42,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:57:42,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:57:42" (1/1) ... [2023-11-21 20:57:42,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c48426e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:42, skipping insertion in model container [2023-11-21 20:57:42,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:57:42" (1/1) ... [2023-11-21 20:57:42,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:57:42,907 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 20:57:43,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:57:43,171 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:57:43,192 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 20:57:43,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:57:43,273 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 20:57:43,281 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:57:43,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43 WrapperNode [2023-11-21 20:57:43,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:57:43,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:57:43,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:57:43,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:57:43,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,344 INFO L138 Inliner]: procedures = 170, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2023-11-21 20:57:43,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:57:43,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:57:43,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:57:43,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:57:43,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,386 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:57:43,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:57:43,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:57:43,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:57:43,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (1/1) ... [2023-11-21 20:57:43,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:57:43,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:43,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:43,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 20:57:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 20:57:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 20:57:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-21 20:57:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 20:57:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 20:57:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 20:57:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 20:57:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 20:57:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 20:57:43,509 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-21 20:57:43,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:57:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:57:43,513 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 20:57:43,660 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:57:43,662 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:57:43,931 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:57:43,958 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:57:43,958 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 20:57:43,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:57:43 BoogieIcfgContainer [2023-11-21 20:57:43,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:57:43,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 20:57:43,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 20:57:43,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 20:57:43,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:57:42" (1/3) ... [2023-11-21 20:57:43,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a818312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:57:43, skipping insertion in model container [2023-11-21 20:57:43,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:43" (2/3) ... [2023-11-21 20:57:43,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a818312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:57:43, skipping insertion in model container [2023-11-21 20:57:43,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:57:43" (3/3) ... [2023-11-21 20:57:43,969 INFO L112 eAbstractionObserver]: Analyzing ICFG condvar.i [2023-11-21 20:57:43,979 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 20:57:43,991 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 20:57:43,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-21 20:57:43,991 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 20:57:44,067 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 20:57:44,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 103 transitions, 213 flow [2023-11-21 20:57:44,164 INFO L124 PetriNetUnfolderBase]: 6/102 cut-off events. [2023-11-21 20:57:44,164 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-21 20:57:44,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 102 events. 6/102 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 153 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-11-21 20:57:44,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 103 transitions, 213 flow [2023-11-21 20:57:44,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 95 transitions, 193 flow [2023-11-21 20:57:44,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 20:57:44,195 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f20ca86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:57:44,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-21 20:57:44,218 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 20:57:44,219 INFO L124 PetriNetUnfolderBase]: 1/51 cut-off events. [2023-11-21 20:57:44,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 20:57:44,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:44,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:44,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:44,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash 296098665, now seen corresponding path program 1 times [2023-11-21 20:57:44,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951381770] [2023-11-21 20:57:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:44,543 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-21 20:57:44,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951381770] [2023-11-21 20:57:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951381770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:44,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282103315] [2023-11-21 20:57:44,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:44,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:44,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:44,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 103 [2023-11-21 20:57:44,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 95 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-21 20:57:44,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:44,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 103 [2023-11-21 20:57:44,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:44,686 INFO L124 PetriNetUnfolderBase]: 9/173 cut-off events. [2023-11-21 20:57:44,686 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-21 20:57:44,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 173 events. 9/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 599 event pairs, 1 based on Foata normal form. 12/162 useless extension candidates. Maximal degree in co-relation 162. Up to 15 conditions per place. [2023-11-21 20:57:44,690 INFO L140 encePairwiseOnDemand]: 95/103 looper letters, 12 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-11-21 20:57:44,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 223 flow [2023-11-21 20:57:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-11-21 20:57:44,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.941747572815534 [2023-11-21 20:57:44,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-11-21 20:57:44,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-11-21 20:57:44,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:44,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-11-21 20:57:44,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-21 20:57:44,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:44,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:44,724 INFO L175 Difference]: Start difference. First operand has 93 places, 95 transitions, 193 flow. Second operand 3 states and 291 transitions. [2023-11-21 20:57:44,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 223 flow [2023-11-21 20:57:44,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 95 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 20:57:44,733 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 206 flow [2023-11-21 20:57:44,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2023-11-21 20:57:44,739 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2023-11-21 20:57:44,740 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 206 flow [2023-11-21 20:57:44,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-21 20:57:44,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:44,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:44,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 20:57:44,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:44,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash 24872077, now seen corresponding path program 1 times [2023-11-21 20:57:44,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:44,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121518535] [2023-11-21 20:57:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:44,908 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-21 20:57:44,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:44,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121518535] [2023-11-21 20:57:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121518535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:44,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:44,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:44,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946280576] [2023-11-21 20:57:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:44,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:44,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:44,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:44,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 103 [2023-11-21 20:57:44,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-21 20:57:44,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:44,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 103 [2023-11-21 20:57:44,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:45,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([251] L704-4-->L704-1: Formula: (= |v_#race~x_set~0_4| 0) InVars {} OutVars{#race~x_set~0=|v_#race~x_set~0_4|} AuxVars[] AssignedVars[#race~x_set~0][46], [106#(= |#race~x_set~0| 0), threadThread1of1ForFork0InUse, 110#true, 36#L704-1true, 48#L715-3true, Black: 104#true]) [2023-11-21 20:57:45,026 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2023-11-21 20:57:45,026 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2023-11-21 20:57:45,026 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-21 20:57:45,027 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2023-11-21 20:57:45,034 INFO L124 PetriNetUnfolderBase]: 42/316 cut-off events. [2023-11-21 20:57:45,034 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-21 20:57:45,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 316 events. 42/316 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1460 event pairs, 11 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 390. Up to 50 conditions per place. [2023-11-21 20:57:45,039 INFO L140 encePairwiseOnDemand]: 98/103 looper letters, 15 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-11-21 20:57:45,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 99 transitions, 258 flow [2023-11-21 20:57:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-11-21 20:57:45,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.889967637540453 [2023-11-21 20:57:45,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-11-21 20:57:45,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-11-21 20:57:45,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:45,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-11-21 20:57:45,045 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-21 20:57:45,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:45,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:45,047 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 206 flow. Second operand 3 states and 275 transitions. [2023-11-21 20:57:45,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 99 transitions, 258 flow [2023-11-21 20:57:45,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 99 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:45,053 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 230 flow [2023-11-21 20:57:45,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2023-11-21 20:57:45,054 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 3 predicate places. [2023-11-21 20:57:45,054 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 230 flow [2023-11-21 20:57:45,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-21 20:57:45,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:45,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:45,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 20:57:45,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:45,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash -787212999, now seen corresponding path program 1 times [2023-11-21 20:57:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827955599] [2023-11-21 20:57:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:45,132 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-21 20:57:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827955599] [2023-11-21 20:57:45,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827955599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:45,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:45,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:57:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165419359] [2023-11-21 20:57:45,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:45,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:45,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:45,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 103 [2023-11-21 20:57:45,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-21 20:57:45,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:45,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 103 [2023-11-21 20:57:45,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:45,204 INFO L124 PetriNetUnfolderBase]: 18/268 cut-off events. [2023-11-21 20:57:45,205 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-21 20:57:45,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 268 events. 18/268 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1151 event pairs, 3 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 339. Up to 25 conditions per place. [2023-11-21 20:57:45,208 INFO L140 encePairwiseOnDemand]: 99/103 looper letters, 9 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2023-11-21 20:57:45,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 98 transitions, 266 flow [2023-11-21 20:57:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-11-21 20:57:45,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9061488673139159 [2023-11-21 20:57:45,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-11-21 20:57:45,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-11-21 20:57:45,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:45,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-11-21 20:57:45,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-21 20:57:45,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:45,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:45,215 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 230 flow. Second operand 3 states and 280 transitions. [2023-11-21 20:57:45,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 98 transitions, 266 flow [2023-11-21 20:57:45,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 98 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:45,220 INFO L231 Difference]: Finished difference. Result has 98 places, 97 transitions, 250 flow [2023-11-21 20:57:45,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=98, PETRI_TRANSITIONS=97} [2023-11-21 20:57:45,221 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 5 predicate places. [2023-11-21 20:57:45,222 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 97 transitions, 250 flow [2023-11-21 20:57:45,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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-21 20:57:45,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:45,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:45,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 20:57:45,223 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:45,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash 827103228, now seen corresponding path program 1 times [2023-11-21 20:57:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576709767] [2023-11-21 20:57:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:45,362 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-21 20:57:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:45,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576709767] [2023-11-21 20:57:45,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576709767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:45,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:45,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:57:45,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307129265] [2023-11-21 20:57:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:45,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:45,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:45,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 103 [2023-11-21 20:57:45,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 250 flow. Second operand has 3 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-21 20:57:45,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:45,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 103 [2023-11-21 20:57:45,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:45,496 INFO L124 PetriNetUnfolderBase]: 54/480 cut-off events. [2023-11-21 20:57:45,496 INFO L125 PetriNetUnfolderBase]: For 66/74 co-relation queries the response was YES. [2023-11-21 20:57:45,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 480 events. 54/480 cut-off events. For 66/74 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2924 event pairs, 9 based on Foata normal form. 5/432 useless extension candidates. Maximal degree in co-relation 672. Up to 66 conditions per place. [2023-11-21 20:57:45,503 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 13 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2023-11-21 20:57:45,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 290 flow [2023-11-21 20:57:45,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-11-21 20:57:45,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8964401294498382 [2023-11-21 20:57:45,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-11-21 20:57:45,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-11-21 20:57:45,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:45,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-11-21 20:57:45,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-21 20:57:45,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:45,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:45,512 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 250 flow. Second operand 3 states and 277 transitions. [2023-11-21 20:57:45,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 290 flow [2023-11-21 20:57:45,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 102 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:45,521 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 254 flow [2023-11-21 20:57:45,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2023-11-21 20:57:45,524 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 6 predicate places. [2023-11-21 20:57:45,524 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 254 flow [2023-11-21 20:57:45,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-21 20:57:45,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:45,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:45,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 20:57:45,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:45,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash -390388896, now seen corresponding path program 1 times [2023-11-21 20:57:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:45,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597926826] [2023-11-21 20:57:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:45,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:45,795 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-21 20:57:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597926826] [2023-11-21 20:57:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597926826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:45,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:57:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914274642] [2023-11-21 20:57:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:45,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:45,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 103 [2023-11-21 20:57:45,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-21 20:57:45,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:45,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 103 [2023-11-21 20:57:45,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:45,883 INFO L124 PetriNetUnfolderBase]: 8/181 cut-off events. [2023-11-21 20:57:45,889 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-21 20:57:45,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 181 events. 8/181 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 607 event pairs, 0 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 193. Up to 14 conditions per place. [2023-11-21 20:57:45,892 INFO L140 encePairwiseOnDemand]: 100/103 looper letters, 9 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-11-21 20:57:45,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 94 transitions, 250 flow [2023-11-21 20:57:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-11-21 20:57:45,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2023-11-21 20:57:45,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-11-21 20:57:45,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-11-21 20:57:45,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:45,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-11-21 20:57:45,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-21 20:57:45,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:45,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:45,901 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 254 flow. Second operand 3 states and 282 transitions. [2023-11-21 20:57:45,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 94 transitions, 250 flow [2023-11-21 20:57:45,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 94 transitions, 234 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-21 20:57:45,909 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 214 flow [2023-11-21 20:57:45,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2023-11-21 20:57:45,913 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 2 predicate places. [2023-11-21 20:57:45,914 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 91 transitions, 214 flow [2023-11-21 20:57:45,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-21 20:57:45,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:45,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:45,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 20:57:45,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:45,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash 497549866, now seen corresponding path program 1 times [2023-11-21 20:57:45,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:45,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21612233] [2023-11-21 20:57:45,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:45,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:46,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21612233] [2023-11-21 20:57:46,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21612233] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:46,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55875138] [2023-11-21 20:57:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:46,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:46,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:46,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:46,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 20:57:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:46,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 20:57:46,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 20:57:46,276 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 20:57:46,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55875138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 20:57:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-21 20:57:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191687510] [2023-11-21 20:57:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:46,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:57:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:46,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:46,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:57:46,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 103 [2023-11-21 20:57:46,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-21 20:57:46,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:46,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 103 [2023-11-21 20:57:46,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:46,391 INFO L124 PetriNetUnfolderBase]: 50/304 cut-off events. [2023-11-21 20:57:46,393 INFO L125 PetriNetUnfolderBase]: For 21/23 co-relation queries the response was YES. [2023-11-21 20:57:46,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 304 events. 50/304 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1431 event pairs, 15 based on Foata normal form. 2/277 useless extension candidates. Maximal degree in co-relation 412. Up to 70 conditions per place. [2023-11-21 20:57:46,396 INFO L140 encePairwiseOnDemand]: 98/103 looper letters, 16 selfloop transitions, 6 changer transitions 0/99 dead transitions. [2023-11-21 20:57:46,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 99 transitions, 278 flow [2023-11-21 20:57:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:57:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-11-21 20:57:46,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.889967637540453 [2023-11-21 20:57:46,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-11-21 20:57:46,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-11-21 20:57:46,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:46,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-11-21 20:57:46,403 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-21 20:57:46,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:46,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 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-21 20:57:46,405 INFO L175 Difference]: Start difference. First operand has 95 places, 91 transitions, 214 flow. Second operand 3 states and 275 transitions. [2023-11-21 20:57:46,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 99 transitions, 278 flow [2023-11-21 20:57:46,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 99 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:46,424 INFO L231 Difference]: Finished difference. Result has 97 places, 95 transitions, 256 flow [2023-11-21 20:57:46,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=97, PETRI_TRANSITIONS=95} [2023-11-21 20:57:46,427 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 4 predicate places. [2023-11-21 20:57:46,428 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 256 flow [2023-11-21 20:57:46,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-21 20:57:46,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:46,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:46,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:46,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:46,645 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:46,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:46,645 INFO L85 PathProgramCache]: Analyzing trace with hash -786739994, now seen corresponding path program 1 times [2023-11-21 20:57:46,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:46,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761052772] [2023-11-21 20:57:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:46,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:46,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761052772] [2023-11-21 20:57:46,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761052772] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138493218] [2023-11-21 20:57:46,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:46,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:46,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:46,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:46,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 20:57:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:46,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 20:57:46,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:46,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:46,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138493218] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:46,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:46,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-21 20:57:46,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789853595] [2023-11-21 20:57:46,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:46,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 20:57:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:46,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 20:57:46,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-21 20:57:47,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 103 [2023-11-21 20:57:47,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 256 flow. Second operand has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 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-21 20:57:47,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:47,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 103 [2023-11-21 20:57:47,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:47,188 INFO L124 PetriNetUnfolderBase]: 75/409 cut-off events. [2023-11-21 20:57:47,188 INFO L125 PetriNetUnfolderBase]: For 49/52 co-relation queries the response was YES. [2023-11-21 20:57:47,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 409 events. 75/409 cut-off events. For 49/52 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1697 event pairs, 9 based on Foata normal form. 8/397 useless extension candidates. Maximal degree in co-relation 634. Up to 47 conditions per place. [2023-11-21 20:57:47,192 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 34 selfloop transitions, 9 changer transitions 0/124 dead transitions. [2023-11-21 20:57:47,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 124 transitions, 402 flow [2023-11-21 20:57:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 20:57:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-21 20:57:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 801 transitions. [2023-11-21 20:57:47,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8640776699029126 [2023-11-21 20:57:47,197 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 801 transitions. [2023-11-21 20:57:47,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 801 transitions. [2023-11-21 20:57:47,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:47,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 801 transitions. [2023-11-21 20:57:47,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.0) internal successors, (801), 9 states have internal predecessors, (801), 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-21 20:57:47,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 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-21 20:57:47,205 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 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-21 20:57:47,205 INFO L175 Difference]: Start difference. First operand has 97 places, 95 transitions, 256 flow. Second operand 9 states and 801 transitions. [2023-11-21 20:57:47,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 124 transitions, 402 flow [2023-11-21 20:57:47,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 124 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:57:47,210 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 294 flow [2023-11-21 20:57:47,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=294, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2023-11-21 20:57:47,212 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 13 predicate places. [2023-11-21 20:57:47,212 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 294 flow [2023-11-21 20:57:47,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.0) internal successors, (860), 10 states have internal predecessors, (860), 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-21 20:57:47,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:47,213 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:47,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:47,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:47,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:47,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2092506944, now seen corresponding path program 2 times [2023-11-21 20:57:47,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:47,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782813640] [2023-11-21 20:57:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782813640] [2023-11-21 20:57:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782813640] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676530293] [2023-11-21 20:57:47,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 20:57:47,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:47,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:47,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:47,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 20:57:47,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 20:57:47,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:57:47,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 20:57:47,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:47,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:48,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676530293] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:48,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:48,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-21 20:57:48,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519915076] [2023-11-21 20:57:48,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:48,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-21 20:57:48,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:48,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-21 20:57:48,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-21 20:57:48,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 103 [2023-11-21 20:57:48,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 294 flow. Second operand has 18 states, 18 states have (on average 86.05555555555556) internal successors, (1549), 18 states have internal predecessors, (1549), 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-21 20:57:48,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:48,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 103 [2023-11-21 20:57:48,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:48,562 INFO L124 PetriNetUnfolderBase]: 112/585 cut-off events. [2023-11-21 20:57:48,562 INFO L125 PetriNetUnfolderBase]: For 145/148 co-relation queries the response was YES. [2023-11-21 20:57:48,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 585 events. 112/585 cut-off events. For 145/148 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2353 event pairs, 12 based on Foata normal form. 16/581 useless extension candidates. Maximal degree in co-relation 1076. Up to 47 conditions per place. [2023-11-21 20:57:48,568 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 74 selfloop transitions, 21 changer transitions 0/176 dead transitions. [2023-11-21 20:57:48,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 176 transitions, 694 flow [2023-11-21 20:57:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 20:57:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-21 20:57:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1863 transitions. [2023-11-21 20:57:48,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8613037447988904 [2023-11-21 20:57:48,575 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1863 transitions. [2023-11-21 20:57:48,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1863 transitions. [2023-11-21 20:57:48,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:48,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1863 transitions. [2023-11-21 20:57:48,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 88.71428571428571) internal successors, (1863), 21 states have internal predecessors, (1863), 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-21 20:57:48,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 103.0) internal successors, (2266), 22 states have internal predecessors, (2266), 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-21 20:57:48,591 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 103.0) internal successors, (2266), 22 states have internal predecessors, (2266), 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-21 20:57:48,591 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 294 flow. Second operand 21 states and 1863 transitions. [2023-11-21 20:57:48,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 176 transitions, 694 flow [2023-11-21 20:57:48,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 176 transitions, 680 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-21 20:57:48,597 INFO L231 Difference]: Finished difference. Result has 130 places, 114 transitions, 418 flow [2023-11-21 20:57:48,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=418, PETRI_PLACES=130, PETRI_TRANSITIONS=114} [2023-11-21 20:57:48,599 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 37 predicate places. [2023-11-21 20:57:48,599 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 114 transitions, 418 flow [2023-11-21 20:57:48,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 86.05555555555556) internal successors, (1549), 18 states have internal predecessors, (1549), 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-21 20:57:48,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:48,601 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:48,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:48,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:48,823 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:48,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:48,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1503056226, now seen corresponding path program 3 times [2023-11-21 20:57:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:48,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418627813] [2023-11-21 20:57:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:49,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:49,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418627813] [2023-11-21 20:57:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418627813] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:49,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189163424] [2023-11-21 20:57:49,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 20:57:49,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:49,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:49,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:49,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 20:57:49,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-11-21 20:57:49,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:57:49,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-21 20:57:49,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:49,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189163424] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:50,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:50,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-11-21 20:57:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696510489] [2023-11-21 20:57:50,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:50,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 20:57:50,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:50,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 20:57:50,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-11-21 20:57:50,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 103 [2023-11-21 20:57:50,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 114 transitions, 418 flow. Second operand has 34 states, 34 states have (on average 86.02941176470588) internal successors, (2925), 34 states have internal predecessors, (2925), 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-21 20:57:50,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:50,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 103 [2023-11-21 20:57:50,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:51,159 INFO L124 PetriNetUnfolderBase]: 208/969 cut-off events. [2023-11-21 20:57:51,159 INFO L125 PetriNetUnfolderBase]: For 1079/1082 co-relation queries the response was YES. [2023-11-21 20:57:51,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2244 conditions, 969 events. 208/969 cut-off events. For 1079/1082 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3755 event pairs, 12 based on Foata normal form. 32/981 useless extension candidates. Maximal degree in co-relation 2188. Up to 108 conditions per place. [2023-11-21 20:57:51,168 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 154 selfloop transitions, 45 changer transitions 0/280 dead transitions. [2023-11-21 20:57:51,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 280 transitions, 1362 flow [2023-11-21 20:57:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-21 20:57:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-11-21 20:57:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3987 transitions. [2023-11-21 20:57:51,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8601941747572815 [2023-11-21 20:57:51,183 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 3987 transitions. [2023-11-21 20:57:51,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 3987 transitions. [2023-11-21 20:57:51,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:51,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 3987 transitions. [2023-11-21 20:57:51,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 88.6) internal successors, (3987), 45 states have internal predecessors, (3987), 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-21 20:57:51,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 103.0) internal successors, (4738), 46 states have internal predecessors, (4738), 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-21 20:57:51,217 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 103.0) internal successors, (4738), 46 states have internal predecessors, (4738), 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-21 20:57:51,217 INFO L175 Difference]: Start difference. First operand has 130 places, 114 transitions, 418 flow. Second operand 45 states and 3987 transitions. [2023-11-21 20:57:51,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 280 transitions, 1362 flow [2023-11-21 20:57:51,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 280 transitions, 1322 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-11-21 20:57:51,231 INFO L231 Difference]: Finished difference. Result has 177 places, 139 transitions, 696 flow [2023-11-21 20:57:51,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=696, PETRI_PLACES=177, PETRI_TRANSITIONS=139} [2023-11-21 20:57:51,233 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 84 predicate places. [2023-11-21 20:57:51,234 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 139 transitions, 696 flow [2023-11-21 20:57:51,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 86.02941176470588) internal successors, (2925), 34 states have internal predecessors, (2925), 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-21 20:57:51,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:51,236 INFO L208 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:51,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:51,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:51,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:51,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash -222096064, now seen corresponding path program 4 times [2023-11-21 20:57:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:51,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350219028] [2023-11-21 20:57:51,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:52,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350219028] [2023-11-21 20:57:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350219028] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:52,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054640507] [2023-11-21 20:57:52,744 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 20:57:52,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:52,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:52,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:52,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 20:57:52,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 20:57:52,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:57:52,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-21 20:57:52,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:53,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:54,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054640507] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:54,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:54,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2023-11-21 20:57:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437890702] [2023-11-21 20:57:54,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:54,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-21 20:57:54,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-21 20:57:54,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2023-11-21 20:57:54,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 103 [2023-11-21 20:57:54,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 139 transitions, 696 flow. Second operand has 66 states, 66 states have (on average 86.01515151515152) internal successors, (5677), 66 states have internal predecessors, (5677), 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-21 20:57:54,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:57:54,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 103 [2023-11-21 20:57:54,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:57:57,804 INFO L124 PetriNetUnfolderBase]: 523/1865 cut-off events. [2023-11-21 20:57:57,804 INFO L125 PetriNetUnfolderBase]: For 8808/8811 co-relation queries the response was YES. [2023-11-21 20:57:57,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 1865 events. 523/1865 cut-off events. For 8808/8811 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6790 event pairs, 9 based on Foata normal form. 64/1908 useless extension candidates. Maximal degree in co-relation 4961. Up to 255 conditions per place. [2023-11-21 20:57:57,823 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 314 selfloop transitions, 93 changer transitions 0/488 dead transitions. [2023-11-21 20:57:57,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 488 transitions, 2844 flow [2023-11-21 20:57:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-11-21 20:57:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-11-21 20:57:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 8235 transitions. [2023-11-21 20:57:57,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8596930786094582 [2023-11-21 20:57:57,840 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 8235 transitions. [2023-11-21 20:57:57,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 8235 transitions. [2023-11-21 20:57:57,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:57,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 8235 transitions. [2023-11-21 20:57:57,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 88.54838709677419) internal successors, (8235), 93 states have internal predecessors, (8235), 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-21 20:57:57,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 103.0) internal successors, (9682), 94 states have internal predecessors, (9682), 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-21 20:57:57,890 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 103.0) internal successors, (9682), 94 states have internal predecessors, (9682), 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-21 20:57:57,891 INFO L175 Difference]: Start difference. First operand has 177 places, 139 transitions, 696 flow. Second operand 93 states and 8235 transitions. [2023-11-21 20:57:57,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 488 transitions, 2844 flow [2023-11-21 20:57:57,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 488 transitions, 2756 flow, removed 26 selfloop flow, removed 18 redundant places. [2023-11-21 20:57:57,916 INFO L231 Difference]: Finished difference. Result has 268 places, 188 transitions, 1330 flow [2023-11-21 20:57:57,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=1330, PETRI_PLACES=268, PETRI_TRANSITIONS=188} [2023-11-21 20:57:57,918 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 175 predicate places. [2023-11-21 20:57:57,918 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 188 transitions, 1330 flow [2023-11-21 20:57:57,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 86.01515151515152) internal successors, (5677), 66 states have internal predecessors, (5677), 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-21 20:57:57,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:57:57,921 INFO L208 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:57,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:58,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:58,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:57:58,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:58,148 INFO L85 PathProgramCache]: Analyzing trace with hash 829138018, now seen corresponding path program 5 times [2023-11-21 20:57:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:58,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936293788] [2023-11-21 20:57:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:58:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 0 proven. 4216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:58:01,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:58:01,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936293788] [2023-11-21 20:58:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936293788] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:58:01,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095949874] [2023-11-21 20:58:01,625 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 20:58:01,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:58:01,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:58:01,627 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:58:01,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 20:58:01,810 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2023-11-21 20:58:01,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:58:01,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-21 20:58:01,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:58:02,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 0 proven. 4216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:58:02,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:58:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 0 proven. 4216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:58:05,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095949874] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:58:05,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:58:05,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 89 [2023-11-21 20:58:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946883378] [2023-11-21 20:58:05,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:58:05,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2023-11-21 20:58:05,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:58:05,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2023-11-21 20:58:05,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2023-11-21 20:58:05,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 103 [2023-11-21 20:58:05,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 188 transitions, 1330 flow. Second operand has 89 states, 89 states have (on average 86.03370786516854) internal successors, (7657), 89 states have internal predecessors, (7657), 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-21 20:58:05,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:58:05,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 103 [2023-11-21 20:58:05,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:58:11,397 INFO L124 PetriNetUnfolderBase]: 544/2313 cut-off events. [2023-11-21 20:58:11,397 INFO L125 PetriNetUnfolderBase]: For 28499/28502 co-relation queries the response was YES. [2023-11-21 20:58:11,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7158 conditions, 2313 events. 544/2313 cut-off events. For 28499/28502 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 8735 event pairs, 12 based on Foata normal form. 48/2341 useless extension candidates. Maximal degree in co-relation 7076. Up to 328 conditions per place. [2023-11-21 20:58:11,424 INFO L140 encePairwiseOnDemand]: 97/103 looper letters, 434 selfloop transitions, 129 changer transitions 0/644 dead transitions. [2023-11-21 20:58:11,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 644 transitions, 4198 flow [2023-11-21 20:58:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2023-11-21 20:58:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2023-11-21 20:58:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 11411 transitions. [2023-11-21 20:58:11,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8588093625348084 [2023-11-21 20:58:11,443 INFO L72 ComplementDD]: Start complementDD. Operand 129 states and 11411 transitions. [2023-11-21 20:58:11,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 11411 transitions. [2023-11-21 20:58:11,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:58:11,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 129 states and 11411 transitions. [2023-11-21 20:58:11,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 130 states, 129 states have (on average 88.45736434108527) internal successors, (11411), 129 states have internal predecessors, (11411), 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-21 20:58:11,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 130 states, 130 states have (on average 103.0) internal successors, (13390), 130 states have internal predecessors, (13390), 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-21 20:58:11,498 INFO L81 ComplementDD]: Finished complementDD. Result has 130 states, 130 states have (on average 103.0) internal successors, (13390), 130 states have internal predecessors, (13390), 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-21 20:58:11,499 INFO L175 Difference]: Start difference. First operand has 268 places, 188 transitions, 1330 flow. Second operand 129 states and 11411 transitions. [2023-11-21 20:58:11,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 644 transitions, 4198 flow [2023-11-21 20:58:11,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 644 transitions, 4054 flow, removed 30 selfloop flow, removed 42 redundant places. [2023-11-21 20:58:11,565 INFO L231 Difference]: Finished difference. Result has 367 places, 225 transitions, 1928 flow [2023-11-21 20:58:11,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=1928, PETRI_PLACES=367, PETRI_TRANSITIONS=225} [2023-11-21 20:58:11,567 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 274 predicate places. [2023-11-21 20:58:11,567 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 225 transitions, 1928 flow [2023-11-21 20:58:11,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 86.03370786516854) internal successors, (7657), 89 states have internal predecessors, (7657), 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-21 20:58:11,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:58:11,570 INFO L208 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:58:11,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 20:58:11,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:58:11,780 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-21 20:58:11,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:58:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1007257980, now seen corresponding path program 6 times [2023-11-21 20:58:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:58:11,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168487541] [2023-11-21 20:58:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:58:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:58:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:58:11,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:58:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:58:12,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:58:12,090 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 20:58:12,091 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2023-11-21 20:58:12,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2023-11-21 20:58:12,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2023-11-21 20:58:12,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2023-11-21 20:58:12,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2023-11-21 20:58:12,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2023-11-21 20:58:12,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2023-11-21 20:58:12,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2023-11-21 20:58:12,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 20:58:12,097 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2023-11-21 20:58:12,107 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 20:58:12,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 20:58:12,247 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated [2023-11-21 20:58:12,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post10 could not be translated [2023-11-21 20:58:12,293 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-21 20:58:12,293 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2023-11-21 20:58:12,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 08:58:12 BasicIcfg [2023-11-21 20:58:12,324 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 20:58:12,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 20:58:12,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 20:58:12,325 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 20:58:12,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:57:43" (3/4) ... [2023-11-21 20:58:12,328 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 20:58:12,329 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 20:58:12,330 INFO L158 Benchmark]: Toolchain (without parser) took 29652.32ms. Allocated memory was 153.1MB in the beginning and 486.5MB in the end (delta: 333.4MB). Free memory was 111.9MB in the beginning and 160.0MB in the end (delta: -48.2MB). Peak memory consumption was 286.2MB. Max. memory is 16.1GB. [2023-11-21 20:58:12,330 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 20:58:12,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.94ms. Allocated memory is still 153.1MB. Free memory was 111.5MB in the beginning and 90.9MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-21 20:58:12,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.07ms. Allocated memory is still 153.1MB. Free memory was 90.9MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 20:58:12,332 INFO L158 Benchmark]: Boogie Preprocessor took 66.79ms. Allocated memory is still 153.1MB. Free memory was 88.8MB in the beginning and 87.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 20:58:12,332 INFO L158 Benchmark]: RCFGBuilder took 546.98ms. Allocated memory is still 153.1MB. Free memory was 87.2MB in the beginning and 118.3MB in the end (delta: -31.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-11-21 20:58:12,333 INFO L158 Benchmark]: TraceAbstraction took 28361.77ms. Allocated memory was 153.1MB in the beginning and 486.5MB in the end (delta: 333.4MB). Free memory was 117.6MB in the beginning and 160.0MB in the end (delta: -42.4MB). Peak memory consumption was 290.9MB. Max. memory is 16.1GB. [2023-11-21 20:58:12,333 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 486.5MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 20:58:12,335 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.33ms. Allocated memory is still 107.0MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.94ms. Allocated memory is still 153.1MB. Free memory was 111.5MB in the beginning and 90.9MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.07ms. Allocated memory is still 153.1MB. Free memory was 90.9MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.79ms. Allocated memory is still 153.1MB. Free memory was 88.8MB in the beginning and 87.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 546.98ms. Allocated memory is still 153.1MB. Free memory was 87.2MB in the beginning and 118.3MB in the end (delta: -31.1MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 28361.77ms. Allocated memory was 153.1MB in the beginning and 486.5MB in the end (delta: 333.4MB). Free memory was 117.6MB in the beginning and 160.0MB in the end (delta: -42.4MB). Peak memory consumption was 290.9MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 486.5MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 704]: Data race detected [2023-11-21 20:58:12,461 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated [2023-11-21 20:58:12,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post10 could not be translated [2023-11-21 20:58:12,480 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-21 20:58:12,481 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated [2023-11-21 20:58:12,552 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre8 could not be translated [2023-11-21 20:58:12,558 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post10 could not be translated [2023-11-21 20:58:12,558 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-21 20:58:12,558 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet12 could not be translated Data race detected The following path leads to a data race: [L697] 0 pthread_mutex_t lock; VAL [lock={3:0}] [L698] 0 pthread_cond_t cond; VAL [cond={4:0}, lock={3:0}] [L699] 0 int x; VAL [cond={4:0}, lock={3:0}, x=0] [L700] 0 _Bool x_set = 0; VAL [cond={4:0}, lock={3:0}, x=0, x_set=0] [L711] 0 pthread_t t; VAL [cond={4:0}, lock={3:0}, t={7:0}, x=0, x_set=0] [L712] FCALL, FORK 0 pthread_create( &t, ((void *)0), thread, ((void *)0) ) VAL [cond={4:0}, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] 0 int i = 0; VAL [cond={4:0}, i=0, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=0, lock={3:0}, t={7:0}, x=0, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=0, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=1, lock={3:0}, t={7:0}, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=1, lock={3:0}, t={7:0}, x=0, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=1, lock={3:0}, t={7:0}, x=1, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=2, lock={3:0}, t={7:0}, x=1, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=2, lock={3:0}, t={7:0}, x=1, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=2, lock={3:0}, t={7:0}, x=2, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=3, lock={3:0}, t={7:0}, x=2, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=3, lock={3:0}, t={7:0}, x=2, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=3, lock={3:0}, t={7:0}, x=3, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=4, lock={3:0}, t={7:0}, x=3, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=4, lock={3:0}, t={7:0}, x=3, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=4, lock={3:0}, t={7:0}, x=4, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=5, lock={3:0}, t={7:0}, x=4, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=5, lock={3:0}, t={7:0}, x=4, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=5, lock={3:0}, t={7:0}, x=5, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=6, lock={3:0}, t={7:0}, x=5, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=6, lock={3:0}, t={7:0}, x=5, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=6, lock={3:0}, t={7:0}, x=6, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=7, lock={3:0}, t={7:0}, x=6, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=7, lock={3:0}, t={7:0}, x=6, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=7, lock={3:0}, t={7:0}, x=7, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=8, lock={3:0}, t={7:0}, x=7, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=8, lock={3:0}, t={7:0}, x=7, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=8, lock={3:0}, t={7:0}, x=8, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=9, lock={3:0}, t={7:0}, x=8, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=9, lock={3:0}, t={7:0}, x=8, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=9, lock={3:0}, t={7:0}, x=9, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=10, lock={3:0}, t={7:0}, x=9, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=10, lock={3:0}, t={7:0}, x=9, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=10, lock={3:0}, t={7:0}, x=10, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=11, lock={3:0}, t={7:0}, x=10, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=11, lock={3:0}, t={7:0}, x=10, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=11, lock={3:0}, t={7:0}, x=11, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=12, lock={3:0}, t={7:0}, x=11, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=12, lock={3:0}, t={7:0}, x=11, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=12, lock={3:0}, t={7:0}, x=12, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=13, lock={3:0}, t={7:0}, x=12, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=13, lock={3:0}, t={7:0}, x=12, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=13, lock={3:0}, t={7:0}, x=13, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=14, lock={3:0}, t={7:0}, x=13, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=14, lock={3:0}, t={7:0}, x=13, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=14, lock={3:0}, t={7:0}, x=14, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=15, lock={3:0}, t={7:0}, x=14, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=15, lock={3:0}, t={7:0}, x=14, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=15, lock={3:0}, t={7:0}, x=15, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=16, lock={3:0}, t={7:0}, x=15, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=16, lock={3:0}, t={7:0}, x=15, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=16, lock={3:0}, t={7:0}, x=16, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=17, lock={3:0}, t={7:0}, x=16, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=17, lock={3:0}, t={7:0}, x=16, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=17, lock={3:0}, t={7:0}, x=17, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=18, lock={3:0}, t={7:0}, x=17, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=18, lock={3:0}, t={7:0}, x=17, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=18, lock={3:0}, t={7:0}, x=18, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=19, lock={3:0}, t={7:0}, x=18, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=19, lock={3:0}, t={7:0}, x=18, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=19, lock={3:0}, t={7:0}, x=19, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=20, lock={3:0}, t={7:0}, x=19, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=20, lock={3:0}, t={7:0}, x=19, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=20, lock={3:0}, t={7:0}, x=20, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=21, lock={3:0}, t={7:0}, x=20, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=21, lock={3:0}, t={7:0}, x=20, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=21, lock={3:0}, t={7:0}, x=21, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=22, lock={3:0}, t={7:0}, x=21, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=22, lock={3:0}, t={7:0}, x=21, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=22, lock={3:0}, t={7:0}, x=22, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=23, lock={3:0}, t={7:0}, x=22, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=23, lock={3:0}, t={7:0}, x=22, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=23, lock={3:0}, t={7:0}, x=23, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=24, lock={3:0}, t={7:0}, x=23, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=24, lock={3:0}, t={7:0}, x=23, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=24, lock={3:0}, t={7:0}, x=24, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=25, lock={3:0}, t={7:0}, x=24, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=25, lock={3:0}, t={7:0}, x=24, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=25, lock={3:0}, t={7:0}, x=25, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=26, lock={3:0}, t={7:0}, x=25, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=26, lock={3:0}, t={7:0}, x=25, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=26, lock={3:0}, t={7:0}, x=26, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=27, lock={3:0}, t={7:0}, x=26, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=27, lock={3:0}, t={7:0}, x=26, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=27, lock={3:0}, t={7:0}, x=27, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=28, lock={3:0}, t={7:0}, x=27, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=28, lock={3:0}, t={7:0}, x=27, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=28, lock={3:0}, t={7:0}, x=28, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=29, lock={3:0}, t={7:0}, x=28, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=29, lock={3:0}, t={7:0}, x=28, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=29, lock={3:0}, t={7:0}, x=29, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=30, lock={3:0}, t={7:0}, x=29, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=30, lock={3:0}, t={7:0}, x=29, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=30, lock={3:0}, t={7:0}, x=30, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=31, lock={3:0}, t={7:0}, x=30, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=31, lock={3:0}, t={7:0}, x=30, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=31, lock={3:0}, t={7:0}, x=31, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=32, lock={3:0}, t={7:0}, x=31, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=32, lock={3:0}, t={7:0}, x=31, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=32, lock={3:0}, t={7:0}, x=32, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=33, lock={3:0}, t={7:0}, x=32, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=33, lock={3:0}, t={7:0}, x=32, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=33, lock={3:0}, t={7:0}, x=33, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=34, lock={3:0}, t={7:0}, x=33, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=34, lock={3:0}, t={7:0}, x=33, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=34, lock={3:0}, t={7:0}, x=34, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=35, lock={3:0}, t={7:0}, x=34, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=35, lock={3:0}, t={7:0}, x=34, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=35, lock={3:0}, t={7:0}, x=35, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=36, lock={3:0}, t={7:0}, x=35, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=36, lock={3:0}, t={7:0}, x=35, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=36, lock={3:0}, t={7:0}, x=36, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=37, lock={3:0}, t={7:0}, x=36, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=37, lock={3:0}, t={7:0}, x=36, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=37, lock={3:0}, t={7:0}, x=37, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=38, lock={3:0}, t={7:0}, x=37, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=38, lock={3:0}, t={7:0}, x=37, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=38, lock={3:0}, t={7:0}, x=38, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=39, lock={3:0}, t={7:0}, x=38, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=39, lock={3:0}, t={7:0}, x=38, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=39, lock={3:0}, t={7:0}, x=39, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=40, lock={3:0}, t={7:0}, x=39, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=40, lock={3:0}, t={7:0}, x=39, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=40, lock={3:0}, t={7:0}, x=40, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=41, lock={3:0}, t={7:0}, x=40, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=41, lock={3:0}, t={7:0}, x=40, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=41, lock={3:0}, t={7:0}, x=41, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=42, lock={3:0}, t={7:0}, x=41, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [cond={4:0}, i=42, lock={3:0}, t={7:0}, x=41, x_set=0] [L714] 0 x = i VAL [cond={4:0}, i=42, lock={3:0}, t={7:0}, x=42, x_set=0] [L713] 0 i++ VAL [cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=0] [L713] COND FALSE 0 !(i <= 42) VAL [cond={4:0}, i=43, lock={3:0}, t={7:0}, x=42, x_set=0] [L715] 0 x_set = 1 VAL [cond={4:0}, lock={3:0}, t={7:0}, x=42, x_set=1] [L704] 1 !x_set VAL [arg={0:0}, arg={0:0}, cond={4:0}, lock={3:0}, x=42, x_set=1] [L715] 0 x_set = 1 VAL [cond={4:0}, lock={3:0}, t={7:0}, x=42, x_set=1] [L704] 1 !x_set VAL [arg={0:0}, arg={0:0}, cond={4:0}, lock={3:0}, x=42, x_set=1] Now there is a data race on ~x_set~0 between C: x_set = 1 [715] and C: !x_set [704] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: 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: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 124 locations, 8 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: 28.0s, OverallIterations: 12, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3948 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3887 mSDsluCounter, 378 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 352 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2045 IncrementalHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 26 mSDtfsCounter, 2045 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1915 GetRequests, 1470 SyntacticMatches, 41 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13224 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1928occurred in iteration=11, InterpolantAutomatonStates: 315, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2321 NumberOfCodeBlocks, 2321 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 2629 ConstructedInterpolants, 0 QuantifiedInterpolants, 5891 SizeOfPredicates, 114 NumberOfNonLiveVariables, 1589 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 1/16211 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-21 20:58:12,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d4effe0b-b03a-4310-b360-d812db086fc1/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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