./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB --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 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:20:57,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:20:57,134 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:20:57,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:20:57,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:20:57,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:20:57,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:20:57,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:20:57,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:20:57,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:20:57,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:20:57,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:20:57,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:20:57,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:20:57,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:20:57,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:20:57,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:20:57,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:20:57,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:20:57,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:20:57,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:20:57,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:20:57,209 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:20:57,209 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:20:57,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:20:57,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:20:57,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:20:57,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:20:57,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:20:57,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:57,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:57,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:57,210 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:20:57,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:57,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:20:57,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:20:57,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:20:57,212 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 [2024-11-28 03:20:57,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:20:57,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:20:57,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:20:57,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:20:57,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:20:57,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2024-11-28 03:21:01,526 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/data/046a5676a/c3c875bbbc5e4730b5c12897956e4e98/FLAG6597bba9f [2024-11-28 03:21:01,913 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:21:01,914 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2024-11-28 03:21:01,939 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/data/046a5676a/c3c875bbbc5e4730b5c12897956e4e98/FLAG6597bba9f [2024-11-28 03:21:01,962 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/data/046a5676a/c3c875bbbc5e4730b5c12897956e4e98 [2024-11-28 03:21:01,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:21:01,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:21:01,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:21:01,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:21:01,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:21:01,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:21:01" (1/1) ... [2024-11-28 03:21:01,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed8c462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:01, skipping insertion in model container [2024-11-28 03:21:01,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:21:01" (1/1) ... [2024-11-28 03:21:02,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:21:02,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:21:02,817 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:21:02,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:21:03,070 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:21:03,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03 WrapperNode [2024-11-28 03:21:03,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:21:03,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:21:03,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:21:03,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:21:03,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,148 INFO L138 Inliner]: procedures = 368, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2024-11-28 03:21:03,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:21:03,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:21:03,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:21:03,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:21:03,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:21:03,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:21:03,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:21:03,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:21:03,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (1/1) ... [2024-11-28 03:21:03,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:21:03,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:21:03,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:21:03,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:21:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-28 03:21:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-28 03:21:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:21:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:21:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-28 03:21:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:21:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:21:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-28 03:21:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-28 03:21:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-28 03:21:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:21:03,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:21:03,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:21:03,307 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:21:03,541 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:21:03,543 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:21:04,378 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:21:04,378 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:21:04,432 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:21:04,433 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 03:21:04,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:21:04 BoogieIcfgContainer [2024-11-28 03:21:04,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:21:04,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:21:04,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:21:04,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:21:04,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:21:01" (1/3) ... [2024-11-28 03:21:04,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b738a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:21:04, skipping insertion in model container [2024-11-28 03:21:04,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:21:03" (2/3) ... [2024-11-28 03:21:04,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b738a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:21:04, skipping insertion in model container [2024-11-28 03:21:04,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:21:04" (3/3) ... [2024-11-28 03:21:04,454 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2024-11-28 03:21:04,477 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:21:04,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_03-list2_rc.i that has 2 procedures, 277 locations, 1 initial locations, 0 loop locations, and 28 error locations. [2024-11-28 03:21:04,480 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:21:04,642 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:21:04,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 276 transitions, 556 flow [2024-11-28 03:21:04,917 INFO L124 PetriNetUnfolderBase]: 0/275 cut-off events. [2024-11-28 03:21:04,920 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:04,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 160 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-28 03:21:04,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 276 transitions, 556 flow [2024-11-28 03:21:04,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 275 transitions, 553 flow [2024-11-28 03:21:04,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:21:04,983 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4114fc9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:21:04,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-11-28 03:21:05,040 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:21:05,040 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2024-11-28 03:21:05,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:05,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:05,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:05,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:05,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash -528824746, now seen corresponding path program 1 times [2024-11-28 03:21:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:05,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665566791] [2024-11-28 03:21:05,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:06,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:06,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665566791] [2024-11-28 03:21:06,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665566791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:06,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442634346] [2024-11-28 03:21:06,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:06,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:06,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:06,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:06,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:07,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2024-11-28 03:21:07,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 275 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:07,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:07,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2024-11-28 03:21:07,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:08,392 INFO L124 PetriNetUnfolderBase]: 560/2325 cut-off events. [2024-11-28 03:21:08,393 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:21:08,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 2325 events. 560/2325 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14858 event pairs, 560 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 3350. Up to 1193 conditions per place. [2024-11-28 03:21:08,425 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/272 dead transitions. [2024-11-28 03:21:08,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 272 transitions, 721 flow [2024-11-28 03:21:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2024-11-28 03:21:08,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2024-11-28 03:21:08,510 INFO L175 Difference]: Start difference. First operand has 279 places, 275 transitions, 553 flow. Second operand 6 states and 1206 transitions. [2024-11-28 03:21:08,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 272 transitions, 721 flow [2024-11-28 03:21:08,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 272 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:21:08,525 INFO L231 Difference]: Finished difference. Result has 280 places, 272 transitions, 576 flow [2024-11-28 03:21:08,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=280, PETRI_TRANSITIONS=272} [2024-11-28 03:21:08,533 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2024-11-28 03:21:08,533 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 272 transitions, 576 flow [2024-11-28 03:21:08,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:08,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:08,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:21:08,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1092997858, now seen corresponding path program 1 times [2024-11-28 03:21:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742912178] [2024-11-28 03:21:08,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:09,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742912178] [2024-11-28 03:21:09,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742912178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:09,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:09,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899258818] [2024-11-28 03:21:09,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:09,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:09,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:09,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:10,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2024-11-28 03:21:10,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 272 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:10,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:10,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2024-11-28 03:21:10,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:10,719 INFO L124 PetriNetUnfolderBase]: 560/2322 cut-off events. [2024-11-28 03:21:10,720 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:10,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 2322 events. 560/2322 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14859 event pairs, 560 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 3391. Up to 1193 conditions per place. [2024-11-28 03:21:10,736 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/269 dead transitions. [2024-11-28 03:21:10,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 269 transitions, 744 flow [2024-11-28 03:21:10,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2024-11-28 03:21:10,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2024-11-28 03:21:10,743 INFO L175 Difference]: Start difference. First operand has 280 places, 272 transitions, 576 flow. Second operand 6 states and 1206 transitions. [2024-11-28 03:21:10,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 269 transitions, 744 flow [2024-11-28 03:21:10,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 269 transitions, 714 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:21:10,755 INFO L231 Difference]: Finished difference. Result has 277 places, 269 transitions, 570 flow [2024-11-28 03:21:10,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=269} [2024-11-28 03:21:10,759 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -2 predicate places. [2024-11-28 03:21:10,760 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 269 transitions, 570 flow [2024-11-28 03:21:10,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:10,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:10,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:10,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:21:10,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:10,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1560868144, now seen corresponding path program 1 times [2024-11-28 03:21:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:10,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596079678] [2024-11-28 03:21:10,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:10,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:10,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596079678] [2024-11-28 03:21:10,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596079678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:10,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:10,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:10,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820713947] [2024-11-28 03:21:10,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:10,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:10,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:10,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:10,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2024-11-28 03:21:10,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 269 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:10,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:10,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2024-11-28 03:21:10,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:11,093 INFO L124 PetriNetUnfolderBase]: 30/718 cut-off events. [2024-11-28 03:21:11,093 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:11,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 718 events. 30/718 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2616 event pairs, 30 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2024-11-28 03:21:11,097 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-11-28 03:21:11,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 606 flow [2024-11-28 03:21:11,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2024-11-28 03:21:11,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2024-11-28 03:21:11,101 INFO L175 Difference]: Start difference. First operand has 277 places, 269 transitions, 570 flow. Second operand 3 states and 788 transitions. [2024-11-28 03:21:11,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 268 transitions, 606 flow [2024-11-28 03:21:11,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 268 transitions, 576 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:21:11,107 INFO L231 Difference]: Finished difference. Result has 273 places, 268 transitions, 542 flow [2024-11-28 03:21:11,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=273, PETRI_TRANSITIONS=268} [2024-11-28 03:21:11,109 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -6 predicate places. [2024-11-28 03:21:11,109 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 268 transitions, 542 flow [2024-11-28 03:21:11,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:11,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:11,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:11,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:21:11,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:11,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash -388730026, now seen corresponding path program 1 times [2024-11-28 03:21:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:11,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91564911] [2024-11-28 03:21:11,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:11,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:11,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91564911] [2024-11-28 03:21:11,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91564911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:11,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:11,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674312675] [2024-11-28 03:21:11,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:11,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:11,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:11,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:11,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2024-11-28 03:21:11,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 268 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:11,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:11,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2024-11-28 03:21:11,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:11,407 INFO L124 PetriNetUnfolderBase]: 36/750 cut-off events. [2024-11-28 03:21:11,408 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:21:11,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 750 events. 36/750 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2996 event pairs, 36 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 788. Up to 89 conditions per place. [2024-11-28 03:21:11,412 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2024-11-28 03:21:11,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 264 transitions, 570 flow [2024-11-28 03:21:11,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2024-11-28 03:21:11,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2024-11-28 03:21:11,416 INFO L175 Difference]: Start difference. First operand has 273 places, 268 transitions, 542 flow. Second operand 3 states and 784 transitions. [2024-11-28 03:21:11,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 264 transitions, 570 flow [2024-11-28 03:21:11,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 264 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:21:11,423 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 532 flow [2024-11-28 03:21:11,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2024-11-28 03:21:11,425 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -10 predicate places. [2024-11-28 03:21:11,425 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 532 flow [2024-11-28 03:21:11,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:11,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:11,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:11,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:21:11,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:11,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash -744891557, now seen corresponding path program 1 times [2024-11-28 03:21:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:11,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400350863] [2024-11-28 03:21:11,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:12,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400350863] [2024-11-28 03:21:12,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400350863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:12,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:12,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228786388] [2024-11-28 03:21:12,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:12,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:12,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:12,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:12,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2024-11-28 03:21:12,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:12,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:12,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2024-11-28 03:21:12,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:13,446 INFO L124 PetriNetUnfolderBase]: 638/2519 cut-off events. [2024-11-28 03:21:13,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:13,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3891 conditions, 2519 events. 638/2519 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16283 event pairs, 638 based on Foata normal form. 0/2317 useless extension candidates. Maximal degree in co-relation 3822. Up to 1362 conditions per place. [2024-11-28 03:21:13,461 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/263 dead transitions. [2024-11-28 03:21:13,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 263 transitions, 710 flow [2024-11-28 03:21:13,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2024-11-28 03:21:13,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2024-11-28 03:21:13,470 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 532 flow. Second operand 6 states and 1201 transitions. [2024-11-28 03:21:13,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 263 transitions, 710 flow [2024-11-28 03:21:13,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 263 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:21:13,477 INFO L231 Difference]: Finished difference. Result has 272 places, 263 transitions, 539 flow [2024-11-28 03:21:13,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=272, PETRI_TRANSITIONS=263} [2024-11-28 03:21:13,482 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -7 predicate places. [2024-11-28 03:21:13,483 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 263 transitions, 539 flow [2024-11-28 03:21:13,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:13,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:13,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:13,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:21:13,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:13,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1605273385, now seen corresponding path program 1 times [2024-11-28 03:21:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:13,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637948901] [2024-11-28 03:21:13,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:13,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:13,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637948901] [2024-11-28 03:21:13,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637948901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:13,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:13,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162660467] [2024-11-28 03:21:13,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:13,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:13,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:13,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:13,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2024-11-28 03:21:13,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 263 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:13,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:13,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2024-11-28 03:21:13,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:13,849 INFO L124 PetriNetUnfolderBase]: 30/706 cut-off events. [2024-11-28 03:21:13,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:13,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 706 events. 30/706 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2689 event pairs, 30 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 737. Up to 78 conditions per place. [2024-11-28 03:21:13,854 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2024-11-28 03:21:13,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 262 transitions, 575 flow [2024-11-28 03:21:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2024-11-28 03:21:13,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2024-11-28 03:21:13,858 INFO L175 Difference]: Start difference. First operand has 272 places, 263 transitions, 539 flow. Second operand 3 states and 788 transitions. [2024-11-28 03:21:13,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 262 transitions, 575 flow [2024-11-28 03:21:13,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 262 transitions, 565 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:21:13,865 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 531 flow [2024-11-28 03:21:13,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2024-11-28 03:21:13,866 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -11 predicate places. [2024-11-28 03:21:13,866 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 531 flow [2024-11-28 03:21:13,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:13,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:13,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:13,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:21:13,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:13,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1215126668, now seen corresponding path program 1 times [2024-11-28 03:21:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645328039] [2024-11-28 03:21:13,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:13,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:13,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645328039] [2024-11-28 03:21:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645328039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:13,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420529563] [2024-11-28 03:21:13,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:13,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:13,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:13,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:13,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:13,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2024-11-28 03:21:13,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:13,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:13,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2024-11-28 03:21:13,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:14,129 INFO L124 PetriNetUnfolderBase]: 36/734 cut-off events. [2024-11-28 03:21:14,130 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:21:14,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 734 events. 36/734 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2925 event pairs, 36 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 774. Up to 89 conditions per place. [2024-11-28 03:21:14,135 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2024-11-28 03:21:14,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 258 transitions, 559 flow [2024-11-28 03:21:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2024-11-28 03:21:14,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2024-11-28 03:21:14,138 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 531 flow. Second operand 3 states and 784 transitions. [2024-11-28 03:21:14,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 258 transitions, 559 flow [2024-11-28 03:21:14,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 258 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:21:14,143 INFO L231 Difference]: Finished difference. Result has 264 places, 258 transitions, 521 flow [2024-11-28 03:21:14,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=264, PETRI_TRANSITIONS=258} [2024-11-28 03:21:14,145 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -15 predicate places. [2024-11-28 03:21:14,145 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 258 transitions, 521 flow [2024-11-28 03:21:14,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:14,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:14,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:14,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:21:14,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:14,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1203165847, now seen corresponding path program 1 times [2024-11-28 03:21:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:14,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941064300] [2024-11-28 03:21:14,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:21:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941064300] [2024-11-28 03:21:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941064300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:15,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:15,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138425401] [2024-11-28 03:21:15,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:15,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:15,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:15,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:15,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2024-11-28 03:21:15,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 258 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:15,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:15,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2024-11-28 03:21:15,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:16,468 INFO L124 PetriNetUnfolderBase]: 638/2428 cut-off events. [2024-11-28 03:21:16,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:21:16,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 2428 events. 638/2428 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15408 event pairs, 638 based on Foata normal form. 0/2281 useless extension candidates. Maximal degree in co-relation 3733. Up to 1362 conditions per place. [2024-11-28 03:21:16,481 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/257 dead transitions. [2024-11-28 03:21:16,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 257 transitions, 699 flow [2024-11-28 03:21:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2024-11-28 03:21:16,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2024-11-28 03:21:16,485 INFO L175 Difference]: Start difference. First operand has 264 places, 258 transitions, 521 flow. Second operand 6 states and 1201 transitions. [2024-11-28 03:21:16,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 257 transitions, 699 flow [2024-11-28 03:21:16,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 257 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:21:16,489 INFO L231 Difference]: Finished difference. Result has 267 places, 257 transitions, 528 flow [2024-11-28 03:21:16,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=267, PETRI_TRANSITIONS=257} [2024-11-28 03:21:16,491 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -12 predicate places. [2024-11-28 03:21:16,491 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 257 transitions, 528 flow [2024-11-28 03:21:16,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:16,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:16,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:16,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:21:16,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:16,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2046601516, now seen corresponding path program 1 times [2024-11-28 03:21:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966716113] [2024-11-28 03:21:16,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:21:17,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:17,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966716113] [2024-11-28 03:21:17,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966716113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:17,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:17,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:17,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888546812] [2024-11-28 03:21:17,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:17,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:17,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:17,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:17,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:18,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2024-11-28 03:21:18,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 257 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:18,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:18,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2024-11-28 03:21:18,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:19,118 INFO L124 PetriNetUnfolderBase]: 232/1787 cut-off events. [2024-11-28 03:21:19,119 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:21:19,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 1787 events. 232/1787 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11375 event pairs, 20 based on Foata normal form. 0/1663 useless extension candidates. Maximal degree in co-relation 2277. Up to 305 conditions per place. [2024-11-28 03:21:19,127 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 100 selfloop transitions, 38 changer transitions 0/331 dead transitions. [2024-11-28 03:21:19,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 331 transitions, 952 flow [2024-11-28 03:21:19,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2024-11-28 03:21:19,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2024-11-28 03:21:19,132 INFO L175 Difference]: Start difference. First operand has 267 places, 257 transitions, 528 flow. Second operand 6 states and 1412 transitions. [2024-11-28 03:21:19,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 331 transitions, 952 flow [2024-11-28 03:21:19,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 331 transitions, 942 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:21:19,142 INFO L231 Difference]: Finished difference. Result has 271 places, 293 transitions, 776 flow [2024-11-28 03:21:19,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=271, PETRI_TRANSITIONS=293} [2024-11-28 03:21:19,143 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -8 predicate places. [2024-11-28 03:21:19,143 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 293 transitions, 776 flow [2024-11-28 03:21:19,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:19,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:19,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:19,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:21:19,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:19,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash 893767704, now seen corresponding path program 1 times [2024-11-28 03:21:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:19,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14809528] [2024-11-28 03:21:19,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:21:20,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:20,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14809528] [2024-11-28 03:21:20,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14809528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:20,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:20,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653065396] [2024-11-28 03:21:20,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:20,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:20,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:20,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:20,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2024-11-28 03:21:20,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 293 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:20,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:20,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2024-11-28 03:21:20,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:21,371 INFO L124 PetriNetUnfolderBase]: 185/1591 cut-off events. [2024-11-28 03:21:21,372 INFO L125 PetriNetUnfolderBase]: For 206/211 co-relation queries the response was YES. [2024-11-28 03:21:21,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 1591 events. 185/1591 cut-off events. For 206/211 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9959 event pairs, 75 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 2293. Up to 354 conditions per place. [2024-11-28 03:21:21,382 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 96 selfloop transitions, 5 changer transitions 0/308 dead transitions. [2024-11-28 03:21:21,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 308 transitions, 1008 flow [2024-11-28 03:21:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2024-11-28 03:21:21,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2024-11-28 03:21:21,388 INFO L175 Difference]: Start difference. First operand has 271 places, 293 transitions, 776 flow. Second operand 6 states and 1382 transitions. [2024-11-28 03:21:21,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 308 transitions, 1008 flow [2024-11-28 03:21:21,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 308 transitions, 1008 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:21:21,399 INFO L231 Difference]: Finished difference. Result has 275 places, 292 transitions, 784 flow [2024-11-28 03:21:21,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=275, PETRI_TRANSITIONS=292} [2024-11-28 03:21:21,401 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -4 predicate places. [2024-11-28 03:21:21,402 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 292 transitions, 784 flow [2024-11-28 03:21:21,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:21,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:21,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:21,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:21:21,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:21,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1777114751, now seen corresponding path program 1 times [2024-11-28 03:21:21,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:21,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857296277] [2024-11-28 03:21:21,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:21:22,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:22,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857296277] [2024-11-28 03:21:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857296277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:22,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:22,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61754391] [2024-11-28 03:21:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:22,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:22,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:22,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:23,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 276 [2024-11-28 03:21:23,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 292 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:23,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:23,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 276 [2024-11-28 03:21:23,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:23,812 INFO L124 PetriNetUnfolderBase]: 583/2948 cut-off events. [2024-11-28 03:21:23,812 INFO L125 PetriNetUnfolderBase]: For 706/713 co-relation queries the response was YES. [2024-11-28 03:21:23,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 2948 events. 583/2948 cut-off events. For 706/713 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21807 event pairs, 69 based on Foata normal form. 0/2761 useless extension candidates. Maximal degree in co-relation 4953. Up to 795 conditions per place. [2024-11-28 03:21:23,831 INFO L140 encePairwiseOnDemand]: 254/276 looper letters, 111 selfloop transitions, 72 changer transitions 0/381 dead transitions. [2024-11-28 03:21:23,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 381 transitions, 1520 flow [2024-11-28 03:21:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2024-11-28 03:21:23,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387681159420289 [2024-11-28 03:21:23,837 INFO L175 Difference]: Start difference. First operand has 275 places, 292 transitions, 784 flow. Second operand 6 states and 1389 transitions. [2024-11-28 03:21:23,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 381 transitions, 1520 flow [2024-11-28 03:21:23,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 381 transitions, 1502 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:21:23,848 INFO L231 Difference]: Finished difference. Result has 280 places, 362 transitions, 1440 flow [2024-11-28 03:21:23,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1440, PETRI_PLACES=280, PETRI_TRANSITIONS=362} [2024-11-28 03:21:23,849 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2024-11-28 03:21:23,849 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 362 transitions, 1440 flow [2024-11-28 03:21:23,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:23,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:23,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:23,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:21:23,854 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:23,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:23,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1489313437, now seen corresponding path program 1 times [2024-11-28 03:21:23,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:23,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653574109] [2024-11-28 03:21:23,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:23,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:21:24,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:24,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653574109] [2024-11-28 03:21:24,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653574109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:24,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:24,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:24,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083989649] [2024-11-28 03:21:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:24,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:24,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:24,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:24,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:25,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2024-11-28 03:21:25,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 362 transitions, 1440 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:25,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:25,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2024-11-28 03:21:25,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:26,863 INFO L124 PetriNetUnfolderBase]: 1657/5695 cut-off events. [2024-11-28 03:21:26,864 INFO L125 PetriNetUnfolderBase]: For 3355/3415 co-relation queries the response was YES. [2024-11-28 03:21:26,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12784 conditions, 5695 events. 1657/5695 cut-off events. For 3355/3415 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 45929 event pairs, 861 based on Foata normal form. 0/5366 useless extension candidates. Maximal degree in co-relation 12709. Up to 3147 conditions per place. [2024-11-28 03:21:26,919 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 201 selfloop transitions, 89 changer transitions 0/462 dead transitions. [2024-11-28 03:21:26,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 462 transitions, 2424 flow [2024-11-28 03:21:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2024-11-28 03:21:26,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2024-11-28 03:21:26,924 INFO L175 Difference]: Start difference. First operand has 280 places, 362 transitions, 1440 flow. Second operand 6 states and 1302 transitions. [2024-11-28 03:21:26,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 462 transitions, 2424 flow [2024-11-28 03:21:26,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 462 transitions, 2424 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:21:26,954 INFO L231 Difference]: Finished difference. Result has 290 places, 446 transitions, 2242 flow [2024-11-28 03:21:26,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2242, PETRI_PLACES=290, PETRI_TRANSITIONS=446} [2024-11-28 03:21:26,955 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 11 predicate places. [2024-11-28 03:21:26,956 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 446 transitions, 2242 flow [2024-11-28 03:21:26,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:26,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:26,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:26,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:21:26,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:26,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash 106924031, now seen corresponding path program 1 times [2024-11-28 03:21:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983370824] [2024-11-28 03:21:26,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:21:27,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:27,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983370824] [2024-11-28 03:21:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983370824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:21:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968741232] [2024-11-28 03:21:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:27,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:27,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:27,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:27,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 276 [2024-11-28 03:21:27,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 446 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:27,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:27,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 276 [2024-11-28 03:21:27,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:27,841 INFO L124 PetriNetUnfolderBase]: 315/1970 cut-off events. [2024-11-28 03:21:27,842 INFO L125 PetriNetUnfolderBase]: For 1136/1199 co-relation queries the response was YES. [2024-11-28 03:21:27,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 1970 events. 315/1970 cut-off events. For 1136/1199 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13471 event pairs, 31 based on Foata normal form. 4/1894 useless extension candidates. Maximal degree in co-relation 4047. Up to 312 conditions per place. [2024-11-28 03:21:27,859 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 10 selfloop transitions, 6 changer transitions 0/386 dead transitions. [2024-11-28 03:21:27,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 386 transitions, 1710 flow [2024-11-28 03:21:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2024-11-28 03:21:27,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9855072463768116 [2024-11-28 03:21:27,863 INFO L175 Difference]: Start difference. First operand has 290 places, 446 transitions, 2242 flow. Second operand 3 states and 816 transitions. [2024-11-28 03:21:27,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 386 transitions, 1710 flow [2024-11-28 03:21:27,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 386 transitions, 1622 flow, removed 44 selfloop flow, removed 0 redundant places. [2024-11-28 03:21:27,890 INFO L231 Difference]: Finished difference. Result has 293 places, 384 transitions, 1612 flow [2024-11-28 03:21:27,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=293, PETRI_TRANSITIONS=384} [2024-11-28 03:21:27,892 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 14 predicate places. [2024-11-28 03:21:27,892 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 384 transitions, 1612 flow [2024-11-28 03:21:27,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:27,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:27,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:27,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:21:27,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:27,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:27,896 INFO L85 PathProgramCache]: Analyzing trace with hash 735522291, now seen corresponding path program 1 times [2024-11-28 03:21:27,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:27,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203416730] [2024-11-28 03:21:27,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:21:28,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:28,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203416730] [2024-11-28 03:21:28,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203416730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:28,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:28,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:28,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369709680] [2024-11-28 03:21:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:28,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:28,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:28,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:28,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:29,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2024-11-28 03:21:29,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 384 transitions, 1612 flow. Second operand has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:29,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:29,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2024-11-28 03:21:29,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:30,298 INFO L124 PetriNetUnfolderBase]: 690/3113 cut-off events. [2024-11-28 03:21:30,298 INFO L125 PetriNetUnfolderBase]: For 3020/3221 co-relation queries the response was YES. [2024-11-28 03:21:30,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7440 conditions, 3113 events. 690/3113 cut-off events. For 3020/3221 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23921 event pairs, 54 based on Foata normal form. 20/3022 useless extension candidates. Maximal degree in co-relation 7357. Up to 734 conditions per place. [2024-11-28 03:21:30,321 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 184 selfloop transitions, 124 changer transitions 4/542 dead transitions. [2024-11-28 03:21:30,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 542 transitions, 3203 flow [2024-11-28 03:21:30,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1430 transitions. [2024-11-28 03:21:30,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635265700483091 [2024-11-28 03:21:30,327 INFO L175 Difference]: Start difference. First operand has 293 places, 384 transitions, 1612 flow. Second operand 6 states and 1430 transitions. [2024-11-28 03:21:30,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 542 transitions, 3203 flow [2024-11-28 03:21:30,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 542 transitions, 3180 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:21:30,352 INFO L231 Difference]: Finished difference. Result has 301 places, 486 transitions, 2988 flow [2024-11-28 03:21:30,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2988, PETRI_PLACES=301, PETRI_TRANSITIONS=486} [2024-11-28 03:21:30,353 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 22 predicate places. [2024-11-28 03:21:30,353 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 486 transitions, 2988 flow [2024-11-28 03:21:30,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:30,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:30,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:30,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:21:30,355 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:30,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:30,356 INFO L85 PathProgramCache]: Analyzing trace with hash 347820555, now seen corresponding path program 1 times [2024-11-28 03:21:30,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:30,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840864911] [2024-11-28 03:21:30,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:21:31,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840864911] [2024-11-28 03:21:31,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840864911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:31,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:31,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477975771] [2024-11-28 03:21:31,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:31,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:31,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:31,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:31,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2024-11-28 03:21:31,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 486 transitions, 2988 flow. Second operand has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:31,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:31,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2024-11-28 03:21:31,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:32,708 INFO L124 PetriNetUnfolderBase]: 605/2890 cut-off events. [2024-11-28 03:21:32,708 INFO L125 PetriNetUnfolderBase]: For 5479/5694 co-relation queries the response was YES. [2024-11-28 03:21:32,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7823 conditions, 2890 events. 605/2890 cut-off events. For 5479/5694 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 21929 event pairs, 92 based on Foata normal form. 18/2852 useless extension candidates. Maximal degree in co-relation 7737. Up to 803 conditions per place. [2024-11-28 03:21:32,722 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 218 selfloop transitions, 17 changer transitions 0/501 dead transitions. [2024-11-28 03:21:32,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 501 transitions, 3512 flow [2024-11-28 03:21:32,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2024-11-28 03:21:32,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2024-11-28 03:21:32,728 INFO L175 Difference]: Start difference. First operand has 301 places, 486 transitions, 2988 flow. Second operand 6 states and 1382 transitions. [2024-11-28 03:21:32,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 501 transitions, 3512 flow [2024-11-28 03:21:32,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 501 transitions, 3494 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-28 03:21:32,759 INFO L231 Difference]: Finished difference. Result has 305 places, 485 transitions, 3002 flow [2024-11-28 03:21:32,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3002, PETRI_PLACES=305, PETRI_TRANSITIONS=485} [2024-11-28 03:21:32,760 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 26 predicate places. [2024-11-28 03:21:32,760 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 485 transitions, 3002 flow [2024-11-28 03:21:32,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:32,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:32,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:32,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:21:32,762 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:32,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash 982429328, now seen corresponding path program 1 times [2024-11-28 03:21:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256024960] [2024-11-28 03:21:32,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:32,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:21:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:33,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256024960] [2024-11-28 03:21:33,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256024960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:33,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:33,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333846653] [2024-11-28 03:21:33,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:33,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:33,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:33,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:33,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:33,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2024-11-28 03:21:33,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 485 transitions, 3002 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:33,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:33,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2024-11-28 03:21:33,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:35,337 INFO L124 PetriNetUnfolderBase]: 1547/5161 cut-off events. [2024-11-28 03:21:35,337 INFO L125 PetriNetUnfolderBase]: For 7543/7624 co-relation queries the response was YES. [2024-11-28 03:21:35,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15138 conditions, 5161 events. 1547/5161 cut-off events. For 7543/7624 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41358 event pairs, 582 based on Foata normal form. 1/5009 useless extension candidates. Maximal degree in co-relation 15051. Up to 2881 conditions per place. [2024-11-28 03:21:35,369 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 304 selfloop transitions, 103 changer transitions 8/591 dead transitions. [2024-11-28 03:21:35,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 591 transitions, 4442 flow [2024-11-28 03:21:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:35,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2024-11-28 03:21:35,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2024-11-28 03:21:35,374 INFO L175 Difference]: Start difference. First operand has 305 places, 485 transitions, 3002 flow. Second operand 6 states and 1302 transitions. [2024-11-28 03:21:35,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 591 transitions, 4442 flow [2024-11-28 03:21:35,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 591 transitions, 4408 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:21:35,533 INFO L231 Difference]: Finished difference. Result has 310 places, 571 transitions, 3986 flow [2024-11-28 03:21:35,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3986, PETRI_PLACES=310, PETRI_TRANSITIONS=571} [2024-11-28 03:21:35,534 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 31 predicate places. [2024-11-28 03:21:35,534 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 571 transitions, 3986 flow [2024-11-28 03:21:35,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:35,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:35,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:35,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:21:35,536 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash 828551593, now seen corresponding path program 1 times [2024-11-28 03:21:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:35,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070940040] [2024-11-28 03:21:35,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:35,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:21:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:39,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070940040] [2024-11-28 03:21:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070940040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-28 03:21:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548505551] [2024-11-28 03:21:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:39,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 03:21:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:39,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 03:21:39,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-11-28 03:21:43,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 276 [2024-11-28 03:21:43,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 571 transitions, 3986 flow. Second operand has 20 states, 20 states have (on average 151.15) internal successors, (3023), 20 states have internal predecessors, (3023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:43,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:43,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 276 [2024-11-28 03:21:43,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:47,002 INFO L124 PetriNetUnfolderBase]: 1717/5670 cut-off events. [2024-11-28 03:21:47,002 INFO L125 PetriNetUnfolderBase]: For 11266/11335 co-relation queries the response was YES. [2024-11-28 03:21:47,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18569 conditions, 5670 events. 1717/5670 cut-off events. For 11266/11335 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 46232 event pairs, 195 based on Foata normal form. 19/5643 useless extension candidates. Maximal degree in co-relation 18462. Up to 1900 conditions per place. [2024-11-28 03:21:47,037 INFO L140 encePairwiseOnDemand]: 245/276 looper letters, 529 selfloop transitions, 101 changer transitions 23/785 dead transitions. [2024-11-28 03:21:47,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 785 transitions, 6962 flow [2024-11-28 03:21:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 03:21:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-28 03:21:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4364 transitions. [2024-11-28 03:21:47,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5646997929606625 [2024-11-28 03:21:47,050 INFO L175 Difference]: Start difference. First operand has 310 places, 571 transitions, 3986 flow. Second operand 28 states and 4364 transitions. [2024-11-28 03:21:47,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 785 transitions, 6962 flow [2024-11-28 03:21:47,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 785 transitions, 6758 flow, removed 102 selfloop flow, removed 0 redundant places. [2024-11-28 03:21:47,307 INFO L231 Difference]: Finished difference. Result has 347 places, 604 transitions, 4436 flow [2024-11-28 03:21:47,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=3838, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4436, PETRI_PLACES=347, PETRI_TRANSITIONS=604} [2024-11-28 03:21:47,308 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 68 predicate places. [2024-11-28 03:21:47,308 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 604 transitions, 4436 flow [2024-11-28 03:21:47,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 151.15) internal successors, (3023), 20 states have internal predecessors, (3023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:47,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:47,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:47,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:21:47,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:47,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1784194913, now seen corresponding path program 1 times [2024-11-28 03:21:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:47,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134606518] [2024-11-28 03:21:47,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:21:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:50,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134606518] [2024-11-28 03:21:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134606518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:50,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 03:21:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801879955] [2024-11-28 03:21:50,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:50,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 03:21:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:50,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 03:21:50,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-28 03:21:55,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 276 [2024-11-28 03:21:55,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 604 transitions, 4436 flow. Second operand has 18 states, 18 states have (on average 176.66666666666666) internal successors, (3180), 18 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:55,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:55,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 276 [2024-11-28 03:21:55,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:57,602 INFO L124 PetriNetUnfolderBase]: 1405/5296 cut-off events. [2024-11-28 03:21:57,602 INFO L125 PetriNetUnfolderBase]: For 13203/13390 co-relation queries the response was YES. [2024-11-28 03:21:57,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17949 conditions, 5296 events. 1405/5296 cut-off events. For 13203/13390 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 45108 event pairs, 151 based on Foata normal form. 27/5269 useless extension candidates. Maximal degree in co-relation 17825. Up to 1437 conditions per place. [2024-11-28 03:21:57,636 INFO L140 encePairwiseOnDemand]: 243/276 looper letters, 400 selfloop transitions, 123 changer transitions 8/777 dead transitions. [2024-11-28 03:21:57,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 777 transitions, 7003 flow [2024-11-28 03:21:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:21:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-28 03:21:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4148 transitions. [2024-11-28 03:21:57,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6534341524889729 [2024-11-28 03:21:57,642 INFO L175 Difference]: Start difference. First operand has 347 places, 604 transitions, 4436 flow. Second operand 23 states and 4148 transitions. [2024-11-28 03:21:57,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 777 transitions, 7003 flow [2024-11-28 03:21:57,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 777 transitions, 6879 flow, removed 51 selfloop flow, removed 10 redundant places. [2024-11-28 03:21:57,758 INFO L231 Difference]: Finished difference. Result has 367 places, 668 transitions, 5598 flow [2024-11-28 03:21:57,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=4354, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5598, PETRI_PLACES=367, PETRI_TRANSITIONS=668} [2024-11-28 03:21:57,759 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 88 predicate places. [2024-11-28 03:21:57,760 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 668 transitions, 5598 flow [2024-11-28 03:21:57,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 176.66666666666666) internal successors, (3180), 18 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:57,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:57,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:57,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:21:57,762 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:21:57,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:57,763 INFO L85 PathProgramCache]: Analyzing trace with hash -93022475, now seen corresponding path program 2 times [2024-11-28 03:21:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:57,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051574665] [2024-11-28 03:21:57,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:21:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:57,852 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:21:57,852 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:22:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:22:00,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:22:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051574665] [2024-11-28 03:22:00,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051574665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:22:00,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:22:00,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-28 03:22:00,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127353299] [2024-11-28 03:22:00,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:22:00,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 03:22:00,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:22:00,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 03:22:00,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-28 03:22:04,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 276 [2024-11-28 03:22:04,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 668 transitions, 5598 flow. Second operand has 20 states, 20 states have (on average 174.35) internal successors, (3487), 20 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:04,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:22:04,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 276 [2024-11-28 03:22:04,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:22:07,909 INFO L124 PetriNetUnfolderBase]: 1484/5521 cut-off events. [2024-11-28 03:22:07,909 INFO L125 PetriNetUnfolderBase]: For 18014/18258 co-relation queries the response was YES. [2024-11-28 03:22:07,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19886 conditions, 5521 events. 1484/5521 cut-off events. For 18014/18258 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 47026 event pairs, 151 based on Foata normal form. 76/5541 useless extension candidates. Maximal degree in co-relation 19752. Up to 802 conditions per place. [2024-11-28 03:22:07,950 INFO L140 encePairwiseOnDemand]: 244/276 looper letters, 475 selfloop transitions, 171 changer transitions 9/897 dead transitions. [2024-11-28 03:22:07,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 897 transitions, 8829 flow [2024-11-28 03:22:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-28 03:22:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-11-28 03:22:07,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6028 transitions. [2024-11-28 03:22:07,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6423699914748509 [2024-11-28 03:22:07,956 INFO L175 Difference]: Start difference. First operand has 367 places, 668 transitions, 5598 flow. Second operand 34 states and 6028 transitions. [2024-11-28 03:22:07,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 897 transitions, 8829 flow [2024-11-28 03:22:08,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 897 transitions, 8743 flow, removed 23 selfloop flow, removed 11 redundant places. [2024-11-28 03:22:08,060 INFO L231 Difference]: Finished difference. Result has 402 places, 734 transitions, 6802 flow [2024-11-28 03:22:08,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=5548, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=6802, PETRI_PLACES=402, PETRI_TRANSITIONS=734} [2024-11-28 03:22:08,061 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 123 predicate places. [2024-11-28 03:22:08,062 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 734 transitions, 6802 flow [2024-11-28 03:22:08,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 174.35) internal successors, (3487), 20 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:22:08,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:22:08,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:22:08,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:22:08,064 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:22:08,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:22:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1174966991, now seen corresponding path program 3 times [2024-11-28 03:22:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:22:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022524891] [2024-11-28 03:22:08,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:22:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:22:08,278 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 03:22:08,279 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:22:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:22:10,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:22:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022524891] [2024-11-28 03:22:10,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022524891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:22:10,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546157865] [2024-11-28 03:22:10,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:22:10,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:22:10,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:22:10,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:22:10,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:22:12,752 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 03:22:12,752 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:22:12,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-28 03:22:12,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:22:12,847 INFO L378 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 [2024-11-28 03:22:13,007 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:22:13,008 INFO L378 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 [2024-11-28 03:22:13,343 INFO L378 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 [2024-11-28 03:22:13,355 INFO L378 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 [2024-11-28 03:22:14,055 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:22:14,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 03:22:14,106 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:22:14,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 03:22:14,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-28 03:22:14,492 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:22:14,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-28 03:22:14,523 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:22:14,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2024-11-28 03:22:14,954 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-28 03:22:14,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2024-11-28 03:22:14,993 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-28 03:22:14,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2024-11-28 03:22:15,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:22:16,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 03:22:16,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-28 03:22:16,317 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:22:16,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2024-11-28 03:22:16,332 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:22:16,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2024-11-28 03:22:16,418 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:22:16,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-28 03:22:16,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:16,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2024-11-28 03:22:16,607 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:22:16,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2024-11-28 03:22:16,723 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:22:16,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2024-11-28 03:22:16,790 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-28 03:22:16,791 INFO L378 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 7 case distinctions, treesize of input 45 treesize of output 57 [2024-11-28 03:22:17,267 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-28 03:22:17,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 111 treesize of output 104 [2024-11-28 03:22:17,362 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-28 03:22:17,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 107 treesize of output 111 [2024-11-28 03:22:17,621 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-28 03:22:17,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 114 [2024-11-28 03:22:17,735 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-28 03:22:17,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 114 [2024-11-28 03:22:18,149 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-28 03:22:18,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 114 [2024-11-28 03:22:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:22:18,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:22:20,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:20,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 178 treesize of output 158 [2024-11-28 03:22:21,193 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 7 c_~B~0.offset))) (let ((.cse0 (+ c_~A~0.offset 7)) (.cse1 (+ c_~A~0.offset 4)) (.cse2 (+ c_~A~0.offset 5)) (.cse4 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3)) (.cse5 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse9 0))) (.cse6 (+ c_~A~0.offset 6))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_2559 Int)) (= (select (select (let ((.cse3 (store .cse5 c_~A~0.base v_arrayElimArr_1))) (store .cse3 |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select .cse3 |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse4 v_ArrVal_2559) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (= 0 (select (select (let ((.cse7 (store .cse5 c_~A~0.base v_arrayElimArr_1))) (store .cse7 |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select .cse7 |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse4 v_prenex_2) |c_t_funThread1of1ForFork0_#t~mem33.offset| v_prenex_1))) c_~B~0.base) (+ 4 c_~B~0.offset)))) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (= (select (select (let ((.cse8 (store .cse5 c_~A~0.base v_arrayElimArr_1))) (store .cse8 |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select .cse8 |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse4 v_prenex_4) |c_t_funThread1of1ForFork0_#t~mem33.offset| v_prenex_3))) c_~B~0.base) .cse9) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (= (select (select (let ((.cse10 (store .cse5 c_~A~0.base v_arrayElimArr_1))) (store .cse10 |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select .cse10 |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse4 v_prenex_6) |c_t_funThread1of1ForFork0_#t~mem33.offset| v_prenex_5))) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0))))))) is different from false [2024-11-28 03:22:26,143 INFO L349 Elim1Store]: treesize reduction 37, result has 61.5 percent of original size [2024-11-28 03:22:26,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 730 treesize of output 652 [2024-11-28 03:22:26,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:26,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 418 [2024-11-28 03:22:26,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 243 [2024-11-28 03:22:26,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:26,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 438 treesize of output 444 [2024-11-28 03:22:26,827 INFO L349 Elim1Store]: treesize reduction 37, result has 61.5 percent of original size [2024-11-28 03:22:26,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 935 treesize of output 797 [2024-11-28 03:22:26,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:26,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 418 [2024-11-28 03:22:26,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 243 [2024-11-28 03:22:26,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 438 treesize of output 444 [2024-11-28 03:22:27,328 INFO L349 Elim1Store]: treesize reduction 37, result has 61.5 percent of original size [2024-11-28 03:22:27,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 598 treesize of output 600 [2024-11-28 03:22:27,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:27,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 303 [2024-11-28 03:22:27,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:27,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 662 treesize of output 660 [2024-11-28 03:22:27,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:22:27,791 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2024-11-28 03:22:27,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1020 treesize of output 869 [2024-11-28 03:22:27,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 389 [2024-11-28 03:22:27,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 359 [2024-11-28 03:22:27,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:27,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 436 treesize of output 442 [2024-11-28 03:22:43,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,015 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2024-11-28 03:22:43,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,039 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-11-28 03:22:43,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,062 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2024-11-28 03:22:43,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,086 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-11-28 03:22:43,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,110 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-11-28 03:22:43,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,134 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2024-11-28 03:22:43,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,158 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-11-28 03:22:43,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,184 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-11-28 03:22:43,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,208 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2024-11-28 03:22:43,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,232 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-11-28 03:22:43,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:22:43,257 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-11-28 03:22:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:22:56,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546157865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:22:56,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:22:56,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 22] total 59 [2024-11-28 03:22:56,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41302003] [2024-11-28 03:22:56,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:22:56,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-28 03:22:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:22:56,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-28 03:22:56,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=3078, Unknown=73, NotChecked=114, Total=3540 [2024-11-28 03:23:10,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2024-11-28 03:23:10,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 734 transitions, 6802 flow. Second operand has 60 states, 60 states have (on average 112.3) internal successors, (6738), 60 states have internal predecessors, (6738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:23:10,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:23:10,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2024-11-28 03:23:10,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:23:59,393 INFO L124 PetriNetUnfolderBase]: 4009/11047 cut-off events. [2024-11-28 03:23:59,394 INFO L125 PetriNetUnfolderBase]: For 41874/41903 co-relation queries the response was YES. [2024-11-28 03:23:59,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43724 conditions, 11047 events. 4009/11047 cut-off events. For 41874/41903 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 97797 event pairs, 646 based on Foata normal form. 23/10951 useless extension candidates. Maximal degree in co-relation 43571. Up to 2077 conditions per place. [2024-11-28 03:23:59,468 INFO L140 encePairwiseOnDemand]: 233/276 looper letters, 1036 selfloop transitions, 254 changer transitions 25/1412 dead transitions. [2024-11-28 03:23:59,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 1412 transitions, 15196 flow [2024-11-28 03:23:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 03:23:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-28 03:23:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3983 transitions. [2024-11-28 03:23:59,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.450973731884058 [2024-11-28 03:23:59,473 INFO L175 Difference]: Start difference. First operand has 402 places, 734 transitions, 6802 flow. Second operand 32 states and 3983 transitions. [2024-11-28 03:23:59,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 1412 transitions, 15196 flow [2024-11-28 03:23:59,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 1412 transitions, 14987 flow, removed 28 selfloop flow, removed 18 redundant places. [2024-11-28 03:23:59,739 INFO L231 Difference]: Finished difference. Result has 431 places, 859 transitions, 9317 flow [2024-11-28 03:23:59,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=6662, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=9317, PETRI_PLACES=431, PETRI_TRANSITIONS=859} [2024-11-28 03:23:59,740 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 152 predicate places. [2024-11-28 03:23:59,740 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 859 transitions, 9317 flow [2024-11-28 03:23:59,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 112.3) internal successors, (6738), 60 states have internal predecessors, (6738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:23:59,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:23:59,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:23:59,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:23:59,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:23:59,945 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:23:59,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:23:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash 231405711, now seen corresponding path program 4 times [2024-11-28 03:23:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:23:59,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475216729] [2024-11-28 03:23:59,947 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:23:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:00,020 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:24:00,020 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:24:03,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475216729] [2024-11-28 03:24:03,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475216729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:24:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831425055] [2024-11-28 03:24:03,355 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:24:03,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:03,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:03,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:03,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:24:03,752 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:24:03,752 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:03,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-28 03:24:03,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:03,787 INFO L378 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 [2024-11-28 03:24:04,094 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:24:04,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:24:04,748 INFO L378 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 19 treesize of output 1 [2024-11-28 03:24:05,093 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 03:24:05,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-28 03:24:05,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-28 03:24:05,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-28 03:24:06,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-28 03:24:06,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2024-11-28 03:24:07,108 INFO L378 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 23 treesize of output 22 [2024-11-28 03:24:07,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 12 [2024-11-28 03:24:07,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 03:24:07,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 03:24:07,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 03:24:07,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 03:24:07,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 03:24:07,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 03:24:07,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 03:24:07,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-28 03:24:07,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:07,718 INFO L378 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 [2024-11-28 03:24:07,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:07,749 INFO L378 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 [2024-11-28 03:24:07,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-11-28 03:24:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:24:07,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:24:07,931 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2929 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2929 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 7 c_~B~0.offset))))) is different from false [2024-11-28 03:24:08,242 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_2929 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2929 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_2929 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2929 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) .cse2) 0))))) is different from false [2024-11-28 03:24:08,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_~B~0.offset)) (.cse0 (+ 6 c_~B~0.offset))) (and (forall ((v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2926) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2926) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2926) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~B~0.base (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2926) c_~B~0.base) .cse0 0) .cse1 0)) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) .cse0))))) is different from false [2024-11-28 03:24:08,559 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_~B~0.offset)) (.cse1 (+ 6 c_~B~0.offset))) (and (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_2922))) (store .cse0 c_~B~0.base (store (store (select (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2926) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_~A~0.base v_ArrVal_2922))) (store .cse3 c_~B~0.base (store (store (select (store .cse3 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2926) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_2922))) (store .cse4 c_~B~0.base (store (store (select (store .cse4 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2926) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= 0 (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_2922))) (store .cse5 c_~B~0.base (store (store (select (store .cse5 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2926) c_~B~0.base) .cse1 0) .cse2 0))) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2929) c_~B~0.base) .cse1))))) is different from false [2024-11-28 03:24:08,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_~B~0.offset)) (.cse3 (+ 7 c_~B~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_2922))) (store .cse0 c_~B~0.base (store (store (select (store .cse0 .cse1 v_ArrVal_2926) c_~B~0.base) .cse2 0) .cse3 0))) .cse1 v_ArrVal_2929) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_2922))) (store .cse4 c_~B~0.base (store (store (select (store .cse4 .cse1 v_ArrVal_2926) c_~B~0.base) .cse2 0) .cse3 0))) .cse1 v_ArrVal_2929) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_2922))) (store .cse5 c_~B~0.base (store (store (select (store .cse5 .cse1 v_ArrVal_2926) c_~B~0.base) .cse2 0) .cse3 0))) .cse1 v_ArrVal_2929) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= 0 (select (select (store (let ((.cse6 (store |c_#race| c_~A~0.base v_ArrVal_2922))) (store .cse6 c_~B~0.base (store (store (select (store .cse6 .cse1 v_ArrVal_2926) c_~B~0.base) .cse2 0) .cse3 0))) .cse1 v_ArrVal_2929) c_~B~0.base) (+ 4 c_~B~0.offset)))))) is different from false [2024-11-28 03:24:08,858 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse4 0))) (.cse2 (+ 6 c_~B~0.offset)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4))) (.cse3 (+ 7 c_~B~0.offset))) (and (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2922) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_2922) .cse1 v_ArrVal_2926) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_2929) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2922) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_2922) .cse1 v_ArrVal_2926) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_2929) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2922) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_2922) .cse1 v_ArrVal_2926) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_2929) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2929 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base v_ArrVal_2922) c_~B~0.base (store (store (select (store (store .cse0 c_~A~0.base v_ArrVal_2922) .cse1 v_ArrVal_2926) c_~B~0.base) .cse2 0) .cse3 0)) .cse1 v_ArrVal_2929) c_~B~0.base) .cse3) 0))))) is different from false [2024-11-28 03:24:08,890 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:24:08,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:24:08,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:08,921 INFO L378 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 2 case distinctions, treesize of input 36 treesize of output 42 [2024-11-28 03:24:08,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:24:08,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:08,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 46 treesize of output 28 [2024-11-28 03:24:08,947 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:24:08,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:24:08,955 INFO L349 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2024-11-28 03:24:08,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 1 [2024-11-28 03:24:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:24:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831425055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:24:11,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:24:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 44 [2024-11-28 03:24:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510714146] [2024-11-28 03:24:11,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:24:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-28 03:24:11,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:11,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-28 03:24:11,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1334, Unknown=20, NotChecked=474, Total=1980 [2024-11-28 03:24:11,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2024-11-28 03:24:11,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 859 transitions, 9317 flow. Second operand has 45 states, 45 states have (on average 113.6) internal successors, (5112), 45 states have internal predecessors, (5112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:11,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:11,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2024-11-28 03:24:11,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:24:30,867 INFO L124 PetriNetUnfolderBase]: 4735/13002 cut-off events. [2024-11-28 03:24:30,867 INFO L125 PetriNetUnfolderBase]: For 64493/64533 co-relation queries the response was YES. [2024-11-28 03:24:30,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55084 conditions, 13002 events. 4735/13002 cut-off events. For 64493/64533 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 119788 event pairs, 1006 based on Foata normal form. 17/12857 useless extension candidates. Maximal degree in co-relation 54914. Up to 2534 conditions per place. [2024-11-28 03:24:30,974 INFO L140 encePairwiseOnDemand]: 239/276 looper letters, 1025 selfloop transitions, 262 changer transitions 14/1398 dead transitions. [2024-11-28 03:24:30,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 1398 transitions, 16780 flow [2024-11-28 03:24:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 03:24:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-28 03:24:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3168 transitions. [2024-11-28 03:24:30,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4591304347826087 [2024-11-28 03:24:30,979 INFO L175 Difference]: Start difference. First operand has 431 places, 859 transitions, 9317 flow. Second operand 25 states and 3168 transitions. [2024-11-28 03:24:30,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 1398 transitions, 16780 flow [2024-11-28 03:24:31,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 1398 transitions, 16682 flow, removed 28 selfloop flow, removed 14 redundant places. [2024-11-28 03:24:31,460 INFO L231 Difference]: Finished difference. Result has 452 places, 958 transitions, 11967 flow [2024-11-28 03:24:31,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=9227, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=623, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=11967, PETRI_PLACES=452, PETRI_TRANSITIONS=958} [2024-11-28 03:24:31,462 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 173 predicate places. [2024-11-28 03:24:31,462 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 958 transitions, 11967 flow [2024-11-28 03:24:31,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 113.6) internal successors, (5112), 45 states have internal predecessors, (5112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:31,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:24:31,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:31,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:24:31,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 03:24:31,665 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:24:31,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1223569391, now seen corresponding path program 5 times [2024-11-28 03:24:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:24:31,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123269800] [2024-11-28 03:24:31,667 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:24:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:24:31,776 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-28 03:24:31,776 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:24:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:24:36,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123269800] [2024-11-28 03:24:36,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123269800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:24:36,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358652384] [2024-11-28 03:24:36,160 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:24:36,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:36,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:36,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:36,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:24:38,159 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-28 03:24:38,159 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:38,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-28 03:24:38,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:38,186 INFO L378 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 [2024-11-28 03:24:38,503 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 03:24:38,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-28 03:24:39,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:24:39,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:24:39,721 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-28 03:24:39,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2024-11-28 03:24:40,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:24:40,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-28 03:24:40,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:24:40,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-28 03:24:41,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-28 03:24:41,154 INFO L378 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 16 treesize of output 11 [2024-11-28 03:24:42,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2024-11-28 03:24:42,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 03:24:42,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-28 03:24:42,926 INFO L378 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 16 treesize of output 11 [2024-11-28 03:24:42,944 INFO L378 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 16 treesize of output 11 [2024-11-28 03:24:42,995 INFO L378 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 16 treesize of output 11 [2024-11-28 03:24:43,022 INFO L378 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 16 treesize of output 11 [2024-11-28 03:24:43,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:24:43,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:24:43,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:24:43,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 03:24:43,312 INFO L378 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 [2024-11-28 03:24:43,465 INFO L378 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 [2024-11-28 03:24:43,660 INFO L378 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 [2024-11-28 03:24:43,968 INFO L378 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 [2024-11-28 03:24:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:24:44,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:24:45,615 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 c_~B~0.offset)) (.cse3 (+ 6 c_~B~0.offset)) (.cse4 (+ 7 c_~B~0.offset))) (and (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3297))) (let ((.cse0 (store (store (store (select .cse1 c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) (store (store |c_#race| c_~B~0.base .cse0) |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select (store .cse1 c_~B~0.base .cse0) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|)))) c_~B~0.base) .cse2) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3297))) (let ((.cse5 (store (store (store (select .cse6 c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) (store (store |c_#race| c_~B~0.base .cse5) |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select (store .cse6 c_~B~0.base .cse5) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|)))) c_~B~0.base) .cse3) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int))) (= (select (select (let ((.cse8 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3297))) (let ((.cse7 (store (store (store (select .cse8 c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) (store (store |c_#race| c_~B~0.base .cse7) |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select (store .cse8 c_~B~0.base .cse7) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|)))) c_~B~0.base) .cse4) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int))) (= (select (select (let ((.cse10 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3297))) (let ((.cse9 (store (store (store (select .cse10 c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) (store (store |c_#race| c_~B~0.base .cse9) |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select (store .cse10 c_~B~0.base .cse9) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|)))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)))) is different from false [2024-11-28 03:24:46,003 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 6 c_~B~0.offset)) (.cse5 (+ 7 c_~B~0.offset)) (.cse3 (+ 5 c_~B~0.offset))) (and (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3293))) (let ((.cse2 (store .cse0 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3297))) (let ((.cse1 (store (store (store (select .cse2 c_~B~0.base) .cse3 0) .cse4 0) .cse5 0))) (store (store .cse0 c_~B~0.base .cse1) |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select (store .cse2 c_~B~0.base .cse1) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse4) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| c_~A~0.base v_ArrVal_3293))) (let ((.cse8 (store .cse6 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3297))) (let ((.cse7 (store (store (store (select .cse8 c_~B~0.base) .cse3 0) .cse4 0) .cse5 0))) (store (store .cse6 c_~B~0.base .cse7) |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select (store .cse8 c_~B~0.base .cse7) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse5) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (= (select (select (let ((.cse9 (store |c_#race| c_~A~0.base v_ArrVal_3293))) (let ((.cse11 (store .cse9 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3297))) (let ((.cse10 (store (store (store (select .cse11 c_~B~0.base) .cse3 0) .cse4 0) .cse5 0))) (store (store .cse9 c_~B~0.base .cse10) |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select (store .cse11 c_~B~0.base .cse10) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (= (select (select (let ((.cse12 (store |c_#race| c_~A~0.base v_ArrVal_3293))) (let ((.cse14 (store .cse12 |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3297))) (let ((.cse13 (store (store (store (select .cse14 c_~B~0.base) .cse3 0) .cse4 0) .cse5 0))) (store (store .cse12 c_~B~0.base .cse13) |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select (store .cse14 c_~B~0.base .cse13) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse3) 0)))) is different from false [2024-11-28 03:24:46,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (+ c_~A~0.offset 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| c_~A~0.base) .cse17)) (.cse5 (+ 5 c_~B~0.offset)) (.cse6 (+ 6 c_~B~0.offset)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) .cse17)) (.cse7 (+ 7 c_~B~0.offset))) (and (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3293))) (let ((.cse3 (store .cse0 .cse2 v_ArrVal_3297))) (let ((.cse1 (store (store (store (select .cse3 c_~B~0.base) .cse5 0) .cse6 0) .cse7 0))) (store (store .cse0 c_~B~0.base .cse1) .cse2 (store (select (store .cse3 c_~B~0.base .cse1) .cse2) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse5) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (= (select (select (let ((.cse8 (store |c_#race| c_~A~0.base v_ArrVal_3293))) (let ((.cse10 (store .cse8 .cse2 v_ArrVal_3297))) (let ((.cse9 (store (store (store (select .cse10 c_~B~0.base) .cse5 0) .cse6 0) .cse7 0))) (store (store .cse8 c_~B~0.base .cse9) .cse2 (store (select (store .cse10 c_~B~0.base .cse9) .cse2) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse6) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (= (select (select (let ((.cse11 (store |c_#race| c_~A~0.base v_ArrVal_3293))) (let ((.cse13 (store .cse11 .cse2 v_ArrVal_3297))) (let ((.cse12 (store (store (store (select .cse13 c_~B~0.base) .cse5 0) .cse6 0) .cse7 0))) (store (store .cse11 c_~B~0.base .cse12) .cse2 (store (select (store .cse13 c_~B~0.base .cse12) .cse2) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_3297 (Array Int Int)) (v_ArrVal_3293 (Array Int Int))) (= (select (select (let ((.cse14 (store |c_#race| c_~A~0.base v_ArrVal_3293))) (let ((.cse16 (store .cse14 .cse2 v_ArrVal_3297))) (let ((.cse15 (store (store (store (select .cse16 c_~B~0.base) .cse5 0) .cse6 0) .cse7 0))) (store (store .cse14 c_~B~0.base .cse15) .cse2 (store (select (store .cse16 c_~B~0.base .cse15) .cse2) .cse4 |t_funThread1of1ForFork0_#t~nondet36|))))) c_~B~0.base) .cse7) 0))))) is different from false [2024-11-28 03:24:46,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:46,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 114 [2024-11-28 03:24:46,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:24:46,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2024-11-28 03:24:46,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:46,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 114 [2024-11-28 03:24:46,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:24:46,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2024-11-28 03:24:46,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:24:46,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 136 [2024-11-28 03:24:46,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 290 [2024-11-28 03:24:46,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 03:24:46,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 03:24:46,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2024-11-28 03:24:46,416 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:24:46,417 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:24:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:24:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358652384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:24:49,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:24:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 52 [2024-11-28 03:24:49,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333962099] [2024-11-28 03:24:49,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:24:49,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-28 03:24:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:24:49,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-28 03:24:49,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2219, Unknown=8, NotChecked=294, Total=2756 [2024-11-28 03:24:52,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2024-11-28 03:24:52,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 958 transitions, 11967 flow. Second operand has 53 states, 53 states have (on average 113.0) internal successors, (5989), 53 states have internal predecessors, (5989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:24:52,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:24:52,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2024-11-28 03:24:52,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:25:14,521 INFO L124 PetriNetUnfolderBase]: 5457/14916 cut-off events. [2024-11-28 03:25:14,521 INFO L125 PetriNetUnfolderBase]: For 95436/95489 co-relation queries the response was YES. [2024-11-28 03:25:14,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66360 conditions, 14916 events. 5457/14916 cut-off events. For 95436/95489 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 141905 event pairs, 1252 based on Foata normal form. 18/14742 useless extension candidates. Maximal degree in co-relation 66177. Up to 3151 conditions per place. [2024-11-28 03:25:14,663 INFO L140 encePairwiseOnDemand]: 237/276 looper letters, 1092 selfloop transitions, 318 changer transitions 20/1527 dead transitions. [2024-11-28 03:25:14,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 1527 transitions, 20583 flow [2024-11-28 03:25:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-28 03:25:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-11-28 03:25:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3514 transitions. [2024-11-28 03:25:14,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45471014492753625 [2024-11-28 03:25:14,669 INFO L175 Difference]: Start difference. First operand has 452 places, 958 transitions, 11967 flow. Second operand 28 states and 3514 transitions. [2024-11-28 03:25:14,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 1527 transitions, 20583 flow [2024-11-28 03:25:15,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 1527 transitions, 20485 flow, removed 29 selfloop flow, removed 13 redundant places. [2024-11-28 03:25:15,946 INFO L231 Difference]: Finished difference. Result has 478 places, 1055 transitions, 15312 flow [2024-11-28 03:25:15,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=11872, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=15312, PETRI_PLACES=478, PETRI_TRANSITIONS=1055} [2024-11-28 03:25:15,947 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 199 predicate places. [2024-11-28 03:25:15,947 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 1055 transitions, 15312 flow [2024-11-28 03:25:15,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 113.0) internal successors, (5989), 53 states have internal predecessors, (5989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:25:15,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:25:15,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:25:15,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:25:16,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 03:25:16,149 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2024-11-28 03:25:16,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:25:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1208312866, now seen corresponding path program 1 times [2024-11-28 03:25:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:25:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564604119] [2024-11-28 03:25:16,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:25:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:25:18,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:25:18,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564604119] [2024-11-28 03:25:18,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564604119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:25:18,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690359279] [2024-11-28 03:25:18,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:25:18,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:25:18,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:25:18,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:25:18,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9380c83-3bbb-42d0-a2da-d2cf453a14c5/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:25:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:25:18,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-28 03:25:18,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:25:18,752 INFO L378 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 [2024-11-28 03:25:19,187 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:25:19,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 03:25:20,018 INFO L378 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 19 treesize of output 1 [2024-11-28 03:25:20,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:25:20,349 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-28 03:25:20,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2024-11-28 03:25:21,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-28 03:25:21,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-28 03:25:21,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-28 03:25:21,460 INFO L378 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 18 treesize of output 13 [2024-11-28 03:25:21,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-28 03:25:21,793 INFO L378 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 18 treesize of output 13 [2024-11-28 03:25:23,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 12 [2024-11-28 03:25:23,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2024-11-28 03:25:23,479 INFO L378 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 [2024-11-28 03:25:23,614 INFO L378 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 23 treesize of output 22 [2024-11-28 03:25:23,764 INFO L378 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 32 treesize of output 34 [2024-11-28 03:25:24,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-28 03:25:24,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2024-11-28 03:25:24,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2024-11-28 03:25:24,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 65 [2024-11-28 03:25:36,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 77 [2024-11-28 03:25:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:25:37,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:25:43,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:25:43,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-28 03:25:43,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:25:43,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-28 03:25:43,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-28 03:25:43,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-11-28 03:25:43,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-28 03:25:43,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:25:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-28 03:25:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690359279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:25:45,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:25:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 54 [2024-11-28 03:25:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035851034] [2024-11-28 03:25:45,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:25:45,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-28 03:25:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:25:45,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-28 03:25:45,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2656, Unknown=26, NotChecked=0, Total=2970 [2024-11-28 03:26:31,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 276 [2024-11-28 03:26:31,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1055 transitions, 15312 flow. Second operand has 55 states, 55 states have (on average 111.43636363636364) internal successors, (6129), 55 states have internal predecessors, (6129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:26:31,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:26:31,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 276 [2024-11-28 03:26:31,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:26:44,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:26:48,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:00,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:05,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:09,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:13,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:25,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:29,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:33,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:37,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:50,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:58,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:02,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:14,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:18,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:22,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:26,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:30,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:35,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:39,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:43,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:47,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:51,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:55,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:28:59,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:03,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:07,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:11,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:15,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:19,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:23,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:27,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:31,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:36,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:40,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:44,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:48,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:52,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:29:56,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:00,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:04,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:08,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:12,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:17,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:21,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:25,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:29,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:33,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:37,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:41,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:45,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:49,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:54,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:30:58,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:02,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:06,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:10,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:14,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:18,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:22,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:26,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:30,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:34,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:38,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:42,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:46,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:51,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:55,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:31:59,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:03,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:07,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:11,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:15,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:19,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:23,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:27,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:31,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:35,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:39,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:43,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:47,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:51,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:32:55,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:00,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:04,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:08,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:12,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:16,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:20,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:32,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:36,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:40,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:44,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:33:53,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:01,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:05,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:09,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:13,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:17,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:21,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:38,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:42,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:46,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:02,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:06,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:18,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]