./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version cf1a7837 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_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl --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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:06:36,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:06:36,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-12 02:06:36,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:06:36,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:06:36,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:06:36,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:06:36,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:06:36,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:06:36,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:06:36,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:06:36,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:06:36,473 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:06:36,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:06:36,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:06:36,475 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:06:36,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:06:36,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:06:36,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:06:36,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:06:36,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:06:36,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:06:36,479 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-12 02:06:36,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:06:36,480 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:06:36,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:06:36,482 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:06:36,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:06:36,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:06:36,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:06:36,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:06:36,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:06:36,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:06:36,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:06:36,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:06:36,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:06:36,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:06:36,496 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:06:36,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:06:36,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:06:36,497 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:06:36,498 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_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/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_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl 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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2023-11-12 02:06:36,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:06:36,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:06:36,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:06:36,863 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:06:36,864 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:06:36,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2023-11-12 02:06:39,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:06:40,269 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:06:40,270 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2023-11-12 02:06:40,290 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/data/64c8dfab8/ee89c9e315954f248916e9d910cadb6e/FLAGa90ce42ee [2023-11-12 02:06:40,307 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/data/64c8dfab8/ee89c9e315954f248916e9d910cadb6e [2023-11-12 02:06:40,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:06:40,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:06:40,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:06:40,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:06:40,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:06:40,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:06:40" (1/1) ... [2023-11-12 02:06:40,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eaed4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:40, skipping insertion in model container [2023-11-12 02:06:40,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:06:40" (1/1) ... [2023-11-12 02:06:40,396 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:06:40,672 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 02:06:40,934 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:06:40,944 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:06:40,959 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-12 02:06:40,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:06:41,042 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:06:41,051 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:06:41,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41 WrapperNode [2023-11-12 02:06:41,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:06:41,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:06:41,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:06:41,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:06:41,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,109 INFO L138 Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2023-11-12 02:06:41,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:06:41,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:06:41,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:06:41,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:06:41,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:06:41,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:06:41,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:06:41,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:06:41,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (1/1) ... [2023-11-12 02:06:41,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:06:41,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:06:41,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:06:41,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:06:41,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:06:41,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:06:41,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:06:41,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:06:41,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:06:41,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:06:41,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-12 02:06:41,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-12 02:06:41,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:06:41,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:06:41,286 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:06:41,459 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:06:41,461 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:06:41,785 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:06:41,794 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:06:41,794 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 02:06:41,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:41 BoogieIcfgContainer [2023-11-12 02:06:41,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:06:41,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:06:41,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:06:41,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:06:41,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:06:40" (1/3) ... [2023-11-12 02:06:41,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e70f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:06:41, skipping insertion in model container [2023-11-12 02:06:41,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:41" (2/3) ... [2023-11-12 02:06:41,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e70f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:06:41, skipping insertion in model container [2023-11-12 02:06:41,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:41" (3/3) ... [2023-11-12 02:06:41,807 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2023-11-12 02:06:41,817 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:06:41,828 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:06:41,828 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-12 02:06:41,828 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:06:41,898 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-12 02:06:41,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 209 flow [2023-11-12 02:06:42,082 INFO L124 PetriNetUnfolderBase]: 6/144 cut-off events. [2023-11-12 02:06:42,082 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-12 02:06:42,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 6/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 228 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. [2023-11-12 02:06:42,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 209 flow [2023-11-12 02:06:42,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 209 flow [2023-11-12 02:06:42,098 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:06:42,109 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 101 transitions, 209 flow [2023-11-12 02:06:42,113 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 101 transitions, 209 flow [2023-11-12 02:06:42,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 209 flow [2023-11-12 02:06:42,156 INFO L124 PetriNetUnfolderBase]: 6/144 cut-off events. [2023-11-12 02:06:42,156 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-12 02:06:42,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 6/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 228 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. [2023-11-12 02:06:42,160 INFO L119 LiptonReduction]: Number of co-enabled transitions 1568 [2023-11-12 02:06:44,985 INFO L134 LiptonReduction]: Checked pairs total: 6153 [2023-11-12 02:06:44,985 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-11-12 02:06:45,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:06:45,025 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;@1e4eb83b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:06:45,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-12 02:06:45,030 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:06:45,030 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-11-12 02:06:45,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:06:45,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:45,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:45,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 02:06:45,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash -325229742, now seen corresponding path program 1 times [2023-11-12 02:06:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:45,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590608544] [2023-11-12 02:06:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:45,878 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-12 02:06:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:45,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590608544] [2023-11-12 02:06:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590608544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:06:45,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912080450] [2023-11-12 02:06:45,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:45,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:06:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:45,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:06:45,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:06:46,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 171 [2023-11-12 02:06:46,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 83 flow. Second operand has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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-12 02:06:46,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:46,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 171 [2023-11-12 02:06:46,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:46,437 INFO L124 PetriNetUnfolderBase]: 135/359 cut-off events. [2023-11-12 02:06:46,437 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-12 02:06:46,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 359 events. 135/359 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1545 event pairs, 91 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 629. Up to 281 conditions per place. [2023-11-12 02:06:46,443 INFO L140 encePairwiseOnDemand]: 160/171 looper letters, 37 selfloop transitions, 21 changer transitions 0/65 dead transitions. [2023-11-12 02:06:46,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 253 flow [2023-11-12 02:06:46,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:06:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:06:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2023-11-12 02:06:46,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-11-12 02:06:46,463 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 456 transitions. [2023-11-12 02:06:46,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 456 transitions. [2023-11-12 02:06:46,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:46,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 456 transitions. [2023-11-12 02:06:46,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 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-12 02:06:46,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 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-12 02:06:46,481 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 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-12 02:06:46,483 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 83 flow. Second operand 6 states and 456 transitions. [2023-11-12 02:06:46,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 253 flow [2023-11-12 02:06:46,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 253 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:06:46,490 INFO L231 Difference]: Finished difference. Result has 48 places, 57 transitions, 205 flow [2023-11-12 02:06:46,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=48, PETRI_TRANSITIONS=57} [2023-11-12 02:06:46,496 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-12 02:06:46,496 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 205 flow [2023-11-12 02:06:46,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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-12 02:06:46,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:46,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:46,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:06:46,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 02:06:46,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:46,499 INFO L85 PathProgramCache]: Analyzing trace with hash -951007611, now seen corresponding path program 1 times [2023-11-12 02:06:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:46,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415939109] [2023-11-12 02:06:46,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:46,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:46,575 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-12 02:06:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415939109] [2023-11-12 02:06:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415939109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:46,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:06:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934453079] [2023-11-12 02:06:46,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:46,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:46,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:46,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:46,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 171 [2023-11-12 02:06:46,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 57 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 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-12 02:06:46,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:46,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 171 [2023-11-12 02:06:46,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:46,763 INFO L124 PetriNetUnfolderBase]: 48/206 cut-off events. [2023-11-12 02:06:46,763 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-12 02:06:46,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 206 events. 48/206 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 819 event pairs, 4 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 361. Up to 54 conditions per place. [2023-11-12 02:06:46,767 INFO L140 encePairwiseOnDemand]: 166/171 looper letters, 17 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2023-11-12 02:06:46,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 264 flow [2023-11-12 02:06:46,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:06:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:06:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2023-11-12 02:06:46,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2023-11-12 02:06:46,771 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 369 transitions. [2023-11-12 02:06:46,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 369 transitions. [2023-11-12 02:06:46,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:46,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 369 transitions. [2023-11-12 02:06:46,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 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-12 02:06:46,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 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-12 02:06:46,777 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 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-12 02:06:46,777 INFO L175 Difference]: Start difference. First operand has 48 places, 57 transitions, 205 flow. Second operand 4 states and 369 transitions. [2023-11-12 02:06:46,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 264 flow [2023-11-12 02:06:46,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:06:46,783 INFO L231 Difference]: Finished difference. Result has 53 places, 57 transitions, 217 flow [2023-11-12 02:06:46,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=53, PETRI_TRANSITIONS=57} [2023-11-12 02:06:46,784 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-11-12 02:06:46,784 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 217 flow [2023-11-12 02:06:46,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 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-12 02:06:46,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:46,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:46,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:06:46,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 02:06:46,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1460422206, now seen corresponding path program 1 times [2023-11-12 02:06:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:46,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142657618] [2023-11-12 02:06:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:47,243 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-12 02:06:47,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:47,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142657618] [2023-11-12 02:06:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142657618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:47,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:47,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:06:47,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455504047] [2023-11-12 02:06:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:47,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:06:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:47,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:06:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:06:47,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 171 [2023-11-12 02:06:47,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 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-12 02:06:47,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:47,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 171 [2023-11-12 02:06:47,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:47,791 INFO L124 PetriNetUnfolderBase]: 193/496 cut-off events. [2023-11-12 02:06:47,791 INFO L125 PetriNetUnfolderBase]: For 122/126 co-relation queries the response was YES. [2023-11-12 02:06:47,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 496 events. 193/496 cut-off events. For 122/126 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2280 event pairs, 39 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 1189. Up to 339 conditions per place. [2023-11-12 02:06:47,797 INFO L140 encePairwiseOnDemand]: 153/171 looper letters, 68 selfloop transitions, 57 changer transitions 5/137 dead transitions. [2023-11-12 02:06:47,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 723 flow [2023-11-12 02:06:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:06:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:06:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2023-11-12 02:06:47,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233918128654971 [2023-11-12 02:06:47,801 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 537 transitions. [2023-11-12 02:06:47,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions. [2023-11-12 02:06:47,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:47,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions. [2023-11-12 02:06:47,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 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-12 02:06:47,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 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-12 02:06:47,808 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 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-12 02:06:47,808 INFO L175 Difference]: Start difference. First operand has 53 places, 57 transitions, 217 flow. Second operand 6 states and 537 transitions. [2023-11-12 02:06:47,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 723 flow [2023-11-12 02:06:47,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 137 transitions, 691 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-12 02:06:47,816 INFO L231 Difference]: Finished difference. Result has 58 places, 108 transitions, 561 flow [2023-11-12 02:06:47,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=561, PETRI_PLACES=58, PETRI_TRANSITIONS=108} [2023-11-12 02:06:47,817 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-11-12 02:06:47,817 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 108 transitions, 561 flow [2023-11-12 02:06:47,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 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-12 02:06:47,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:47,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:47,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:06:47,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 02:06:47,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1174901276, now seen corresponding path program 1 times [2023-11-12 02:06:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:47,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693611867] [2023-11-12 02:06:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,145 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-12 02:06:48,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:48,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693611867] [2023-11-12 02:06:48,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693611867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:48,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:48,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:06:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428951894] [2023-11-12 02:06:48,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:48,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:06:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:06:48,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:06:48,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 171 [2023-11-12 02:06:48,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 108 transitions, 561 flow. Second operand has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 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-12 02:06:48,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:48,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 171 [2023-11-12 02:06:48,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:48,708 INFO L124 PetriNetUnfolderBase]: 200/559 cut-off events. [2023-11-12 02:06:48,709 INFO L125 PetriNetUnfolderBase]: For 328/340 co-relation queries the response was YES. [2023-11-12 02:06:48,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 559 events. 200/559 cut-off events. For 328/340 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2819 event pairs, 43 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 1725. Up to 369 conditions per place. [2023-11-12 02:06:48,716 INFO L140 encePairwiseOnDemand]: 160/171 looper letters, 87 selfloop transitions, 29 changer transitions 0/142 dead transitions. [2023-11-12 02:06:48,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 142 transitions, 967 flow [2023-11-12 02:06:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:06:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:06:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 477 transitions. [2023-11-12 02:06:48,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649122807017544 [2023-11-12 02:06:48,720 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 477 transitions. [2023-11-12 02:06:48,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 477 transitions. [2023-11-12 02:06:48,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:48,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 477 transitions. [2023-11-12 02:06:48,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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-12 02:06:48,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 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-12 02:06:48,727 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 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-12 02:06:48,728 INFO L175 Difference]: Start difference. First operand has 58 places, 108 transitions, 561 flow. Second operand 6 states and 477 transitions. [2023-11-12 02:06:48,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 142 transitions, 967 flow [2023-11-12 02:06:48,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 931 flow, removed 18 selfloop flow, removed 0 redundant places. [2023-11-12 02:06:48,744 INFO L231 Difference]: Finished difference. Result has 67 places, 132 transitions, 807 flow [2023-11-12 02:06:48,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=807, PETRI_PLACES=67, PETRI_TRANSITIONS=132} [2023-11-12 02:06:48,747 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-11-12 02:06:48,747 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 132 transitions, 807 flow [2023-11-12 02:06:48,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.83333333333333) internal successors, (437), 6 states have internal predecessors, (437), 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-12 02:06:48,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:48,748 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-12 02:06:48,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:06:48,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-12 02:06:48,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1829356559, now seen corresponding path program 1 times [2023-11-12 02:06:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:48,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673508722] [2023-11-12 02:06:48,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:06:48,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:06:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:06:48,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:06:48,831 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:06:48,833 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-12 02:06:48,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-12 02:06:48,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-12 02:06:48,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-12 02:06:48,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-12 02:06:48,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-12 02:06:48,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-12 02:06:48,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:06:48,841 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-12 02:06:48,844 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-12 02:06:48,844 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-12 02:06:48,880 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-12 02:06:48,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 254 flow [2023-11-12 02:06:48,927 INFO L124 PetriNetUnfolderBase]: 11/263 cut-off events. [2023-11-12 02:06:48,927 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-12 02:06:48,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 263 events. 11/263 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 507 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-11-12 02:06:48,929 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 119 transitions, 254 flow [2023-11-12 02:06:48,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 254 flow [2023-11-12 02:06:48,931 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:06:48,931 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 119 transitions, 254 flow [2023-11-12 02:06:48,931 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 119 transitions, 254 flow [2023-11-12 02:06:48,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 254 flow [2023-11-12 02:06:48,970 INFO L124 PetriNetUnfolderBase]: 11/263 cut-off events. [2023-11-12 02:06:48,970 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-12 02:06:48,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 263 events. 11/263 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 507 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-11-12 02:06:48,976 INFO L119 LiptonReduction]: Number of co-enabled transitions 4640 [2023-11-12 02:06:51,355 INFO L134 LiptonReduction]: Checked pairs total: 18628 [2023-11-12 02:06:51,356 INFO L136 LiptonReduction]: Total number of compositions: 70 [2023-11-12 02:06:51,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:06:51,360 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;@1e4eb83b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:06:51,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-12 02:06:51,363 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:06:51,363 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-11-12 02:06:51,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:06:51,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:51,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:51,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 02:06:51,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 544698254, now seen corresponding path program 1 times [2023-11-12 02:06:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:51,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125395551] [2023-11-12 02:06:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:51,659 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-12 02:06:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125395551] [2023-11-12 02:06:51,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125395551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:51,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:06:51,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107392659] [2023-11-12 02:06:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:51,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:06:51,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:51,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:06:51,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:06:51,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 189 [2023-11-12 02:06:51,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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-12 02:06:51,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:51,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 189 [2023-11-12 02:06:51,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:52,623 INFO L124 PetriNetUnfolderBase]: 2299/4146 cut-off events. [2023-11-12 02:06:52,624 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-12 02:06:52,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8044 conditions, 4146 events. 2299/4146 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23058 event pairs, 1715 based on Foata normal form. 0/3930 useless extension candidates. Maximal degree in co-relation 1116. Up to 3508 conditions per place. [2023-11-12 02:06:52,656 INFO L140 encePairwiseOnDemand]: 175/189 looper letters, 58 selfloop transitions, 37 changer transitions 0/106 dead transitions. [2023-11-12 02:06:52,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 418 flow [2023-11-12 02:06:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:06:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:06:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-11-12 02:06:52,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973544973544973 [2023-11-12 02:06:52,660 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-11-12 02:06:52,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-11-12 02:06:52,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:52,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-11-12 02:06:52,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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-12 02:06:52,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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-12 02:06:52,669 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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-12 02:06:52,669 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 124 flow. Second operand 6 states and 564 transitions. [2023-11-12 02:06:52,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 418 flow [2023-11-12 02:06:52,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 418 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:06:52,676 INFO L231 Difference]: Finished difference. Result has 66 places, 90 transitions, 336 flow [2023-11-12 02:06:52,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=66, PETRI_TRANSITIONS=90} [2023-11-12 02:06:52,682 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-11-12 02:06:52,682 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 336 flow [2023-11-12 02:06:52,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.16666666666667) internal successors, (475), 6 states have internal predecessors, (475), 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-12 02:06:52,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:52,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:52,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:06:52,684 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 02:06:52,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:52,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1649785077, now seen corresponding path program 1 times [2023-11-12 02:06:52,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:52,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388520564] [2023-11-12 02:06:52,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:52,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:52,747 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-12 02:06:52,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:52,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388520564] [2023-11-12 02:06:52,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388520564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:52,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:52,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:06:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652747936] [2023-11-12 02:06:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:52,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:52,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:52,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:52,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 189 [2023-11-12 02:06:52,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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-12 02:06:52,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:52,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 189 [2023-11-12 02:06:52,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:53,304 INFO L124 PetriNetUnfolderBase]: 776/1935 cut-off events. [2023-11-12 02:06:53,305 INFO L125 PetriNetUnfolderBase]: For 194/305 co-relation queries the response was YES. [2023-11-12 02:06:53,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 1935 events. 776/1935 cut-off events. For 194/305 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12621 event pairs, 347 based on Foata normal form. 0/1781 useless extension candidates. Maximal degree in co-relation 2708. Up to 853 conditions per place. [2023-11-12 02:06:53,327 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 28 selfloop transitions, 2 changer transitions 2/98 dead transitions. [2023-11-12 02:06:53,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 419 flow [2023-11-12 02:06:53,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:06:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:06:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-11-12 02:06:53,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.582010582010582 [2023-11-12 02:06:53,330 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-11-12 02:06:53,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-11-12 02:06:53,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:53,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-11-12 02:06:53,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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-12 02:06:53,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 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-12 02:06:53,335 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 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-12 02:06:53,336 INFO L175 Difference]: Start difference. First operand has 66 places, 90 transitions, 336 flow. Second operand 4 states and 440 transitions. [2023-11-12 02:06:53,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 419 flow [2023-11-12 02:06:53,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 98 transitions, 419 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:06:53,342 INFO L231 Difference]: Finished difference. Result has 71 places, 91 transitions, 352 flow [2023-11-12 02:06:53,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=71, PETRI_TRANSITIONS=91} [2023-11-12 02:06:53,343 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2023-11-12 02:06:53,343 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 352 flow [2023-11-12 02:06:53,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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-12 02:06:53,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:53,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:53,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:06:53,344 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 02:06:53,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:53,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1340624123, now seen corresponding path program 1 times [2023-11-12 02:06:53,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:53,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674915894] [2023-11-12 02:06:53,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:53,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:53,759 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-12 02:06:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674915894] [2023-11-12 02:06:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674915894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:06:53,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573239668] [2023-11-12 02:06:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:53,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:06:53,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:53,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:06:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:06:53,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 189 [2023-11-12 02:06:53,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-12 02:06:53,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:53,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 189 [2023-11-12 02:06:53,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:55,358 INFO L124 PetriNetUnfolderBase]: 3649/6392 cut-off events. [2023-11-12 02:06:55,359 INFO L125 PetriNetUnfolderBase]: For 1465/1507 co-relation queries the response was YES. [2023-11-12 02:06:55,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16539 conditions, 6392 events. 3649/6392 cut-off events. For 1465/1507 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 38365 event pairs, 1337 based on Foata normal form. 0/6007 useless extension candidates. Maximal degree in co-relation 16452. Up to 4916 conditions per place. [2023-11-12 02:06:55,422 INFO L140 encePairwiseOnDemand]: 163/189 looper letters, 131 selfloop transitions, 89 changer transitions 0/231 dead transitions. [2023-11-12 02:06:55,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 231 transitions, 1230 flow [2023-11-12 02:06:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:06:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:06:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2023-11-12 02:06:55,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978835978835979 [2023-11-12 02:06:55,431 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions. [2023-11-12 02:06:55,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions. [2023-11-12 02:06:55,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:55,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions. [2023-11-12 02:06:55,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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-12 02:06:55,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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-12 02:06:55,438 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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-12 02:06:55,438 INFO L175 Difference]: Start difference. First operand has 71 places, 91 transitions, 352 flow. Second operand 6 states and 678 transitions. [2023-11-12 02:06:55,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 231 transitions, 1230 flow [2023-11-12 02:06:55,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 231 transitions, 1204 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-12 02:06:55,458 INFO L231 Difference]: Finished difference. Result has 77 places, 175 transitions, 908 flow [2023-11-12 02:06:55,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=77, PETRI_TRANSITIONS=175} [2023-11-12 02:06:55,460 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2023-11-12 02:06:55,460 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 175 transitions, 908 flow [2023-11-12 02:06:55,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-12 02:06:55,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:55,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:55,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:06:55,461 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 02:06:55,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -627887235, now seen corresponding path program 1 times [2023-11-12 02:06:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:55,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331578831] [2023-11-12 02:06:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:55,829 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-12 02:06:55,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:55,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331578831] [2023-11-12 02:06:55,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331578831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:55,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:55,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:06:55,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912654121] [2023-11-12 02:06:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:55,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:06:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:55,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:06:55,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:06:56,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 189 [2023-11-12 02:06:56,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 175 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 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-12 02:06:56,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:56,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 189 [2023-11-12 02:06:56,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:06:57,632 INFO L124 PetriNetUnfolderBase]: 4197/7805 cut-off events. [2023-11-12 02:06:57,633 INFO L125 PetriNetUnfolderBase]: For 6282/6549 co-relation queries the response was YES. [2023-11-12 02:06:57,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25483 conditions, 7805 events. 4197/7805 cut-off events. For 6282/6549 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 51228 event pairs, 1254 based on Foata normal form. 11/7497 useless extension candidates. Maximal degree in co-relation 20095. Up to 5830 conditions per place. [2023-11-12 02:06:57,716 INFO L140 encePairwiseOnDemand]: 169/189 looper letters, 160 selfloop transitions, 69 changer transitions 0/258 dead transitions. [2023-11-12 02:06:57,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 258 transitions, 1799 flow [2023-11-12 02:06:57,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:06:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:06:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-11-12 02:06:57,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527336860670194 [2023-11-12 02:06:57,720 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-11-12 02:06:57,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-11-12 02:06:57,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:06:57,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-11-12 02:06:57,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 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-12 02:06:57,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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-12 02:06:57,727 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 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-12 02:06:57,727 INFO L175 Difference]: Start difference. First operand has 77 places, 175 transitions, 908 flow. Second operand 6 states and 598 transitions. [2023-11-12 02:06:57,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 258 transitions, 1799 flow [2023-11-12 02:06:57,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 258 transitions, 1699 flow, removed 50 selfloop flow, removed 0 redundant places. [2023-11-12 02:06:57,798 INFO L231 Difference]: Finished difference. Result has 87 places, 235 transitions, 1524 flow [2023-11-12 02:06:57,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1524, PETRI_PLACES=87, PETRI_TRANSITIONS=235} [2023-11-12 02:06:57,800 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2023-11-12 02:06:57,800 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 235 transitions, 1524 flow [2023-11-12 02:06:57,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 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-12 02:06:57,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:06:57,802 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:06:57,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:06:57,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 02:06:57,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:57,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1875778565, now seen corresponding path program 1 times [2023-11-12 02:06:57,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286764231] [2023-11-12 02:06:57,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:57,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:06:58,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286764231] [2023-11-12 02:06:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286764231] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:06:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876423342] [2023-11-12 02:06:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:58,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:06:58,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:06:58,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:06:58,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:06:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:58,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-12 02:06:58,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:06:58,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-12 02:06:58,705 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:06:58,706 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-12 02:06:58,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12 02:06:58,754 INFO L351 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-12 02:06:58,775 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:06:58,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-12 02:06:58,805 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:06:58,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-12 02:06:58,862 INFO L351 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 56 treesize of output 45 [2023-11-12 02:06:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:06:58,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:06:58,922 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2023-11-12 02:06:58,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2023-11-12 02:06:58,975 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))))))) is different from false [2023-11-12 02:06:59,013 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_347 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_347) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))))))) is different from false [2023-11-12 02:06:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 02:06:59,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876423342] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:06:59,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:06:59,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-12 02:06:59,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381116237] [2023-11-12 02:06:59,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:06:59,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 02:06:59,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:59,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 02:06:59,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=102, Unknown=4, NotChecked=92, Total=240 [2023-11-12 02:06:59,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 189 [2023-11-12 02:06:59,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 235 transitions, 1524 flow. Second operand has 16 states, 16 states have (on average 53.5625) internal successors, (857), 16 states have internal predecessors, (857), 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-12 02:06:59,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:06:59,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 189 [2023-11-12 02:06:59,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:07:02,565 INFO L124 PetriNetUnfolderBase]: 6749/11395 cut-off events. [2023-11-12 02:07:02,565 INFO L125 PetriNetUnfolderBase]: For 17536/17542 co-relation queries the response was YES. [2023-11-12 02:07:02,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43046 conditions, 11395 events. 6749/11395 cut-off events. For 17536/17542 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 70010 event pairs, 1486 based on Foata normal form. 0/10076 useless extension candidates. Maximal degree in co-relation 28145. Up to 6486 conditions per place. [2023-11-12 02:07:02,681 INFO L140 encePairwiseOnDemand]: 168/189 looper letters, 403 selfloop transitions, 76 changer transitions 0/483 dead transitions. [2023-11-12 02:07:02,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 483 transitions, 4042 flow [2023-11-12 02:07:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:07:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-12 02:07:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 819 transitions. [2023-11-12 02:07:02,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2023-11-12 02:07:02,688 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 819 transitions. [2023-11-12 02:07:02,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 819 transitions. [2023-11-12 02:07:02,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:07:02,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 819 transitions. [2023-11-12 02:07:02,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:07:02,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 189.0) internal successors, (2457), 13 states have internal predecessors, (2457), 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-12 02:07:02,698 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 189.0) internal successors, (2457), 13 states have internal predecessors, (2457), 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-12 02:07:02,698 INFO L175 Difference]: Start difference. First operand has 87 places, 235 transitions, 1524 flow. Second operand 12 states and 819 transitions. [2023-11-12 02:07:02,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 483 transitions, 4042 flow [2023-11-12 02:07:02,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 483 transitions, 3806 flow, removed 118 selfloop flow, removed 0 redundant places. [2023-11-12 02:07:02,855 INFO L231 Difference]: Finished difference. Result has 106 places, 271 transitions, 1987 flow [2023-11-12 02:07:02,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1987, PETRI_PLACES=106, PETRI_TRANSITIONS=271} [2023-11-12 02:07:02,857 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 49 predicate places. [2023-11-12 02:07:02,857 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 271 transitions, 1987 flow [2023-11-12 02:07:02,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 53.5625) internal successors, (857), 16 states have internal predecessors, (857), 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-12 02:07:02,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:07:02,858 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:07:02,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:07:03,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 02:07:03,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 02:07:03,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:03,070 INFO L85 PathProgramCache]: Analyzing trace with hash 720591146, now seen corresponding path program 1 times [2023-11-12 02:07:03,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:03,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015124067] [2023-11-12 02:07:03,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:03,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:07:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:07:03,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015124067] [2023-11-12 02:07:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015124067] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:07:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271916408] [2023-11-12 02:07:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:07:03,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:07:03,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:07:03,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:07:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:03,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-12 02:07:03,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:07:03,670 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-12 02:07:03,689 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:07:03,690 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-12 02:07:03,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-12 02:07:03,740 INFO L351 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 23 treesize of output 22 [2023-11-12 02:07:03,766 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:07:03,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2023-11-12 02:07:03,791 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:07:03,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-11-12 02:07:03,826 INFO L351 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 45 treesize of output 34 [2023-11-12 02:07:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:07:03,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:07:03,866 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_451 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6))))) is different from false [2023-11-12 02:07:03,890 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2023-11-12 02:07:03,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_451 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_451) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))))) is different from false [2023-11-12 02:07:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 02:07:04,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271916408] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:07:04,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:07:04,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2023-11-12 02:07:04,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396242929] [2023-11-12 02:07:04,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:07:04,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 02:07:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:04,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:07:04,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2023-11-12 02:07:04,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 189 [2023-11-12 02:07:04,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 271 transitions, 1987 flow. Second operand has 15 states, 15 states have (on average 58.666666666666664) internal successors, (880), 15 states have internal predecessors, (880), 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-12 02:07:04,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:07:04,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 189 [2023-11-12 02:07:04,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:07:08,440 INFO L124 PetriNetUnfolderBase]: 7618/12819 cut-off events. [2023-11-12 02:07:08,441 INFO L125 PetriNetUnfolderBase]: For 23173/23179 co-relation queries the response was YES. [2023-11-12 02:07:08,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51559 conditions, 12819 events. 7618/12819 cut-off events. For 23173/23179 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 81591 event pairs, 726 based on Foata normal form. 6/11616 useless extension candidates. Maximal degree in co-relation 45948. Up to 4796 conditions per place. [2023-11-12 02:07:08,575 INFO L140 encePairwiseOnDemand]: 168/189 looper letters, 633 selfloop transitions, 387 changer transitions 3/1027 dead transitions. [2023-11-12 02:07:08,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 1027 transitions, 8950 flow [2023-11-12 02:07:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-12 02:07:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-12 02:07:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1759 transitions. [2023-11-12 02:07:08,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40464688290775247 [2023-11-12 02:07:08,584 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1759 transitions. [2023-11-12 02:07:08,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1759 transitions. [2023-11-12 02:07:08,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:07:08,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1759 transitions. [2023-11-12 02:07:08,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 76.47826086956522) internal successors, (1759), 23 states have internal predecessors, (1759), 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-12 02:07:08,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 189.0) internal successors, (4536), 24 states have internal predecessors, (4536), 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-12 02:07:08,602 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 189.0) internal successors, (4536), 24 states have internal predecessors, (4536), 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-12 02:07:08,602 INFO L175 Difference]: Start difference. First operand has 106 places, 271 transitions, 1987 flow. Second operand 23 states and 1759 transitions. [2023-11-12 02:07:08,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 1027 transitions, 8950 flow [2023-11-12 02:07:08,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 1027 transitions, 8926 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-12 02:07:08,837 INFO L231 Difference]: Finished difference. Result has 139 places, 660 transitions, 6572 flow [2023-11-12 02:07:08,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=6572, PETRI_PLACES=139, PETRI_TRANSITIONS=660} [2023-11-12 02:07:08,838 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 82 predicate places. [2023-11-12 02:07:08,838 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 660 transitions, 6572 flow [2023-11-12 02:07:08,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 58.666666666666664) internal successors, (880), 15 states have internal predecessors, (880), 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-12 02:07:08,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:07:08,839 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:07:08,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:07:09,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:07:09,045 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 02:07:09,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:09,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1878719225, now seen corresponding path program 2 times [2023-11-12 02:07:09,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:09,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645022962] [2023-11-12 02:07:09,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:07:09,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:07:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645022962] [2023-11-12 02:07:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645022962] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:07:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458585035] [2023-11-12 02:07:09,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:07:09,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:07:09,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:07:09,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:07:09,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:07:09,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:07:09,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:07:09,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-12 02:07:09,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:07:09,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-12 02:07:09,765 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:07:09,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-12 02:07:09,939 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12 02:07:09,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-12 02:07:10,037 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-12 02:07:10,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-12 02:07:10,241 INFO L351 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-12 02:07:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:07:10,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:07:10,316 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_557 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false [2023-11-12 02:07:10,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_557 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_557 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2023-11-12 02:07:10,363 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_557 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2023-11-12 02:07:10,385 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_557 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_557 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2023-11-12 02:07:10,408 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse4 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_557 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))) (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_557) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false [2023-11-12 02:07:10,427 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:07:10,428 INFO L351 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 50 treesize of output 66 [2023-11-12 02:07:10,435 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:07:10,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 30 [2023-11-12 02:07:10,446 INFO L322 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-12 02:07:10,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-12 02:07:10,453 INFO L322 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-12 02:07:10,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-12 02:07:10,460 INFO L322 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-12 02:07:10,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-12 02:07:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-12 02:07:10,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458585035] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:07:10,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:07:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2023-11-12 02:07:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419148555] [2023-11-12 02:07:10,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:07:10,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-12 02:07:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:10,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-12 02:07:10,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=352, Unknown=5, NotChecked=210, Total=650 [2023-11-12 02:07:10,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 189 [2023-11-12 02:07:10,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 660 transitions, 6572 flow. Second operand has 26 states, 26 states have (on average 53.61538461538461) internal successors, (1394), 26 states have internal predecessors, (1394), 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-12 02:07:10,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:07:10,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 189 [2023-11-12 02:07:10,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:07:15,768 INFO L124 PetriNetUnfolderBase]: 7853/13284 cut-off events. [2023-11-12 02:07:15,768 INFO L125 PetriNetUnfolderBase]: For 53819/53831 co-relation queries the response was YES. [2023-11-12 02:07:15,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66968 conditions, 13284 events. 7853/13284 cut-off events. For 53819/53831 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 84712 event pairs, 986 based on Foata normal form. 3/12062 useless extension candidates. Maximal degree in co-relation 63686. Up to 7153 conditions per place. [2023-11-12 02:07:15,926 INFO L140 encePairwiseOnDemand]: 167/189 looper letters, 682 selfloop transitions, 308 changer transitions 0/994 dead transitions. [2023-11-12 02:07:15,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 994 transitions, 11648 flow [2023-11-12 02:07:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-12 02:07:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-12 02:07:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1371 transitions. [2023-11-12 02:07:15,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.345427059712774 [2023-11-12 02:07:15,934 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1371 transitions. [2023-11-12 02:07:15,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1371 transitions. [2023-11-12 02:07:15,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:07:15,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1371 transitions. [2023-11-12 02:07:15,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 65.28571428571429) internal successors, (1371), 21 states have internal predecessors, (1371), 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-12 02:07:15,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 189.0) internal successors, (4158), 22 states have internal predecessors, (4158), 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-12 02:07:15,948 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 189.0) internal successors, (4158), 22 states have internal predecessors, (4158), 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-12 02:07:15,948 INFO L175 Difference]: Start difference. First operand has 139 places, 660 transitions, 6572 flow. Second operand 21 states and 1371 transitions. [2023-11-12 02:07:15,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 994 transitions, 11648 flow [2023-11-12 02:07:17,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 994 transitions, 11040 flow, removed 280 selfloop flow, removed 4 redundant places. [2023-11-12 02:07:17,343 INFO L231 Difference]: Finished difference. Result has 163 places, 778 transitions, 8367 flow [2023-11-12 02:07:17,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=6168, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=8367, PETRI_PLACES=163, PETRI_TRANSITIONS=778} [2023-11-12 02:07:17,344 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 106 predicate places. [2023-11-12 02:07:17,344 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 778 transitions, 8367 flow [2023-11-12 02:07:17,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 53.61538461538461) internal successors, (1394), 26 states have internal predecessors, (1394), 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-12 02:07:17,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:07:17,345 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:07:17,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:07:17,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:07:17,546 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2023-11-12 02:07:17,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1717055363, now seen corresponding path program 3 times [2023-11-12 02:07:17,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:17,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654601384] [2023-11-12 02:07:17,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:07:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:07:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654601384] [2023-11-12 02:07:18,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654601384] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:07:18,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271356825] [2023-11-12 02:07:18,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 02:07:18,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:07:18,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:07:18,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:07:18,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7335c446-8a61-49d2-9dd1-efaa5b624bd6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:07:18,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-12 02:07:18,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:07:18,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-12 02:07:18,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:07:18,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-12 02:07:18,273 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:07:18,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-12 02:07:18,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-12 02:07:18,502 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-12 02:07:18,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-12 02:07:18,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-12 02:07:18,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-12 02:07:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:07:18,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:07:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:07:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271356825] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:07:20,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:07:20,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2023-11-12 02:07:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788068593] [2023-11-12 02:07:20,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:07:20,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-12 02:07:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:20,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-12 02:07:20,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870