./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu --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 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:04:47,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:04:48,048 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-19 08:04:48,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:04:48,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:04:48,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:04:48,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:04:48,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:04:48,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:04:48,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:04:48,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:04:48,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:04:48,101 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:04:48,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:04:48,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:04:48,102 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:04:48,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:04:48,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:04:48,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:04:48,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:04:48,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:04:48,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:04:48,109 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-19 08:04:48,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:04:48,110 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:04:48,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:04:48,111 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:04:48,112 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:04:48,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:04:48,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:04:48,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:04:48,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:04:48,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:04:48,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:04:48,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:04:48,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:04:48,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:04:48,115 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:04:48,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:04:48,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:04:48,116 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:04:48,116 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_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/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_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu 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 -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e [2023-11-19 08:04:48,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:04:48,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:04:48,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:04:48,418 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:04:48,418 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:04:48,420 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-19 08:04:51,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:04:51,917 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:04:51,917 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2023-11-19 08:04:51,939 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/data/7287c1645/beeb14e42c0b4d8d80d055c345c93c86/FLAG0124e6168 [2023-11-19 08:04:51,956 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/data/7287c1645/beeb14e42c0b4d8d80d055c345c93c86 [2023-11-19 08:04:51,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:04:51,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:04:51,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:04:51,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:04:51,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:04:51,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:51" (1/1) ... [2023-11-19 08:04:51,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba9eb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:51, skipping insertion in model container [2023-11-19 08:04:51,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:51" (1/1) ... [2023-11-19 08:04:52,054 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:04:52,239 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 08:04:52,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:04:52,594 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:04:52,606 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 08:04:52,646 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:04:52,710 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:04:52,718 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:04:52,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52 WrapperNode [2023-11-19 08:04:52,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:04:52,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:04:52,721 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:04:52,721 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:04:52,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,785 INFO L138 Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-19 08:04:52,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:04:52,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:04:52,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:04:52,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:04:52,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:04:52,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:04:52,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:04:52,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:04:52,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (1/1) ... [2023-11-19 08:04:52,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:04:52,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:52,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:04:52,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:04:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:04:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 08:04:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:04:52,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 08:04:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:04:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:04:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 08:04:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-19 08:04:52,942 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-19 08:04:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:04:52,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:04:52,947 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:04:53,167 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:04:53,169 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:04:53,639 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:04:53,669 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:04:53,670 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 08:04:53,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:53 BoogieIcfgContainer [2023-11-19 08:04:53,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:04:53,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:04:53,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:04:53,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:04:53,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:04:51" (1/3) ... [2023-11-19 08:04:53,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e240079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:53, skipping insertion in model container [2023-11-19 08:04:53,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:52" (2/3) ... [2023-11-19 08:04:53,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e240079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:53, skipping insertion in model container [2023-11-19 08:04:53,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:53" (3/3) ... [2023-11-19 08:04:53,696 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-19 08:04:53,705 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:04:53,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:04:53,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 08:04:53,717 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:04:53,784 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-19 08:04:53,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 136 transitions, 279 flow [2023-11-19 08:04:53,989 INFO L124 PetriNetUnfolderBase]: 6/219 cut-off events. [2023-11-19 08:04:53,989 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 08:04:53,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 219 events. 6/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 376 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. [2023-11-19 08:04:53,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 136 transitions, 279 flow [2023-11-19 08:04:54,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 136 transitions, 279 flow [2023-11-19 08:04:54,005 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:04:54,016 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 136 transitions, 279 flow [2023-11-19 08:04:54,020 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 136 transitions, 279 flow [2023-11-19 08:04:54,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 136 transitions, 279 flow [2023-11-19 08:04:54,103 INFO L124 PetriNetUnfolderBase]: 6/219 cut-off events. [2023-11-19 08:04:54,103 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 08:04:54,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 219 events. 6/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 376 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. [2023-11-19 08:04:54,107 INFO L119 LiptonReduction]: Number of co-enabled transitions 2366 [2023-11-19 08:04:57,840 INFO L134 LiptonReduction]: Checked pairs total: 11731 [2023-11-19 08:04:57,840 INFO L136 LiptonReduction]: Total number of compositions: 77 [2023-11-19 08:04:57,880 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:57,889 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7cba9dbe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:57,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-19 08:04:57,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:04:57,894 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-19 08:04:57,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:57,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:57,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 08:04:57,896 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 08:04:57,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash -608420815, now seen corresponding path program 1 times [2023-11-19 08:04:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:57,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086912516] [2023-11-19 08:04:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:57,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086912516] [2023-11-19 08:04:58,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086912516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:58,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:58,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028705947] [2023-11-19 08:04:58,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:58,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:58,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:58,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:59,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 213 [2023-11-19 08:04:59,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:59,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:59,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 213 [2023-11-19 08:04:59,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:59,422 INFO L124 PetriNetUnfolderBase]: 53/283 cut-off events. [2023-11-19 08:04:59,422 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-19 08:04:59,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 283 events. 53/283 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1248 event pairs, 34 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 338. Up to 103 conditions per place. [2023-11-19 08:04:59,427 INFO L140 encePairwiseOnDemand]: 196/213 looper letters, 38 selfloop transitions, 10 changer transitions 5/82 dead transitions. [2023-11-19 08:04:59,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 277 flow [2023-11-19 08:04:59,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2023-11-19 08:04:59,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367762128325508 [2023-11-19 08:04:59,449 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2023-11-19 08:04:59,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2023-11-19 08:04:59,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:59,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2023-11-19 08:04:59,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:59,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:59,472 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:59,474 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 135 flow. Second operand 6 states and 686 transitions. [2023-11-19 08:04:59,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 277 flow [2023-11-19 08:04:59,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 277 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:59,482 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 189 flow [2023-11-19 08:04:59,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=189, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2023-11-19 08:04:59,488 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places. [2023-11-19 08:04:59,488 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 189 flow [2023-11-19 08:04:59,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:59,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:59,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:59,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:04:59,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 08:04:59,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1224284123, now seen corresponding path program 1 times [2023-11-19 08:04:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:59,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685582529] [2023-11-19 08:04:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685582529] [2023-11-19 08:04:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685582529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:59,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839048125] [2023-11-19 08:04:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:59,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:59,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:59,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:59,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:00,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 213 [2023-11-19 08:05:00,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:00,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 213 [2023-11-19 08:05:00,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:00,487 INFO L124 PetriNetUnfolderBase]: 56/269 cut-off events. [2023-11-19 08:05:00,487 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-19 08:05:00,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 269 events. 56/269 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1179 event pairs, 34 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 397. Up to 109 conditions per place. [2023-11-19 08:05:00,495 INFO L140 encePairwiseOnDemand]: 196/213 looper letters, 39 selfloop transitions, 10 changer transitions 4/80 dead transitions. [2023-11-19 08:05:00,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 80 transitions, 328 flow [2023-11-19 08:05:00,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2023-11-19 08:05:00,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367762128325508 [2023-11-19 08:05:00,501 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2023-11-19 08:05:00,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2023-11-19 08:05:00,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:00,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2023-11-19 08:05:00,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,512 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,515 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 189 flow. Second operand 6 states and 686 transitions. [2023-11-19 08:05:00,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 80 transitions, 328 flow [2023-11-19 08:05:00,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 317 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-19 08:05:00,526 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 243 flow [2023-11-19 08:05:00,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2023-11-19 08:05:00,529 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2023-11-19 08:05:00,530 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 243 flow [2023-11-19 08:05:00,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:00,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:00,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:05:00,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 08:05:00,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 491971963, now seen corresponding path program 1 times [2023-11-19 08:05:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:00,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800514314] [2023-11-19 08:05:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:00,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:05:00,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:00,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800514314] [2023-11-19 08:05:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800514314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:00,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:05:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282146843] [2023-11-19 08:05:00,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:00,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:05:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:00,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:05:00,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:05:00,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 213 [2023-11-19 08:05:00,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:00,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 213 [2023-11-19 08:05:00,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:00,836 INFO L124 PetriNetUnfolderBase]: 26/223 cut-off events. [2023-11-19 08:05:00,836 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-19 08:05:00,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 223 events. 26/223 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 890 event pairs, 12 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 340. Up to 74 conditions per place. [2023-11-19 08:05:00,840 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 24 selfloop transitions, 2 changer transitions 1/69 dead transitions. [2023-11-19 08:05:00,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 69 transitions, 289 flow [2023-11-19 08:05:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:05:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:05:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-11-19 08:05:00,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6056338028169014 [2023-11-19 08:05:00,843 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-11-19 08:05:00,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-11-19 08:05:00,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:00,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-11-19 08:05:00,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,850 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,850 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 243 flow. Second operand 4 states and 516 transitions. [2023-11-19 08:05:00,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 69 transitions, 289 flow [2023-11-19 08:05:00,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 69 transitions, 260 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-11-19 08:05:00,861 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 198 flow [2023-11-19 08:05:00,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2023-11-19 08:05:00,862 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2023-11-19 08:05:00,862 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 198 flow [2023-11-19 08:05:00,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:00,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:00,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:00,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:05:00,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 08:05:00,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1035156181, now seen corresponding path program 1 times [2023-11-19 08:05:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:00,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227275131] [2023-11-19 08:05:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:05:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227275131] [2023-11-19 08:05:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227275131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:05:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391808353] [2023-11-19 08:05:01,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:01,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:05:01,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:01,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:01,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:01,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 213 [2023-11-19 08:05:01,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 63 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:01,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:01,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 213 [2023-11-19 08:05:01,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:01,806 INFO L124 PetriNetUnfolderBase]: 248/657 cut-off events. [2023-11-19 08:05:01,806 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-11-19 08:05:01,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 657 events. 248/657 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3090 event pairs, 205 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 1303. Up to 546 conditions per place. [2023-11-19 08:05:01,812 INFO L140 encePairwiseOnDemand]: 203/213 looper letters, 60 selfloop transitions, 22 changer transitions 0/91 dead transitions. [2023-11-19 08:05:01,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 91 transitions, 418 flow [2023-11-19 08:05:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 582 transitions. [2023-11-19 08:05:01,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45539906103286387 [2023-11-19 08:05:01,816 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 582 transitions. [2023-11-19 08:05:01,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 582 transitions. [2023-11-19 08:05:01,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:01,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 582 transitions. [2023-11-19 08:05:01,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:01,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:01,823 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:01,824 INFO L175 Difference]: Start difference. First operand has 75 places, 63 transitions, 198 flow. Second operand 6 states and 582 transitions. [2023-11-19 08:05:01,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 91 transitions, 418 flow [2023-11-19 08:05:01,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 410 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:01,829 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 317 flow [2023-11-19 08:05:01,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2023-11-19 08:05:01,830 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2023-11-19 08:05:01,830 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 317 flow [2023-11-19 08:05:01,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:01,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:01,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:01,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:05:01,831 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 08:05:01,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1519922206, now seen corresponding path program 1 times [2023-11-19 08:05:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:01,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760884109] [2023-11-19 08:05:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:01,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:05:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760884109] [2023-11-19 08:05:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760884109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:02,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:02,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:05:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603502572] [2023-11-19 08:05:02,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:02,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:05:02,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:02,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:02,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:02,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 213 [2023-11-19 08:05:02,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:02,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:02,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 213 [2023-11-19 08:05:02,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:02,993 INFO L124 PetriNetUnfolderBase]: 144/493 cut-off events. [2023-11-19 08:05:02,993 INFO L125 PetriNetUnfolderBase]: For 262/286 co-relation queries the response was YES. [2023-11-19 08:05:02,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 493 events. 144/493 cut-off events. For 262/286 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2494 event pairs, 22 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 1142. Up to 184 conditions per place. [2023-11-19 08:05:02,998 INFO L140 encePairwiseOnDemand]: 203/213 looper letters, 73 selfloop transitions, 28 changer transitions 26/155 dead transitions. [2023-11-19 08:05:02,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 155 transitions, 844 flow [2023-11-19 08:05:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2023-11-19 08:05:03,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6384976525821596 [2023-11-19 08:05:03,002 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 816 transitions. [2023-11-19 08:05:03,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 816 transitions. [2023-11-19 08:05:03,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:03,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 816 transitions. [2023-11-19 08:05:03,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:03,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:03,010 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:03,010 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 317 flow. Second operand 6 states and 816 transitions. [2023-11-19 08:05:03,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 155 transitions, 844 flow [2023-11-19 08:05:03,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 155 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:05:03,017 INFO L231 Difference]: Finished difference. Result has 90 places, 96 transitions, 542 flow [2023-11-19 08:05:03,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=542, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2023-11-19 08:05:03,018 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places. [2023-11-19 08:05:03,019 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 542 flow [2023-11-19 08:05:03,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:03,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:03,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:03,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:05:03,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 08:05:03,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash -177309675, now seen corresponding path program 1 times [2023-11-19 08:05:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:03,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074263864] [2023-11-19 08:05:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 08:05:03,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074263864] [2023-11-19 08:05:03,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074263864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:03,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:03,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:05:03,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909751150] [2023-11-19 08:05:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:03,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:05:03,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:03,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:04,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 213 [2023-11-19 08:05:04,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:04,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:04,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 213 [2023-11-19 08:05:04,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:04,163 INFO L124 PetriNetUnfolderBase]: 84/372 cut-off events. [2023-11-19 08:05:04,163 INFO L125 PetriNetUnfolderBase]: For 490/519 co-relation queries the response was YES. [2023-11-19 08:05:04,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 372 events. 84/372 cut-off events. For 490/519 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1808 event pairs, 20 based on Foata normal form. 6/373 useless extension candidates. Maximal degree in co-relation 967. Up to 153 conditions per place. [2023-11-19 08:05:04,168 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 39 selfloop transitions, 0 changer transitions 21/103 dead transitions. [2023-11-19 08:05:04,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 676 flow [2023-11-19 08:05:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-11-19 08:05:04,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5594679186228482 [2023-11-19 08:05:04,188 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-11-19 08:05:04,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-11-19 08:05:04,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:04,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-11-19 08:05:04,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:04,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:04,195 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:04,195 INFO L175 Difference]: Start difference. First operand has 90 places, 96 transitions, 542 flow. Second operand 6 states and 715 transitions. [2023-11-19 08:05:04,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 676 flow [2023-11-19 08:05:04,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 652 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-11-19 08:05:04,202 INFO L231 Difference]: Finished difference. Result has 84 places, 82 transitions, 485 flow [2023-11-19 08:05:04,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=84, PETRI_TRANSITIONS=82} [2023-11-19 08:05:04,204 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places. [2023-11-19 08:05:04,204 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 485 flow [2023-11-19 08:05:04,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:04,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:04,205 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:04,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:05:04,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 08:05:04,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash 76386779, now seen corresponding path program 1 times [2023-11-19 08:05:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:04,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503742205] [2023-11-19 08:05:04,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:05:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503742205] [2023-11-19 08:05:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503742205] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:05,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579876115] [2023-11-19 08:05:05,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:05,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:05,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:05,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:05,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:05:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:05,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-19 08:05:05,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:05,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-11-19 08:05:06,050 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-19 08:05:06,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2023-11-19 08:05:06,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 08:05:06,849 INFO L349 Elim1Store]: treesize reduction 56, result has 36.4 percent of original size [2023-11-19 08:05:06,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 74 [2023-11-19 08:05:06,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:06,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 08:05:07,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 08:05:07,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-19 08:05:07,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-19 08:05:07,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-19 08:05:07,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-19 08:05:07,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-19 08:05:07,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-11-19 08:05:07,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-11-19 08:05:07,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:07,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:07,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:07,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:07,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:07,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 60 [2023-11-19 08:05:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:05:07,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:11,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-19 08:05:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:05:11,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579876115] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:05:11,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:05:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2023-11-19 08:05:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970879267] [2023-11-19 08:05:11,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:05:11,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-19 08:05:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:11,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-19 08:05:11,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1420, Unknown=20, NotChecked=0, Total=1640 [2023-11-19 08:05:19,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 213 [2023-11-19 08:05:19,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 485 flow. Second operand has 41 states, 41 states have (on average 47.5609756097561) internal successors, (1950), 41 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:19,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:19,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 213 [2023-11-19 08:05:19,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:22,382 INFO L124 PetriNetUnfolderBase]: 334/786 cut-off events. [2023-11-19 08:05:22,383 INFO L125 PetriNetUnfolderBase]: For 905/905 co-relation queries the response was YES. [2023-11-19 08:05:22,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 786 events. 334/786 cut-off events. For 905/905 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3526 event pairs, 13 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 2800. Up to 240 conditions per place. [2023-11-19 08:05:22,393 INFO L140 encePairwiseOnDemand]: 198/213 looper letters, 182 selfloop transitions, 46 changer transitions 0/229 dead transitions. [2023-11-19 08:05:22,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 229 transitions, 1781 flow [2023-11-19 08:05:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 08:05:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-19 08:05:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1077 transitions. [2023-11-19 08:05:22,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24077800134138164 [2023-11-19 08:05:22,400 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1077 transitions. [2023-11-19 08:05:22,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1077 transitions. [2023-11-19 08:05:22,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:22,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1077 transitions. [2023-11-19 08:05:22,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 51.285714285714285) internal successors, (1077), 21 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:22,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 213.0) internal successors, (4686), 22 states have internal predecessors, (4686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:22,415 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 213.0) internal successors, (4686), 22 states have internal predecessors, (4686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:22,416 INFO L175 Difference]: Start difference. First operand has 84 places, 82 transitions, 485 flow. Second operand 21 states and 1077 transitions. [2023-11-19 08:05:22,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 229 transitions, 1781 flow [2023-11-19 08:05:22,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 229 transitions, 1778 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:05:22,431 INFO L231 Difference]: Finished difference. Result has 96 places, 121 transitions, 959 flow [2023-11-19 08:05:22,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=959, PETRI_PLACES=96, PETRI_TRANSITIONS=121} [2023-11-19 08:05:22,432 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 30 predicate places. [2023-11-19 08:05:22,432 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 121 transitions, 959 flow [2023-11-19 08:05:22,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 47.5609756097561) internal successors, (1950), 41 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:22,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:22,434 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:22,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 08:05:22,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:22,648 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-19 08:05:22,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash 910749786, now seen corresponding path program 1 times [2023-11-19 08:05:22,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:22,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435196807] [2023-11-19 08:05:22,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:22,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:05:24,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:24,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435196807] [2023-11-19 08:05:24,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435196807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:24,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759206251] [2023-11-19 08:05:24,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:24,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:24,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:24,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ce2864-7de2-4935-9687-ce642fdc56ce/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:05:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-19 08:05:24,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:25,042 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-19 08:05:25,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 44 [2023-11-19 08:05:25,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:25,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 08:05:25,738 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-19 08:05:25,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2023-11-19 08:05:25,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:25,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 08:05:26,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:05:26,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-19 08:05:26,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-19 08:05:26,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-19 08:05:26,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:26,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2023-11-19 08:05:26,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:26,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 08:05:26,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 08:05:27,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:27,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 08:05:27,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:27,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 08:05:27,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:27,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-19 08:05:27,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:27,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:27,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:27,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:27,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:27,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 41 [2023-11-19 08:05:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:05:27,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:27,814 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse2) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse2) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse2) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= 0 (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse2) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))))) is different from false [2023-11-19 08:05:29,891 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0))))) is different from false [2023-11-19 08:05:31,978 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse4)))))))) is different from false [2023-11-19 08:05:34,088 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse7 0))) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_76| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))) (< |v_ULTIMATE.start_main_~i~1#1_76| .cse4))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_76| .cse4) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_76| .cse4) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse3)))))))) is different from false [2023-11-19 08:05:36,088 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0) .cse8 0) .cse10 0))) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse4))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_76| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_44| Int)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_546 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_545))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_76| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_44|) v_ArrVal_546))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_44| .cse4))) (< |v_ULTIMATE.start_main_~i~1#1_76| .cse0)))))) is different from false [2023-11-19 08:05:36,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:36,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-19 08:05:36,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:36,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 236 [2023-11-19 08:05:36,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 181 [2023-11-19 08:05:36,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2023-11-19 08:05:36,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 130 [2023-11-19 08:05:36,402 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-19 08:05:36,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-19 08:05:36,415 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-19 08:05:36,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-19 08:05:36,436 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-19 08:05:36,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-19 08:05:39,167 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_37| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_532))) (or (forall ((v_ArrVal_534 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_37| v_ArrVal_534) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_535 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_533))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_37| v_ArrVal_535) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1.base_37|)))) (forall ((v_ArrVal_532 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|)))) is different from false