./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU --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 1bf1a57452cb04c4e0acc7059a368e9894233cf719b7dca68f11bd8477a0c6ed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:16:19,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:16:19,993 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:16:20,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:16:20,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:16:20,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:16:20,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:16:20,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:16:20,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:16:20,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:16:20,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:16:20,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:16:20,049 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:16:20,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:16:20,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:16:20,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:16:20,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:16:20,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:16:20,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:16:20,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:16:20,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:16:20,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:16:20,059 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:16:20,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:16:20,059 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:16:20,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:16:20,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:16:20,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:16:20,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:16:20,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:16:20,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:16:20,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:16:20,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:16:20,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:16:20,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:16:20,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:16:20,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:16:20,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:16:20,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:16:20,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:16:20,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:16:20,068 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_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/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_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 1bf1a57452cb04c4e0acc7059a368e9894233cf719b7dca68f11bd8477a0c6ed [2024-10-31 22:16:20,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:16:20,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:16:20,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:16:20,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:16:20,328 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:16:20,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i Unable to find full path for "g++" [2024-10-31 22:16:22,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:16:22,855 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:16:22,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/sv-benchmarks/c/goblint-regression/02-base_25-malloc_race_cp.i [2024-10-31 22:16:22,878 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/data/342d30188/8a4484810773430698f6631a7378baf9/FLAG4273f7d60 [2024-10-31 22:16:22,895 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/data/342d30188/8a4484810773430698f6631a7378baf9 [2024-10-31 22:16:22,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:16:22,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:16:22,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:16:22,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:16:22,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:16:22,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:16:22" (1/1) ... [2024-10-31 22:16:22,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8dbfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:22, skipping insertion in model container [2024-10-31 22:16:22,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:16:22" (1/1) ... [2024-10-31 22:16:22,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:16:23,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:16:23,733 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:16:23,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:16:23,942 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:16:23,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23 WrapperNode [2024-10-31 22:16:23,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:16:23,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:16:23,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:16:23,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:16:23,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:23,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:23,994 INFO L138 Inliner]: procedures = 365, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2024-10-31 22:16:23,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:16:23,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:16:23,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:16:23,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:16:24,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:24,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:24,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:24,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:24,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:24,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:24,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:24,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:24,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:16:24,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:16:24,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:16:24,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:16:24,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (1/1) ... [2024-10-31 22:16:24,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:16:24,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:16:24,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:16:24,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:16:24,100 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-31 22:16:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:16:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:16:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-31 22:16:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:16:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:16:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-31 22:16:24,101 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-31 22:16:24,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:16:24,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:16:24,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:16:24,103 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:16:24,255 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:16:24,257 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:16:24,515 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:16:24,515 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:16:24,560 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:16:24,560 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:16:24,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:16:24 BoogieIcfgContainer [2024-10-31 22:16:24,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:16:24,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:16:24,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:16:24,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:16:24,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:16:22" (1/3) ... [2024-10-31 22:16:24,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce4dec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:16:24, skipping insertion in model container [2024-10-31 22:16:24,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:16:23" (2/3) ... [2024-10-31 22:16:24,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce4dec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:16:24, skipping insertion in model container [2024-10-31 22:16:24,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:16:24" (3/3) ... [2024-10-31 22:16:24,570 INFO L112 eAbstractionObserver]: Analyzing ICFG 02-base_25-malloc_race_cp.i [2024-10-31 22:16:24,588 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:16:24,589 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-31 22:16:24,589 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:16:24,668 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:16:24,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 212 flow [2024-10-31 22:16:24,786 INFO L124 PetriNetUnfolderBase]: 0/103 cut-off events. [2024-10-31 22:16:24,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:16:24,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 103 events. 0/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-10-31 22:16:24,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 104 transitions, 212 flow [2024-10-31 22:16:24,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 103 transitions, 209 flow [2024-10-31 22:16:24,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:16:24,818 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61c03dd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:16:24,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-31 22:16:24,826 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:16:24,827 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-10-31 22:16:24,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:16:24,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:24,828 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:24,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:24,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:24,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2046640981, now seen corresponding path program 1 times [2024-10-31 22:16:24,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339376198] [2024-10-31 22:16:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:25,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:25,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339376198] [2024-10-31 22:16:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339376198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:25,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:25,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:25,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496872341] [2024-10-31 22:16:25,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:25,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:25,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:25,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:25,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:25,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2024-10-31 22:16:25,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 209 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) [2024-10-31 22:16:25,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:25,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2024-10-31 22:16:25,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:25,468 INFO L124 PetriNetUnfolderBase]: 12/234 cut-off events. [2024-10-31 22:16:25,468 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:16:25,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 234 events. 12/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 664 event pairs, 12 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 227. Up to 36 conditions per place. [2024-10-31 22:16:25,477 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2024-10-31 22:16:25,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 102 transitions, 233 flow [2024-10-31 22:16:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2024-10-31 22:16:25,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2024-10-31 22:16:25,498 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 209 flow. Second operand 3 states and 284 transitions. [2024-10-31 22:16:25,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 102 transitions, 233 flow [2024-10-31 22:16:25,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 102 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:25,511 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 210 flow [2024-10-31 22:16:25,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-10-31 22:16:25,519 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 0 predicate places. [2024-10-31 22:16:25,520 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 210 flow [2024-10-31 22:16:25,520 INFO L472 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) [2024-10-31 22:16:25,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:25,521 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:25,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:16:25,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:25,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:25,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1419190674, now seen corresponding path program 1 times [2024-10-31 22:16:25,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061596785] [2024-10-31 22:16:25,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:25,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:25,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:25,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061596785] [2024-10-31 22:16:25,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061596785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057478507] [2024-10-31 22:16:25,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:25,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:25,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:25,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2024-10-31 22:16:25,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 210 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) [2024-10-31 22:16:25,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:25,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2024-10-31 22:16:25,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:25,802 INFO L124 PetriNetUnfolderBase]: 9/200 cut-off events. [2024-10-31 22:16:25,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:16:25,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 200 events. 9/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 514 event pairs, 9 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 210. Up to 30 conditions per place. [2024-10-31 22:16:25,807 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 11 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-10-31 22:16:25,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 101 transitions, 234 flow [2024-10-31 22:16:25,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2024-10-31 22:16:25,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2024-10-31 22:16:25,810 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 210 flow. Second operand 3 states and 284 transitions. [2024-10-31 22:16:25,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 101 transitions, 234 flow [2024-10-31 22:16:25,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 101 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:16:25,816 INFO L231 Difference]: Finished difference. Result has 106 places, 101 transitions, 208 flow [2024-10-31 22:16:25,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=106, PETRI_TRANSITIONS=101} [2024-10-31 22:16:25,818 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -1 predicate places. [2024-10-31 22:16:25,819 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 101 transitions, 208 flow [2024-10-31 22:16:25,819 INFO L472 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) [2024-10-31 22:16:25,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:25,820 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:25,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:16:25,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:25,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash 177711188, now seen corresponding path program 1 times [2024-10-31 22:16:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:25,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705519374] [2024-10-31 22:16:25,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:25,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:25,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:25,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705519374] [2024-10-31 22:16:25,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705519374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:25,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:25,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:25,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953200503] [2024-10-31 22:16:25,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:25,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:25,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:25,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:25,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2024-10-31 22:16:25,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 101 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:25,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:25,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2024-10-31 22:16:25,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:25,975 INFO L124 PetriNetUnfolderBase]: 8/165 cut-off events. [2024-10-31 22:16:25,975 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:16:25,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 165 events. 8/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 400 event pairs, 8 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2024-10-31 22:16:25,977 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 9 selfloop transitions, 1 changer transitions 0/99 dead transitions. [2024-10-31 22:16:25,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 224 flow [2024-10-31 22:16:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2024-10-31 22:16:25,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-10-31 22:16:25,980 INFO L175 Difference]: Start difference. First operand has 106 places, 101 transitions, 208 flow. Second operand 3 states and 288 transitions. [2024-10-31 22:16:25,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 224 flow [2024-10-31 22:16:25,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:16:25,983 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 202 flow [2024-10-31 22:16:25,983 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-10-31 22:16:25,984 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2024-10-31 22:16:25,984 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 202 flow [2024-10-31 22:16:25,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:25,985 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:25,985 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:25,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:16:25,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:25,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1291684622, now seen corresponding path program 1 times [2024-10-31 22:16:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096176174] [2024-10-31 22:16:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:26,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:26,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096176174] [2024-10-31 22:16:26,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096176174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:26,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:26,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:16:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888469191] [2024-10-31 22:16:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:26,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:26,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:26,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:26,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:26,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2024-10-31 22:16:26,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:26,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:26,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2024-10-31 22:16:26,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:26,155 INFO L124 PetriNetUnfolderBase]: 16/249 cut-off events. [2024-10-31 22:16:26,156 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:16:26,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 249 events. 16/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 822 event pairs, 7 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 262. Up to 36 conditions per place. [2024-10-31 22:16:26,158 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 12 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2024-10-31 22:16:26,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 234 flow [2024-10-31 22:16:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-10-31 22:16:26,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9358974358974359 [2024-10-31 22:16:26,161 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 202 flow. Second operand 3 states and 292 transitions. [2024-10-31 22:16:26,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 234 flow [2024-10-31 22:16:26,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 101 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:26,165 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 211 flow [2024-10-31 22:16:26,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-10-31 22:16:26,166 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, -3 predicate places. [2024-10-31 22:16:26,167 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 211 flow [2024-10-31 22:16:26,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:26,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:26,167 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:26,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:16:26,168 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:26,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash 70069530, now seen corresponding path program 1 times [2024-10-31 22:16:26,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:26,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080966700] [2024-10-31 22:16:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080966700] [2024-10-31 22:16:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080966700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:26,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:26,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:16:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425219316] [2024-10-31 22:16:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:26,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:16:26,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:26,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:16:26,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:16:27,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 104 [2024-10-31 22:16:27,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:27,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:27,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 104 [2024-10-31 22:16:27,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:27,395 INFO L124 PetriNetUnfolderBase]: 231/839 cut-off events. [2024-10-31 22:16:27,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:16:27,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 839 events. 231/839 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4771 event pairs, 96 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1321. Up to 348 conditions per place. [2024-10-31 22:16:27,405 INFO L140 encePairwiseOnDemand]: 88/104 looper letters, 51 selfloop transitions, 41 changer transitions 0/163 dead transitions. [2024-10-31 22:16:27,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 163 transitions, 523 flow [2024-10-31 22:16:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:16:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:16:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 549 transitions. [2024-10-31 22:16:27,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8798076923076923 [2024-10-31 22:16:27,410 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 211 flow. Second operand 6 states and 549 transitions. [2024-10-31 22:16:27,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 163 transitions, 523 flow [2024-10-31 22:16:27,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 163 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:16:27,417 INFO L231 Difference]: Finished difference. Result has 113 places, 141 transitions, 469 flow [2024-10-31 22:16:27,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=113, PETRI_TRANSITIONS=141} [2024-10-31 22:16:27,418 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2024-10-31 22:16:27,419 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 141 transitions, 469 flow [2024-10-31 22:16:27,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:27,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:27,420 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:27,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:16:27,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:27,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash 87245971, now seen corresponding path program 1 times [2024-10-31 22:16:27,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:27,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310086676] [2024-10-31 22:16:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:27,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:27,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:27,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310086676] [2024-10-31 22:16:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310086676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:27,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:27,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:16:27,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385250516] [2024-10-31 22:16:27,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:27,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:16:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:27,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:16:27,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:16:28,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2024-10-31 22:16:28,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 141 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:28,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:28,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2024-10-31 22:16:28,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:28,394 INFO L124 PetriNetUnfolderBase]: 285/1134 cut-off events. [2024-10-31 22:16:28,394 INFO L125 PetriNetUnfolderBase]: For 318/367 co-relation queries the response was YES. [2024-10-31 22:16:28,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 1134 events. 285/1134 cut-off events. For 318/367 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7589 event pairs, 29 based on Foata normal form. 31/1130 useless extension candidates. Maximal degree in co-relation 2361. Up to 272 conditions per place. [2024-10-31 22:16:28,439 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 71 selfloop transitions, 48 changer transitions 0/216 dead transitions. [2024-10-31 22:16:28,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 216 transitions, 971 flow [2024-10-31 22:16:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:16:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:16:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2024-10-31 22:16:28,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9278846153846154 [2024-10-31 22:16:28,442 INFO L175 Difference]: Start difference. First operand has 113 places, 141 transitions, 469 flow. Second operand 6 states and 579 transitions. [2024-10-31 22:16:28,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 216 transitions, 971 flow [2024-10-31 22:16:28,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 216 transitions, 971 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:16:28,450 INFO L231 Difference]: Finished difference. Result has 123 places, 187 transitions, 875 flow [2024-10-31 22:16:28,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=875, PETRI_PLACES=123, PETRI_TRANSITIONS=187} [2024-10-31 22:16:28,451 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 16 predicate places. [2024-10-31 22:16:28,451 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 187 transitions, 875 flow [2024-10-31 22:16:28,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:28,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:28,452 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:28,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:16:28,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:28,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:28,453 INFO L85 PathProgramCache]: Analyzing trace with hash -587936594, now seen corresponding path program 1 times [2024-10-31 22:16:28,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:28,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274150820] [2024-10-31 22:16:28,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:28,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:28,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274150820] [2024-10-31 22:16:28,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274150820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:28,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:28,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:16:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455831356] [2024-10-31 22:16:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:28,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:16:28,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:28,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:16:28,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:16:28,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 104 [2024-10-31 22:16:28,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 187 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:28,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:28,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 104 [2024-10-31 22:16:28,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:28,625 INFO L124 PetriNetUnfolderBase]: 39/286 cut-off events. [2024-10-31 22:16:28,625 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-10-31 22:16:28,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 286 events. 39/286 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 967 event pairs, 4 based on Foata normal form. 2/275 useless extension candidates. Maximal degree in co-relation 499. Up to 64 conditions per place. [2024-10-31 22:16:28,627 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 2 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2024-10-31 22:16:28,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 120 transitions, 413 flow [2024-10-31 22:16:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:16:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:16:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2024-10-31 22:16:28,629 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.967948717948718 [2024-10-31 22:16:28,629 INFO L175 Difference]: Start difference. First operand has 123 places, 187 transitions, 875 flow. Second operand 3 states and 302 transitions. [2024-10-31 22:16:28,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 120 transitions, 413 flow [2024-10-31 22:16:28,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 120 transitions, 363 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-10-31 22:16:28,635 INFO L231 Difference]: Finished difference. Result has 116 places, 120 transitions, 359 flow [2024-10-31 22:16:28,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=359, PETRI_PLACES=116, PETRI_TRANSITIONS=120} [2024-10-31 22:16:28,636 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2024-10-31 22:16:28,636 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 120 transitions, 359 flow [2024-10-31 22:16:28,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:28,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:28,637 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:28,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:16:28,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:28,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:28,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1489826976, now seen corresponding path program 1 times [2024-10-31 22:16:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:28,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608918541] [2024-10-31 22:16:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608918541] [2024-10-31 22:16:29,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608918541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:29,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:29,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:16:29,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142373411] [2024-10-31 22:16:29,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:29,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:16:29,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:29,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:16:29,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:16:29,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 104 [2024-10-31 22:16:29,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 120 transitions, 359 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:29,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:29,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 104 [2024-10-31 22:16:29,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:29,433 INFO L124 PetriNetUnfolderBase]: 93/482 cut-off events. [2024-10-31 22:16:29,433 INFO L125 PetriNetUnfolderBase]: For 90/103 co-relation queries the response was YES. [2024-10-31 22:16:29,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 482 events. 93/482 cut-off events. For 90/103 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2169 event pairs, 20 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 918. Up to 197 conditions per place. [2024-10-31 22:16:29,436 INFO L140 encePairwiseOnDemand]: 93/104 looper letters, 46 selfloop transitions, 22 changer transitions 0/141 dead transitions. [2024-10-31 22:16:29,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 141 transitions, 569 flow [2024-10-31 22:16:29,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:16:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:16:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2024-10-31 22:16:29,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8189102564102564 [2024-10-31 22:16:29,439 INFO L175 Difference]: Start difference. First operand has 116 places, 120 transitions, 359 flow. Second operand 6 states and 511 transitions. [2024-10-31 22:16:29,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 141 transitions, 569 flow [2024-10-31 22:16:29,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 141 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:16:29,444 INFO L231 Difference]: Finished difference. Result has 125 places, 141 transitions, 537 flow [2024-10-31 22:16:29,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=537, PETRI_PLACES=125, PETRI_TRANSITIONS=141} [2024-10-31 22:16:29,445 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 18 predicate places. [2024-10-31 22:16:29,446 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 537 flow [2024-10-31 22:16:29,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:29,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:29,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:29,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:16:29,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:29,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1812481170, now seen corresponding path program 1 times [2024-10-31 22:16:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:29,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673822045] [2024-10-31 22:16:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:29,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:29,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673822045] [2024-10-31 22:16:29,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673822045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:29,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:29,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:16:29,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572792648] [2024-10-31 22:16:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:29,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:16:29,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:16:29,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:16:30,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2024-10-31 22:16:30,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 537 flow. Second operand has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:30,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:30,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2024-10-31 22:16:30,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:30,288 INFO L124 PetriNetUnfolderBase]: 195/735 cut-off events. [2024-10-31 22:16:30,288 INFO L125 PetriNetUnfolderBase]: For 309/316 co-relation queries the response was YES. [2024-10-31 22:16:30,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 735 events. 195/735 cut-off events. For 309/316 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4008 event pairs, 12 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 1782. Up to 295 conditions per place. [2024-10-31 22:16:30,294 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 56 selfloop transitions, 52 changer transitions 13/198 dead transitions. [2024-10-31 22:16:30,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 198 transitions, 1044 flow [2024-10-31 22:16:30,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:16:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:16:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2024-10-31 22:16:30,297 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8894230769230769 [2024-10-31 22:16:30,297 INFO L175 Difference]: Start difference. First operand has 125 places, 141 transitions, 537 flow. Second operand 6 states and 555 transitions. [2024-10-31 22:16:30,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 198 transitions, 1044 flow [2024-10-31 22:16:30,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 198 transitions, 1006 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-10-31 22:16:30,307 INFO L231 Difference]: Finished difference. Result has 135 places, 181 transitions, 952 flow [2024-10-31 22:16:30,309 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=135, PETRI_TRANSITIONS=181} [2024-10-31 22:16:30,310 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 28 predicate places. [2024-10-31 22:16:30,310 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 181 transitions, 952 flow [2024-10-31 22:16:30,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:30,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:30,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:30,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:16:30,313 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:30,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:30,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1380146183, now seen corresponding path program 1 times [2024-10-31 22:16:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:30,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21183639] [2024-10-31 22:16:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:31,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:31,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21183639] [2024-10-31 22:16:31,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21183639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:31,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:31,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:16:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589682284] [2024-10-31 22:16:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:31,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:16:31,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:16:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:16:31,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2024-10-31 22:16:31,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 181 transitions, 952 flow. Second operand has 12 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:31,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:31,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2024-10-31 22:16:31,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:32,287 INFO L124 PetriNetUnfolderBase]: 189/697 cut-off events. [2024-10-31 22:16:32,287 INFO L125 PetriNetUnfolderBase]: For 722/762 co-relation queries the response was YES. [2024-10-31 22:16:32,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 697 events. 189/697 cut-off events. For 722/762 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3753 event pairs, 18 based on Foata normal form. 21/711 useless extension candidates. Maximal degree in co-relation 2145. Up to 193 conditions per place. [2024-10-31 22:16:32,294 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 115 selfloop transitions, 39 changer transitions 20/235 dead transitions. [2024-10-31 22:16:32,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 235 transitions, 1684 flow [2024-10-31 22:16:32,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-31 22:16:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-31 22:16:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 998 transitions. [2024-10-31 22:16:32,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6854395604395604 [2024-10-31 22:16:32,298 INFO L175 Difference]: Start difference. First operand has 135 places, 181 transitions, 952 flow. Second operand 14 states and 998 transitions. [2024-10-31 22:16:32,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 235 transitions, 1684 flow [2024-10-31 22:16:32,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 235 transitions, 1633 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-10-31 22:16:32,313 INFO L231 Difference]: Finished difference. Result has 151 places, 189 transitions, 1096 flow [2024-10-31 22:16:32,313 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1096, PETRI_PLACES=151, PETRI_TRANSITIONS=189} [2024-10-31 22:16:32,314 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 44 predicate places. [2024-10-31 22:16:32,314 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 189 transitions, 1096 flow [2024-10-31 22:16:32,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:32,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:32,316 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:32,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:16:32,316 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:32,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1024159188, now seen corresponding path program 1 times [2024-10-31 22:16:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:32,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814239999] [2024-10-31 22:16:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:32,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814239999] [2024-10-31 22:16:32,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814239999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:32,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:32,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:16:32,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174643905] [2024-10-31 22:16:32,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:32,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:16:32,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:32,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:16:32,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:16:33,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 104 [2024-10-31 22:16:33,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 189 transitions, 1096 flow. Second operand has 12 states, 12 states have (on average 74.75) internal successors, (897), 12 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:33,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:33,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 104 [2024-10-31 22:16:33,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:34,298 INFO L124 PetriNetUnfolderBase]: 175/639 cut-off events. [2024-10-31 22:16:34,298 INFO L125 PetriNetUnfolderBase]: For 1067/1101 co-relation queries the response was YES. [2024-10-31 22:16:34,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 639 events. 175/639 cut-off events. For 1067/1101 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3310 event pairs, 4 based on Foata normal form. 23/660 useless extension candidates. Maximal degree in co-relation 2220. Up to 126 conditions per place. [2024-10-31 22:16:34,304 INFO L140 encePairwiseOnDemand]: 86/104 looper letters, 87 selfloop transitions, 68 changer transitions 11/235 dead transitions. [2024-10-31 22:16:34,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 235 transitions, 1801 flow [2024-10-31 22:16:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:16:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-31 22:16:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1035 transitions. [2024-10-31 22:16:34,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7655325443786982 [2024-10-31 22:16:34,309 INFO L175 Difference]: Start difference. First operand has 151 places, 189 transitions, 1096 flow. Second operand 13 states and 1035 transitions. [2024-10-31 22:16:34,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 235 transitions, 1801 flow [2024-10-31 22:16:34,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 235 transitions, 1759 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-10-31 22:16:34,328 INFO L231 Difference]: Finished difference. Result has 158 places, 197 transitions, 1388 flow [2024-10-31 22:16:34,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1388, PETRI_PLACES=158, PETRI_TRANSITIONS=197} [2024-10-31 22:16:34,330 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 51 predicate places. [2024-10-31 22:16:34,332 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 197 transitions, 1388 flow [2024-10-31 22:16:34,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 74.75) internal successors, (897), 12 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:34,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:34,333 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:34,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:16:34,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:34,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1647267624, now seen corresponding path program 1 times [2024-10-31 22:16:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:34,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937821301] [2024-10-31 22:16:34,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:34,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:34,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:34,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937821301] [2024-10-31 22:16:34,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937821301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:34,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:34,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:16:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844826813] [2024-10-31 22:16:34,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:34,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:16:34,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:34,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:16:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:16:35,519 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2024-10-31 22:16:35,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 197 transitions, 1388 flow. Second operand has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:35,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:35,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2024-10-31 22:16:35,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:36,160 INFO L124 PetriNetUnfolderBase]: 170/661 cut-off events. [2024-10-31 22:16:36,161 INFO L125 PetriNetUnfolderBase]: For 2024/2103 co-relation queries the response was YES. [2024-10-31 22:16:36,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 661 events. 170/661 cut-off events. For 2024/2103 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3544 event pairs, 15 based on Foata normal form. 43/698 useless extension candidates. Maximal degree in co-relation 2531. Up to 192 conditions per place. [2024-10-31 22:16:36,166 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 122 selfloop transitions, 35 changer transitions 12/231 dead transitions. [2024-10-31 22:16:36,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 231 transitions, 2092 flow [2024-10-31 22:16:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-31 22:16:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-31 22:16:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1125 transitions. [2024-10-31 22:16:36,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6760817307692307 [2024-10-31 22:16:36,171 INFO L175 Difference]: Start difference. First operand has 158 places, 197 transitions, 1388 flow. Second operand 16 states and 1125 transitions. [2024-10-31 22:16:36,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 231 transitions, 2092 flow [2024-10-31 22:16:36,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 231 transitions, 2062 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-31 22:16:36,194 INFO L231 Difference]: Finished difference. Result has 168 places, 193 transitions, 1394 flow [2024-10-31 22:16:36,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1394, PETRI_PLACES=168, PETRI_TRANSITIONS=193} [2024-10-31 22:16:36,196 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 61 predicate places. [2024-10-31 22:16:36,196 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 193 transitions, 1394 flow [2024-10-31 22:16:36,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:36,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:36,197 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:36,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:16:36,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:36,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2132507222, now seen corresponding path program 2 times [2024-10-31 22:16:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:36,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358964828] [2024-10-31 22:16:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:16:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:16:36,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:16:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358964828] [2024-10-31 22:16:36,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358964828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:16:36,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:16:36,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:16:36,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613681051] [2024-10-31 22:16:36,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:16:36,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:16:36,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:16:36,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:16:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:16:37,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 104 [2024-10-31 22:16:37,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 193 transitions, 1394 flow. Second operand has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:37,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:16:37,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 104 [2024-10-31 22:16:37,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:16:37,858 INFO L124 PetriNetUnfolderBase]: 165/646 cut-off events. [2024-10-31 22:16:37,858 INFO L125 PetriNetUnfolderBase]: For 2108/2139 co-relation queries the response was YES. [2024-10-31 22:16:37,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 646 events. 165/646 cut-off events. For 2108/2139 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3426 event pairs, 15 based on Foata normal form. 13/653 useless extension candidates. Maximal degree in co-relation 2560. Up to 192 conditions per place. [2024-10-31 22:16:37,864 INFO L140 encePairwiseOnDemand]: 90/104 looper letters, 118 selfloop transitions, 34 changer transitions 10/224 dead transitions. [2024-10-31 22:16:37,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 224 transitions, 2062 flow [2024-10-31 22:16:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-31 22:16:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-31 22:16:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1186 transitions. [2024-10-31 22:16:37,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.670814479638009 [2024-10-31 22:16:37,868 INFO L175 Difference]: Start difference. First operand has 168 places, 193 transitions, 1394 flow. Second operand 17 states and 1186 transitions. [2024-10-31 22:16:37,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 224 transitions, 2062 flow [2024-10-31 22:16:37,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 224 transitions, 1976 flow, removed 4 selfloop flow, removed 15 redundant places. [2024-10-31 22:16:37,893 INFO L231 Difference]: Finished difference. Result has 165 places, 188 transitions, 1339 flow [2024-10-31 22:16:37,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1339, PETRI_PLACES=165, PETRI_TRANSITIONS=188} [2024-10-31 22:16:37,894 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 58 predicate places. [2024-10-31 22:16:37,895 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 188 transitions, 1339 flow [2024-10-31 22:16:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 68.58333333333333) internal successors, (823), 12 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:16:37,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:16:37,895 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:37,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:16:37,896 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:16:37,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:16:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1762241086, now seen corresponding path program 1 times [2024-10-31 22:16:37,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:16:37,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481840106] [2024-10-31 22:16:37,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:16:37,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:16:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:16:37,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:16:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:16:37,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:16:37,993 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:16:37,994 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-10-31 22:16:37,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-31 22:16:37,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-31 22:16:37,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-31 22:16:37,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-31 22:16:37,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-31 22:16:37,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2024-10-31 22:16:37,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-31 22:16:37,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-31 22:16:37,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-31 22:16:37,998 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-10-31 22:16:37,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-10-31 22:16:37,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-31 22:16:37,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-31 22:16:37,999 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-31 22:16:37,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:16:38,000 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:16:38,076 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:16:38,076 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:16:38,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:16:38 BasicIcfg [2024-10-31 22:16:38,082 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:16:38,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:16:38,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:16:38,083 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:16:38,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:16:24" (3/4) ... [2024-10-31 22:16:38,085 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 22:16:38,168 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:16:38,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:16:38,169 INFO L158 Benchmark]: Toolchain (without parser) took 15267.13ms. Allocated memory was 155.2MB in the beginning and 276.8MB in the end (delta: 121.6MB). Free memory was 111.4MB in the beginning and 164.9MB in the end (delta: -53.5MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2024-10-31 22:16:38,169 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 125.8MB. Free memory was 66.3MB in the beginning and 66.1MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:16:38,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1039.81ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 107.6MB in the end (delta: 3.2MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-10-31 22:16:38,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.27ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 104.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:16:38,170 INFO L158 Benchmark]: Boogie Preprocessor took 32.37ms. Allocated memory is still 155.2MB. Free memory was 104.4MB in the beginning and 103.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:16:38,170 INFO L158 Benchmark]: RCFGBuilder took 531.77ms. Allocated memory is still 155.2MB. Free memory was 103.3MB in the beginning and 85.5MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 22:16:38,171 INFO L158 Benchmark]: TraceAbstraction took 13519.23ms. Allocated memory was 155.2MB in the beginning and 276.8MB in the end (delta: 121.6MB). Free memory was 84.6MB in the beginning and 172.3MB in the end (delta: -87.7MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-10-31 22:16:38,171 INFO L158 Benchmark]: Witness Printer took 85.32ms. Allocated memory is still 276.8MB. Free memory was 172.3MB in the beginning and 164.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-31 22:16:38,173 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.31ms. Allocated memory is still 125.8MB. Free memory was 66.3MB in the beginning and 66.1MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1039.81ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 107.6MB in the end (delta: 3.2MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.27ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 104.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.37ms. Allocated memory is still 155.2MB. Free memory was 104.4MB in the beginning and 103.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 531.77ms. Allocated memory is still 155.2MB. Free memory was 103.3MB in the beginning and 85.5MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13519.23ms. Allocated memory was 155.2MB in the beginning and 276.8MB in the end (delta: 121.6MB). Free memory was 84.6MB in the beginning and 172.3MB in the end (delta: -87.7MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Witness Printer took 85.32ms. Allocated memory is still 276.8MB. Free memory was 172.3MB in the beginning and 164.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1243]: Data race detected Data race detected The following path leads to a data race: [L1223] 0 int *x; VAL [x={0:0}] [L1224] 0 int *y; VAL [x={0:0}, y={0:0}] [L1225] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [m={1:0}, x={0:0}, y={0:0}] [L1234] 0 pthread_t id; VAL [m={1:0}, x={0:0}, y={0:0}] [L1235] 0 int *z; VAL [m={1:0}, x={0:0}, y={0:0}] [L1236] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L1237] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L1238] 0 z = y VAL [m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1239] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] EXPR 0 *x VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] EXPR 0 \read(*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1241] 0 printf("%d\n",*x) VAL [\old(arg)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1228] EXPR 1 *x VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1228] 1 *x = 3 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1243] EXPR 0 \read(*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L1229] EXPR 1 *y VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1229] 1 *y = 8 VAL [\old(arg)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L1243] 0 printf("%d\n",*z) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *y = 8 [1229] * C: *x = 3 [1228] * C: *x = 3 [1228] * C: x = malloc(sizeof(int)) [1236] * C: y = malloc(sizeof(int)) [1237] * C: *x = 3 [1228] * C: *x = 3 [1228] and C: printf("%d\n",*z) [1243] - UnprovableResult [Line: 1236]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1239]: 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: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: 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, 138 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1436 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1129 mSDsluCounter, 1258 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1195 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5066 IncrementalHoareTripleChecker+Invalid, 5298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 63 mSDtfsCounter, 5066 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1394occurred in iteration=12, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 668 ConstructedInterpolants, 0 QuantifiedInterpolants, 2320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-31 22:16:38,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_553c5805-c56c-4963-87ce-fa154d756ca0/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE