./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_85-list2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_85-list2_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da9f6c449f4da806b6a3bb0aaf2c3c9171ea9b71d075f7e8b1d9543f656f7b8b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 06:20:38,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 06:20:38,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-13 06:20:38,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 06:20:38,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 06:20:38,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 06:20:38,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 06:20:38,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 06:20:38,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 06:20:38,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 06:20:38,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 06:20:38,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 06:20:38,760 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 06:20:38,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 06:20:38,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 06:20:38,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 06:20:38,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 06:20:38,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 06:20:38,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 06:20:38,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 06:20:38,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 06:20:38,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 06:20:38,763 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-13 06:20:38,764 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 06:20:38,764 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 06:20:38,764 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 06:20:38,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 06:20:38,765 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 06:20:38,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 06:20:38,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 06:20:38,766 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-13 06:20:38,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 06:20:38,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:20:38,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 06:20:38,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 06:20:38,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 06:20:38,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 06:20:38,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 06:20:38,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 06:20:38,768 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 06:20:38,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 06:20:38,768 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 06:20:38,768 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 06:20:38,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux 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 -> GemCutter 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 -> da9f6c449f4da806b6a3bb0aaf2c3c9171ea9b71d075f7e8b1d9543f656f7b8b [2024-11-13 06:20:38,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 06:20:39,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 06:20:39,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 06:20:39,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 06:20:39,013 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 06:20:39,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_85-list2_racefree.i [2024-11-13 06:20:40,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 06:20:40,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 06:20:40,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_85-list2_racefree.i [2024-11-13 06:20:40,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fb66f0b5e/9bf7241b94394791b215e64c531858d4/FLAG623c865fa [2024-11-13 06:20:40,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fb66f0b5e/9bf7241b94394791b215e64c531858d4 [2024-11-13 06:20:40,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 06:20:40,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 06:20:40,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 06:20:40,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 06:20:40,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 06:20:40,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:20:40" (1/1) ... [2024-11-13 06:20:40,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da4dbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:40, skipping insertion in model container [2024-11-13 06:20:40,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:20:40" (1/1) ... [2024-11-13 06:20:40,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 06:20:41,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:20:41,231 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 06:20:41,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 06:20:41,408 INFO L204 MainTranslator]: Completed translation [2024-11-13 06:20:41,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41 WrapperNode [2024-11-13 06:20:41,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 06:20:41,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 06:20:41,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 06:20:41,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 06:20:41,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,472 INFO L138 Inliner]: procedures = 280, calls = 97, calls flagged for inlining = 11, calls inlined = 12, statements flattened = 571 [2024-11-13 06:20:41,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 06:20:41,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 06:20:41,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 06:20:41,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 06:20:41,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,518 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 06:20:41,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 06:20:41,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 06:20:41,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 06:20:41,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (1/1) ... [2024-11-13 06:20:41,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 06:20:41,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:20:41,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 06:20:41,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 06:20:41,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 06:20:41,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 06:20:41,647 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2024-11-13 06:20:41,647 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2024-11-13 06:20:41,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 06:20:41,647 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 06:20:41,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 06:20:41,647 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2024-11-13 06:20:41,647 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2024-11-13 06:20:41,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 06:20:41,648 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 06:20:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 06:20:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 06:20:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 06:20:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2024-11-13 06:20:41,649 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2024-11-13 06:20:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 06:20:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 06:20:41,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 06:20:41,652 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 06:20:41,826 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 06:20:41,828 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 06:20:42,480 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 06:20:42,480 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 06:20:42,535 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 06:20:42,539 INFO L316 CfgBuilder]: Removed 28 assume(true) statements. [2024-11-13 06:20:42,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:20:42 BoogieIcfgContainer [2024-11-13 06:20:42,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 06:20:42,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 06:20:42,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 06:20:42,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 06:20:42,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 06:20:40" (1/3) ... [2024-11-13 06:20:42,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c53e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:20:42, skipping insertion in model container [2024-11-13 06:20:42,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:20:41" (2/3) ... [2024-11-13 06:20:42,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c53e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:20:42, skipping insertion in model container [2024-11-13 06:20:42,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:20:42" (3/3) ... [2024-11-13 06:20:42,551 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_85-list2_racefree.i [2024-11-13 06:20:42,566 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 06:20:42,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-13 06:20:42,567 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 06:20:42,718 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-11-13 06:20:42,828 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:20:42,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 06:20:42,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:20:42,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-13 06:20:42,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-13 06:20:42,870 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:20:42,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t3_funThread1of1ForFork0 ======== [2024-11-13 06:20:42,890 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=PARTIAL_ORDER_FA, 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;@3771c0a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:20:42,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 06:21:07,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t3_funErr0ASSERT_VIOLATIONDATA_RACE === [t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr2ASSERT_VIOLATIONDATA_RACE, t3_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-13 06:21:07,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1338532225, now seen corresponding path program 1 times [2024-11-13 06:21:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791371410] [2024-11-13 06:21:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:21:08,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:08,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791371410] [2024-11-13 06:21:08,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791371410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:08,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886794105] [2024-11-13 06:21:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:08,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:08,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:08,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:08,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 06:21:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:08,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 06:21:08,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 06:21:08,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 06:21:08,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886794105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:08,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 06:21:08,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-13 06:21:08,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146009208] [2024-11-13 06:21:08,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:08,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:21:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:08,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:21:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:08,643 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:08,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 75.0) internal successors, (150), 3 states have internal predecessors, (150), 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-13 06:21:08,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:12,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:12,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 06:21:13,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-13 06:21:13,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t3_funErr1ASSERT_VIOLATIONDATA_RACE === [t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr2ASSERT_VIOLATIONDATA_RACE, t3_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-13 06:21:13,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:13,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1109040601, now seen corresponding path program 1 times [2024-11-13 06:21:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:13,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891667381] [2024-11-13 06:21:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:13,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:21:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891667381] [2024-11-13 06:21:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891667381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224867216] [2024-11-13 06:21:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:13,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:13,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:13,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:13,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 06:21:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:13,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 06:21:13,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:21:13,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 06:21:13,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224867216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:13,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:13,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-13 06:21:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471854053] [2024-11-13 06:21:13,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:13,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 06:21:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:13,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 06:21:13,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 06:21:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:13,752 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:13,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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-13 06:21:13,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:13,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:15,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2024-11-13 06:21:15,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-13 06:21:15,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-13 06:21:15,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-13 06:21:15,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-13 06:21:15,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-13 06:21:15,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-13 06:21:15,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-13 06:21:15,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 06:21:15,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:15,863 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-13 06:21:15,864 INFO L317 ceAbstractionStarter]: Result for error location t3_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/4) [2024-11-13 06:21:15,872 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:21:15,875 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:21:15,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork1 ======== [2024-11-13 06:21:15,877 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=PARTIAL_ORDER_FA, 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;@3771c0a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:21:15,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 06:21:19,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-13 06:21:19,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:19,027 INFO L85 PathProgramCache]: Analyzing trace with hash -825745241, now seen corresponding path program 1 times [2024-11-13 06:21:19,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:19,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499996207] [2024-11-13 06:21:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:19,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:19,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499996207] [2024-11-13 06:21:19,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499996207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:19,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183972250] [2024-11-13 06:21:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:19,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:19,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:19,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:19,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 06:21:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:19,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 06:21:19,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:19,341 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-13 06:21:19,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 06:21:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183972250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:19,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 06:21:19,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-13 06:21:19,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659962648] [2024-11-13 06:21:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:19,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:21:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:19,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:21:19,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:19,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:19,346 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:19,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 66.0) internal successors, (132), 3 states have internal predecessors, (132), 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-13 06:21:19,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:19,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 06:21:19,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:19,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-13 06:21:19,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1351692437, now seen corresponding path program 1 times [2024-11-13 06:21:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:19,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543105992] [2024-11-13 06:21:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:19,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:20,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:20,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543105992] [2024-11-13 06:21:20,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543105992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:20,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73593849] [2024-11-13 06:21:20,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:20,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:20,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 06:21:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:20,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 06:21:20,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:20,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:20,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73593849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:20,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:20,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-13 06:21:20,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893472486] [2024-11-13 06:21:20,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:20,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 06:21:20,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:20,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 06:21:20,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 06:21:20,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:20,263 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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-13 06:21:20,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:20,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:22,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:22,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2024-11-13 06:21:22,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-13 06:21:22,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-13 06:21:22,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-13 06:21:22,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-13 06:21:22,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-13 06:21:22,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-13 06:21:22,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-13 06:21:22,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 06:21:22,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:22,369 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-13 06:21:22,369 INFO L317 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork1 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (2/4) [2024-11-13 06:21:22,379 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:21:22,381 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:21:22,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of1ForFork2 ======== [2024-11-13 06:21:22,383 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=PARTIAL_ORDER_FA, 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;@3771c0a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:21:22,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 06:21:22,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:22,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2099967564, now seen corresponding path program 1 times [2024-11-13 06:21:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:22,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399982826] [2024-11-13 06:21:22,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:22,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:23,491 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-13 06:21:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:23,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399982826] [2024-11-13 06:21:23,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399982826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:23,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:23,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:23,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069363634] [2024-11-13 06:21:23,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:23,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:23,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:23,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:23,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:23,495 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:23,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 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-13 06:21:23,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:23,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 06:21:23,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:23,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:23,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1118677817, now seen corresponding path program 1 times [2024-11-13 06:21:23,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:23,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504283377] [2024-11-13 06:21:23,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:24,337 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-13 06:21:24,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:24,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504283377] [2024-11-13 06:21:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504283377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:24,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:24,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974483942] [2024-11-13 06:21:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:24,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:24,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:24,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:24,343 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:24,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 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-13 06:21:24,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:24,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:24,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 06:21:24,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr2ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:24,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1321487455, now seen corresponding path program 1 times [2024-11-13 06:21:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240234152] [2024-11-13 06:21:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:25,028 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-13 06:21:25,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:25,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240234152] [2024-11-13 06:21:25,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240234152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:25,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:25,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:21:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989872585] [2024-11-13 06:21:25,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:25,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:21:25,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:21:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:21:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:25,038 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:25,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 70.5) internal successors, (141), 3 states have internal predecessors, (141), 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-13 06:21:25,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:25,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:25,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:26,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 06:21:26,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:26,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1723616631, now seen corresponding path program 1 times [2024-11-13 06:21:26,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:26,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548598129] [2024-11-13 06:21:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:26,631 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-13 06:21:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548598129] [2024-11-13 06:21:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548598129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:26,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:26,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:26,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803885906] [2024-11-13 06:21:26,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:26,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:26,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:26,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:26,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:26,636 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:26,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 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-13 06:21:26,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:26,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:26,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:26,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:27,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 06:21:27,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:27,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:27,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1139595809, now seen corresponding path program 1 times [2024-11-13 06:21:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986522868] [2024-11-13 06:21:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:28,246 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-13 06:21:28,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:28,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986522868] [2024-11-13 06:21:28,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986522868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:28,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:28,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:28,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536757915] [2024-11-13 06:21:28,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:28,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:28,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:28,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:28,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:28,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:28,250 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:28,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.2) internal successors, (166), 6 states have internal predecessors, (166), 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-13 06:21:28,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:28,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:28,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 06:21:28,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:28,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1196743324, now seen corresponding path program 1 times [2024-11-13 06:21:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:28,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908522795] [2024-11-13 06:21:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:29,338 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-13 06:21:29,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:29,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908522795] [2024-11-13 06:21:29,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908522795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:29,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:29,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:21:29,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471606903] [2024-11-13 06:21:29,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:29,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:21:29,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:29,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:21:29,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:21:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:29,345 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:29,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 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-13 06:21:29,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:29,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:29,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 06:21:29,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:29,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2049562454, now seen corresponding path program 1 times [2024-11-13 06:21:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:29,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297996451] [2024-11-13 06:21:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:29,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:30,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:30,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297996451] [2024-11-13 06:21:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297996451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:30,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341026029] [2024-11-13 06:21:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:30,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:30,976 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:30,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 06:21:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:31,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 06:21:31,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:31,370 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 13 treesize of output 9 [2024-11-13 06:21:31,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:21:31,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:31,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:21:31,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:31,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:21:31,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:21:31,575 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-13 06:21:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:31,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:31,599 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1844 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of1ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_1844 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~node#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1844 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of1ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_1844 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~node#1.offset| 6))))) is different from false [2024-11-13 06:21:31,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of1ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~node#1.base|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_1844 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of1ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_1844 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~node#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1844 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~node#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_1844 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_1844) |c_t1_funThread1of1ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:21:35,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:35,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:21:35,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:35,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:21:35,839 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:35,840 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:35,844 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:35,844 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:35,849 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:35,849 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:21:36,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341026029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:36,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:36,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-13 06:21:36,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715816517] [2024-11-13 06:21:36,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:36,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 06:21:36,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:36,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 06:21:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=568, Unknown=26, NotChecked=102, Total=812 [2024-11-13 06:21:36,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:36,009 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:36,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 11.785714285714286) internal successors, (330), 29 states have internal predecessors, (330), 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-13 06:21:36,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:36,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:36,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:36,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:36,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:36,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:36,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:37,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-13 06:21:37,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:37,630 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:37,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash -540532025, now seen corresponding path program 1 times [2024-11-13 06:21:37,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:37,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071385320] [2024-11-13 06:21:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:37,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:37,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071385320] [2024-11-13 06:21:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071385320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:37,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949029257] [2024-11-13 06:21:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:37,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:37,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:37,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:37,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 06:21:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:37,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 06:21:37,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:38,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:38,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949029257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:38,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:38,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-13 06:21:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55476024] [2024-11-13 06:21:38,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:38,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 06:21:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:38,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 06:21:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 06:21:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:38,146 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:38,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.1) internal successors, (341), 10 states have internal predecessors, (341), 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-13 06:21:38,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:38,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:38,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:38,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:38,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:38,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:38,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:38,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:39,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 06:21:39,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 06:21:39,468 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:39,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:39,468 INFO L85 PathProgramCache]: Analyzing trace with hash -850625379, now seen corresponding path program 1 times [2024-11-13 06:21:39,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:39,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058479647] [2024-11-13 06:21:39,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058479647] [2024-11-13 06:21:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058479647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223217857] [2024-11-13 06:21:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:40,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:40,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:40,141 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:40,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 06:21:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:40,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:21:40,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:40,593 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 13 treesize of output 9 [2024-11-13 06:21:40,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:21:40,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:40,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:21:40,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:40,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:21:40,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:21:40,824 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-13 06:21:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:40,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:40,848 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7)))) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))) is different from false [2024-11-13 06:21:40,913 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)))) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-11-13 06:21:40,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_2434 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2434) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-11-13 06:21:42,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:42,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:21:42,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:42,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:21:42,897 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:42,898 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:42,902 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:42,902 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:42,906 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:42,906 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:21:43,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223217857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:43,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:43,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-11-13 06:21:43,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121495313] [2024-11-13 06:21:43,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:43,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 06:21:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:43,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 06:21:43,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=744, Unknown=16, NotChecked=174, Total=1056 [2024-11-13 06:21:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:43,129 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:43,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 11.71875) internal successors, (375), 33 states have internal predecessors, (375), 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-13 06:21:43,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:43,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:43,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:43,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:21:44,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 06:21:44,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:44,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:44,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1281557921, now seen corresponding path program 1 times [2024-11-13 06:21:44,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951401585] [2024-11-13 06:21:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:45,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951401585] [2024-11-13 06:21:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951401585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533103346] [2024-11-13 06:21:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:45,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:45,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:45,674 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:45,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 06:21:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:45,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:21:45,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:46,105 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 13 treesize of output 9 [2024-11-13 06:21:46,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:21:46,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:46,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:21:46,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:46,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:21:46,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:21:46,295 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-13 06:21:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:46,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:48,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2688) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2688) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2688) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_2688) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) 0))))) is different from false [2024-11-13 06:21:52,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:52,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:21:52,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:52,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2024-11-13 06:21:52,447 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:52,447 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:52,452 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:52,452 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:52,456 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:52,457 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533103346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:52,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-11-13 06:21:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600958570] [2024-11-13 06:21:52,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:52,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 06:21:52,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:52,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 06:21:52,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=805, Unknown=61, NotChecked=60, Total=1056 [2024-11-13 06:21:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:52,685 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:52,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 11.15625) internal successors, (357), 33 states have internal predecessors, (357), 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-13 06:21:52,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:52,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:52,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:52,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:52,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:52,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:52,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:52,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:52,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:21:52,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:54,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:21:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:21:54,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-13 06:21:54,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 06:21:54,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:54,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1321488449, now seen corresponding path program 1 times [2024-11-13 06:21:54,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:54,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945793430] [2024-11-13 06:21:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:54,423 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-13 06:21:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945793430] [2024-11-13 06:21:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945793430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:21:54,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:21:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:21:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841573442] [2024-11-13 06:21:54,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:21:54,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:21:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:21:54,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:21:54,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:54,426 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:54,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 70.5) internal successors, (141), 3 states have internal predecessors, (141), 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-13 06:21:54,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:54,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:54,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:21:54,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:21:54,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:21:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:21:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:54,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 06:21:54,629 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:54,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:54,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1610927134, now seen corresponding path program 1 times [2024-11-13 06:21:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:54,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985518215] [2024-11-13 06:21:54,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:54,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:55,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985518215] [2024-11-13 06:21:55,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985518215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347582899] [2024-11-13 06:21:55,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:55,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:55,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:55,090 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:55,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 06:21:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:55,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:21:55,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:55,511 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 13 treesize of output 9 [2024-11-13 06:21:55,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:21:55,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:55,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:21:55,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:55,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:21:55,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:21:55,694 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-13 06:21:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:55,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:21:55,714 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))) is different from false [2024-11-13 06:21:55,771 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_3076 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1))) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)))) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-11-13 06:21:55,782 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4))))))) is different from false [2024-11-13 06:21:55,793 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) (.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse3 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse3) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_3076 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3076) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) |c_t1_funThread1of1ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-11-13 06:21:55,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:55,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:21:55,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:55,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:21:55,811 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:55,811 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:55,814 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:55,815 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:55,818 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:21:55,818 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:21:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:21:55,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347582899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:21:55,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:21:55,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-11-13 06:21:55,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884840410] [2024-11-13 06:21:55,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:21:55,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-13 06:21:55,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:21:55,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-13 06:21:55,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=824, Unknown=4, NotChecked=244, Total=1190 [2024-11-13 06:21:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:55,996 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:21:55,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 11.029411764705882) internal successors, (375), 35 states have internal predecessors, (375), 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-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:55,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:21:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:21:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:21:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:21:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:21:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:21:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:21:57,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-13 06:21:57,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 06:21:57,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:21:57,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:21:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1705117118, now seen corresponding path program 1 times [2024-11-13 06:21:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:21:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536808463] [2024-11-13 06:21:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:21:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:57,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:21:57,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536808463] [2024-11-13 06:21:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536808463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:21:57,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647249808] [2024-11-13 06:21:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:21:57,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:21:57,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:21:57,811 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:21:57,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 06:21:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:21:58,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:21:58,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:21:58,216 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 13 treesize of output 9 [2024-11-13 06:21:58,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:21:58,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:58,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:21:58,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:21:58,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:21:58,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:21:58,397 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-13 06:21:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:21:58,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:00,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) 0))))) is different from false [2024-11-13 06:22:00,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) 0))))) is different from false [2024-11-13 06:22:00,429 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 5)) (.cse3 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) .cse3) 0)) (forall ((v_ArrVal_3330 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3330) |c_t1_funThread1of1ForFork2_insert_~list#1.base|) (+ |c_t1_funThread1of1ForFork2_insert_~list#1.offset| 4)) 0))))) is different from false [2024-11-13 06:22:00,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:00,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:22:00,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:00,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2024-11-13 06:22:00,449 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:00,450 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:22:00,453 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:00,454 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:22:00,457 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:00,457 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:22:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:00,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647249808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:00,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:00,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-11-13 06:22:00,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284253163] [2024-11-13 06:22:00,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:00,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-13 06:22:00,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:00,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-13 06:22:00,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=869, Unknown=15, NotChecked=186, Total=1190 [2024-11-13 06:22:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:00,633 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:00,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 10.5) internal successors, (357), 35 states have internal predecessors, (357), 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-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:00,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:01,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 06:22:02,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 06:22:02,024 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:02,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1028422225, now seen corresponding path program 1 times [2024-11-13 06:22:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:02,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514209180] [2024-11-13 06:22:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:02,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:02,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514209180] [2024-11-13 06:22:02,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514209180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:02,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450933226] [2024-11-13 06:22:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:02,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:02,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:02,522 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:22:02,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 06:22:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:02,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 06:22:02,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:02,926 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 13 treesize of output 9 [2024-11-13 06:22:02,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:22:03,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:03,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:22:03,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:03,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:22:03,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:03,166 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-13 06:22:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:03,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:05,294 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 6 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 5 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 4 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|))))) is different from false [2024-11-13 06:22:05,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|) .cse2 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 4 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse2) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 5 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|))))) is different from false [2024-11-13 06:22:05,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) (.cse3 (+ 6 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|) .cse3 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|) .cse2 |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_3565 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet4#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse2) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 4 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse3) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|))))) is different from false [2024-11-13 06:22:05,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:05,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:22:05,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:05,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:22:05,347 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:05,348 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:22:05,352 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:05,352 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:22:05,358 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:05,359 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:22:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450933226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:05,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-13 06:22:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762163642] [2024-11-13 06:22:05,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:05,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 06:22:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 06:22:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=547, Unknown=11, NotChecked=150, Total=812 [2024-11-13 06:22:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:05,452 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:05,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 7.785714285714286) internal successors, (218), 29 states have internal predecessors, (218), 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-13 06:22:05,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:05,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:05,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:05,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:05,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:07,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-13 06:22:07,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 06:22:07,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:07,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 644689988, now seen corresponding path program 1 times [2024-11-13 06:22:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322546027] [2024-11-13 06:22:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:08,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322546027] [2024-11-13 06:22:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322546027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095457] [2024-11-13 06:22:08,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:08,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:08,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:08,175 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:22:08,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 06:22:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:08,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 06:22:08,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:08,482 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-13 06:22:08,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-13 06:22:08,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:08,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-13 06:22:08,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:08,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-13 06:22:08,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:08,660 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 43 treesize of output 32 [2024-11-13 06:22:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:08,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:08,681 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 2 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork2_init_~p#1.offset| 1)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) |c_t1_funThread1of1ForFork2_init_~p#1.offset|) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 3 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|))) is different from false [2024-11-13 06:22:08,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)))) (and (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 2 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)))) (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork2_init_~p#1.offset| 1)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|))))) is different from false [2024-11-13 06:22:08,761 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) (.cse2 (+ 3 |c_t1_funThread1of1ForFork2_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base| (store (store (select |c_#race| |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1 |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|) .cse2 |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)))) (and (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ |c_t1_funThread1of1ForFork2_init_~p#1.offset| 1)) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) |c_t1_funThread1of1ForFork2_init_~p#1.offset|) |c_t1_funThread1of1ForFork2_init_#t~nondet3#1|)) (forall ((v_ArrVal_3773 (Array Int Int))) (= |c_t1_funThread1of1ForFork2_init_#t~nondet3#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3773) |c_t1_funThread1of1ForFork2_init_~p#1.base|) .cse2)))))) is different from false [2024-11-13 06:22:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:22:10,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:10,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-11-13 06:22:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660181900] [2024-11-13 06:22:10,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-13 06:22:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 06:22:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=509, Unknown=3, NotChecked=144, Total=756 [2024-11-13 06:22:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:10,885 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:10,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 7.444444444444445) internal successors, (201), 28 states have internal predecessors, (201), 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-13 06:22:10,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:10,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:10,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 06:22:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:12,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2024-11-13 06:22:12,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-13 06:22:12,036 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-13 06:22:12,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-13 06:22:12,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-13 06:22:12,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-13 06:22:12,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-13 06:22:12,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 06:22:12,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:12,247 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 06:22:12,248 INFO L317 ceAbstractionStarter]: Result for error location t1_funThread1of1ForFork2 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (3/4) [2024-11-13 06:22:12,251 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:22:12,252 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:22:12,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 06:22:12,253 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=PARTIAL_ORDER_FA, 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;@3771c0a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:22:12,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-13 06:22:12,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-13 06:22:12,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:12,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1267596029, now seen corresponding path program 1 times [2024-11-13 06:22:12,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:12,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972951917] [2024-11-13 06:22:12,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:12,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:12,267 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-13 06:22:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972951917] [2024-11-13 06:22:12,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972951917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:12,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:12,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:22:12,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799281261] [2024-11-13 06:22:12,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:12,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:22:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:22:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:22:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,270 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:12,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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-13 06:22:12,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 06:22:12,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-13 06:22:12,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1942460582, now seen corresponding path program 1 times [2024-11-13 06:22:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:12,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487628806] [2024-11-13 06:22:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:12,289 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-13 06:22:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:12,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487628806] [2024-11-13 06:22:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487628806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:12,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:12,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:22:12,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268733237] [2024-11-13 06:22:12,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:12,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:22:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:12,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:22:12,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:22:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,291 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:12,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-13 06:22:12,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 06:22:12,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-13 06:22:12,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:12,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2042168887, now seen corresponding path program 1 times [2024-11-13 06:22:12,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:12,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117434757] [2024-11-13 06:22:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:12,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:12,398 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-13 06:22:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117434757] [2024-11-13 06:22:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117434757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:12,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961865865] [2024-11-13 06:22:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:12,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,400 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:12,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 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-13 06:22:12,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 06:22:12,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-13 06:22:12,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1766123996, now seen corresponding path program 1 times [2024-11-13 06:22:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:12,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874764745] [2024-11-13 06:22:12,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:12,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:12,548 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-13 06:22:12,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:12,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874764745] [2024-11-13 06:22:12,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874764745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:12,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:12,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686878539] [2024-11-13 06:22:12,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:12,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:12,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:12,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:12,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,551 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:12,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 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-13 06:22:12,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 06:22:12,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-13 06:22:12,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2101971401, now seen corresponding path program 1 times [2024-11-13 06:22:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:12,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864306786] [2024-11-13 06:22:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:12,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:12,608 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-13 06:22:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864306786] [2024-11-13 06:22:12,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864306786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:12,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:22:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153617002] [2024-11-13 06:22:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:12,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:22:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:22:12,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:22:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,611 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:12,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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-13 06:22:12,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 06:22:12,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-13 06:22:12,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1143590106, now seen corresponding path program 1 times [2024-11-13 06:22:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:12,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312267207] [2024-11-13 06:22:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:12,641 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-13 06:22:12,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:12,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312267207] [2024-11-13 06:22:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312267207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:12,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:12,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:22:12,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591560740] [2024-11-13 06:22:12,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:12,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:22:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:22:12,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:22:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,643 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:12,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 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-13 06:22:12,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 06:22:12,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-13 06:22:12,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash -741827082, now seen corresponding path program 1 times [2024-11-13 06:22:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:12,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86592620] [2024-11-13 06:22:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:12,949 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-13 06:22:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86592620] [2024-11-13 06:22:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86592620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494749026] [2024-11-13 06:22:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:12,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:12,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:12,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:12,952 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:12,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.0) internal successors, (110), 6 states have internal predecessors, (110), 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-13 06:22:12,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:12,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:12,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:13,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 06:22:13,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-13 06:22:13,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1500983658, now seen corresponding path program 1 times [2024-11-13 06:22:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247309017] [2024-11-13 06:22:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:22:13,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 06:22:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 06:22:13,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 06:22:13,271 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 06:22:13,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2024-11-13 06:22:13,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2024-11-13 06:22:13,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2024-11-13 06:22:13,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2024-11-13 06:22:13,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2024-11-13 06:22:13,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2024-11-13 06:22:13,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 17 remaining) [2024-11-13 06:22:13,273 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 17 remaining) [2024-11-13 06:22:13,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 06:22:13,277 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 06:22:13,277 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (4/4) [2024-11-13 06:22:13,278 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 06:22:13,278 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 06:22:13,350 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-13 06:22:13,356 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:22:13,358 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 06:22:13,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of2ForFork2 ======== [2024-11-13 06:22:13,358 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=PARTIAL_ORDER_FA, 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;@3771c0a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 06:22:13,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 06:22:13,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:13,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash -9458202, now seen corresponding path program 1 times [2024-11-13 06:22:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271861121] [2024-11-13 06:22:13,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271861121] [2024-11-13 06:22:14,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271861121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:14,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:14,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507585592] [2024-11-13 06:22:14,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:14,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:14,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:14,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:14,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:14,059 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:14,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 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-13 06:22:14,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:14,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 06:22:14,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:14,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1096000277, now seen corresponding path program 1 times [2024-11-13 06:22:14,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:14,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980467471] [2024-11-13 06:22:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:15,041 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-13 06:22:15,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:15,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980467471] [2024-11-13 06:22:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980467471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:15,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:15,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:15,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461998890] [2024-11-13 06:22:15,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:15,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:15,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:15,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:15,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:15,046 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:15,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 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-13 06:22:15,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:15,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:15,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:15,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 06:22:15,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr2ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:15,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:15,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1040086127, now seen corresponding path program 1 times [2024-11-13 06:22:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338690295] [2024-11-13 06:22:15,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:15,509 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-13 06:22:15,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338690295] [2024-11-13 06:22:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338690295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:15,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:15,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 06:22:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930961990] [2024-11-13 06:22:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:22:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:15,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:22:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:22:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:15,512 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:15,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 70.5) internal successors, (141), 3 states have internal predecessors, (141), 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-13 06:22:15,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:15,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:15,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:16,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 06:22:16,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:16,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:16,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1485671611, now seen corresponding path program 1 times [2024-11-13 06:22:16,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:16,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959365862] [2024-11-13 06:22:16,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:16,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:16,790 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-13 06:22:16,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:16,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959365862] [2024-11-13 06:22:16,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959365862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:16,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:16,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:16,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977884733] [2024-11-13 06:22:16,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:16,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:16,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:16,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:16,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:16,793 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:16,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.4) internal successors, (157), 6 states have internal predecessors, (157), 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-13 06:22:16,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:16,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:16,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 06:22:18,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:18,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1879555380, now seen corresponding path program 1 times [2024-11-13 06:22:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120134143] [2024-11-13 06:22:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:18,353 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-13 06:22:18,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:18,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120134143] [2024-11-13 06:22:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120134143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:18,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736278960] [2024-11-13 06:22:18,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:18,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:18,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:18,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:18,355 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:18,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.2) internal successors, (166), 6 states have internal predecessors, (166), 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-13 06:22:18,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:18,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,356 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:18,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 06:22:18,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:18,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash 66675921, now seen corresponding path program 1 times [2024-11-13 06:22:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:18,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186878972] [2024-11-13 06:22:18,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:19,409 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-13 06:22:19,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186878972] [2024-11-13 06:22:19,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186878972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:19,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:19,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 06:22:19,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420446667] [2024-11-13 06:22:19,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:19,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:19,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:19,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:19,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:19,412 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:19,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 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-13 06:22:19,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:19,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:19,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:19,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:19,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:19,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:25,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 06:22:25,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:25,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash 607738596, now seen corresponding path program 1 times [2024-11-13 06:22:25,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:25,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730788737] [2024-11-13 06:22:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:25,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:25,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:25,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730788737] [2024-11-13 06:22:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730788737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49778953] [2024-11-13 06:22:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:25,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:25,522 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:22:25,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 06:22:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:25,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 06:22:25,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:25,979 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 13 treesize of output 9 [2024-11-13 06:22:26,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:22:26,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:26,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:22:26,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:26,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:22:26,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:26,326 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-13 06:22:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:26,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:26,346 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-11-13 06:22:26,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:22:26,441 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:22:26,463 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5059 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_5059) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse3) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:22:26,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:26,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:22:26,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:26,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:22:26,496 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:26,496 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:22:26,505 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:26,505 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:22:26,510 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:22:26,511 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:22:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:22:26,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49778953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:26,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-13 06:22:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274813250] [2024-11-13 06:22:26,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:26,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-13 06:22:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:26,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 06:22:26,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=510, Unknown=4, NotChecked=196, Total=812 [2024-11-13 06:22:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:26,761 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 11.785714285714286) internal successors, (330), 29 states have internal predecessors, (330), 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-13 06:22:26,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:26,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:26,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:26,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:26,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:26,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:26,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:31,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-13 06:22:31,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:31,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:31,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1393476654, now seen corresponding path program 1 times [2024-11-13 06:22:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:31,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661209982] [2024-11-13 06:22:31,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:31,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 06:22:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661209982] [2024-11-13 06:22:31,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661209982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:31,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:31,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 06:22:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026053609] [2024-11-13 06:22:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:31,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 06:22:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:31,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 06:22:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-13 06:22:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:31,850 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:31,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 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-13 06:22:31,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:31,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:31,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:31,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:35,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 06:22:35,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:35,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1055183686, now seen corresponding path program 1 times [2024-11-13 06:22:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:35,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073472333] [2024-11-13 06:22:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:22:36,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:36,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073472333] [2024-11-13 06:22:36,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073472333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:36,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059389740] [2024-11-13 06:22:36,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:36,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:36,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:36,383 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:22:36,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 06:22:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:36,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 06:22:36,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:36,786 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-13 06:22:37,003 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 13 treesize of output 9 [2024-11-13 06:22:37,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:22:37,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:37,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:22:37,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:37,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:22:37,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:37,244 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-13 06:22:37,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:37,261 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-13 06:22:37,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:37,277 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-13 06:22:37,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:37,292 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-13 06:22:37,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:37,429 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-13 06:22:37,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:37,446 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-13 06:22:37,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:37,462 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-13 06:22:37,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:22:37,479 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-13 06:22:37,551 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:22:37,551 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-13 06:22:37,614 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-13 06:22:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:22:37,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:37,715 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-11-13 06:22:37,805 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-11-13 06:22:45,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:45,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2024-11-13 06:22:45,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:45,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 130 [2024-11-13 06:22:45,643 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 17 treesize of output 13 [2024-11-13 06:22:45,646 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 28 treesize of output 20 [2024-11-13 06:22:45,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:45,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2024-11-13 06:22:45,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:22:45,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:45,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 28 [2024-11-13 06:22:45,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:45,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2024-11-13 06:22:45,695 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:22:45,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:45,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:22:45,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:45,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2024-11-13 06:22:45,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:22:45,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:22:45,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:22:52,118 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 10 treesize of output 8 [2024-11-13 06:22:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:22:52,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059389740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:52,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:52,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 40 [2024-11-13 06:22:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266899592] [2024-11-13 06:22:52,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:52,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 06:22:52,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:52,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 06:22:52,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1265, Unknown=53, NotChecked=150, Total=1640 [2024-11-13 06:22:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:52,168 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:52,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 9.9) internal successors, (396), 41 states have internal predecessors, (396), 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-13 06:22:52,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:52,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:52,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:52,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:52,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:52,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:52,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:52,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:52,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:22:57,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-13 06:22:57,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:57,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:57,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:57,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1951577595, now seen corresponding path program 1 times [2024-11-13 06:22:57,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:57,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619619297] [2024-11-13 06:22:57,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 06:22:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:57,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619619297] [2024-11-13 06:22:57,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619619297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:22:57,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:22:57,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 06:22:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649283274] [2024-11-13 06:22:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:22:57,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 06:22:57,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 06:22:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 06:22:57,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:57,621 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:57,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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-13 06:22:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:22:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:22:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:58,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 06:22:58,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:22:58,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:22:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -320943397, now seen corresponding path program 1 times [2024-11-13 06:22:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:22:58,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559899411] [2024-11-13 06:22:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:58,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:22:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:22:58,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559899411] [2024-11-13 06:22:58,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559899411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:22:58,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018654747] [2024-11-13 06:22:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:22:58,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:22:58,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:22:58,910 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:22:58,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 06:22:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:22:59,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 06:22:59,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:22:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:59,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:22:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:22:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018654747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:22:59,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:22:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-13 06:22:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580807431] [2024-11-13 06:22:59,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:22:59,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 06:22:59,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:22:59,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 06:22:59,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-13 06:22:59,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:22:59,492 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:22:59,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 26.357142857142858) internal successors, (369), 14 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:22:59,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:22:59,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:00,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-13 06:23:00,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-13 06:23:00,351 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:23:00,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1413959416, now seen corresponding path program 2 times [2024-11-13 06:23:00,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:00,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065384384] [2024-11-13 06:23:00,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:00,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:23:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065384384] [2024-11-13 06:23:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065384384] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:23:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470066071] [2024-11-13 06:23:01,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:23:01,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:01,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:23:01,364 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:23:01,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 06:23:02,070 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:23:02,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:23:02,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-13 06:23:02,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:23:02,130 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-13 06:23:02,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:23:02,149 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-13 06:23:02,356 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-13 06:23:02,386 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-13 06:23:02,420 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-13 06:23:02,512 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 30 treesize of output 21 [2024-11-13 06:23:02,520 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 30 treesize of output 21 [2024-11-13 06:23:02,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 30 treesize of output 21 [2024-11-13 06:23:02,542 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 30 treesize of output 21 [2024-11-13 06:23:02,625 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 30 treesize of output 21 [2024-11-13 06:23:02,636 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 30 treesize of output 21 [2024-11-13 06:23:02,647 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 30 treesize of output 21 [2024-11-13 06:23:02,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 30 treesize of output 21 [2024-11-13 06:23:02,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:02,884 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 37 treesize of output 31 [2024-11-13 06:23:02,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:02,894 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 33 treesize of output 38 [2024-11-13 06:23:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:23:02,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:23:03,469 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6543 (Array Int Int)) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_6544 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_6543))) (store .cse0 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_6544))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int)) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_6544 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_6543))) (store .cse1 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse1 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_6544))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int)) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_6544 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_6543))) (store .cse2 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse2 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_6544))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-11-13 06:23:03,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse4 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_6543 (Array Int Int)) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_6544 Int)) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_6543))) (store .cse0 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_6544))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int)) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_6544 Int)) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_6543))) (store .cse2 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse2 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_6544))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int)) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_6544 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_6543))) (store .cse3 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse3 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_6544))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse4)))))) is different from false [2024-11-13 06:23:03,732 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse4 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_6543 (Array Int Int)) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_6544 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_6543))) (store .cse0 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_6544))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse2))) (forall ((v_ArrVal_6543 (Array Int Int)) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_6544 Int)) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_6543))) (store .cse3 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse3 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_6544))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse4) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6543 (Array Int Int)) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_6544 Int)) (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_6543))) (store .cse5 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse5 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_6544))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:23:03,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:03,743 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 3 case distinctions, treesize of input 63 treesize of output 54 [2024-11-13 06:23:03,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:03,751 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 330 treesize of output 292 [2024-11-13 06:23:03,758 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 173 treesize of output 157 [2024-11-13 06:23:03,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:03,808 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 62 treesize of output 34 [2024-11-13 06:23:03,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:03,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 54 [2024-11-13 06:23:03,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:03,828 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:23:03,829 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 126 treesize of output 108 [2024-11-13 06:23:03,835 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 40 treesize of output 36 [2024-11-13 06:23:03,841 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:03,847 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-13 06:23:03,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 70 [2024-11-13 06:23:03,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:03,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 54 [2024-11-13 06:23:03,871 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:03,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:23:03,878 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 126 treesize of output 108 [2024-11-13 06:23:03,884 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 40 treesize of output 36 [2024-11-13 06:23:03,899 INFO L349 Elim1Store]: treesize reduction 27, result has 12.9 percent of original size [2024-11-13 06:23:03,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 70 [2024-11-13 06:23:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-11-13 06:23:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470066071] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:23:04,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:23:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 46 [2024-11-13 06:23:04,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179832939] [2024-11-13 06:23:04,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:23:04,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-13 06:23:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:23:04,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-13 06:23:04,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1750, Unknown=3, NotChecked=258, Total=2162 [2024-11-13 06:23:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:04,365 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:23:04,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 8.73913043478261) internal successors, (402), 47 states have internal predecessors, (402), 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-13 06:23:04,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:04,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:04,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:04,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:04,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:04,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:04,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:04,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:04,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:04,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:04,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:04,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:10,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:10,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-13 06:23:10,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-13 06:23:10,749 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:23:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1586766406, now seen corresponding path program 3 times [2024-11-13 06:23:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:10,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951372695] [2024-11-13 06:23:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:23:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951372695] [2024-11-13 06:23:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951372695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:23:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907844735] [2024-11-13 06:23:11,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 06:23:11,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:23:11,646 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:23:11,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 06:23:16,279 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 06:23:16,279 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:23:16,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-13 06:23:16,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:23:16,445 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-13 06:23:16,834 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-13 06:23:16,872 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-13 06:23:17,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:17,039 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 23 treesize of output 16 [2024-11-13 06:23:17,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:17,050 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 23 treesize of output 16 [2024-11-13 06:23:17,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:17,059 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 23 treesize of output 16 [2024-11-13 06:23:17,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:17,068 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 23 treesize of output 16 [2024-11-13 06:23:17,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:17,150 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 23 treesize of output 16 [2024-11-13 06:23:17,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:17,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 23 treesize of output 16 [2024-11-13 06:23:17,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:17,174 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 23 treesize of output 16 [2024-11-13 06:23:17,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:17,185 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 23 treesize of output 16 [2024-11-13 06:23:17,239 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:23:17,239 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-13 06:23:17,390 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 23 treesize of output 16 [2024-11-13 06:23:17,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:17,424 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 06:23:17,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:17,463 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 33 treesize of output 38 [2024-11-13 06:23:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 06:23:17,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:23:17,520 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6925 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_6925) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6925 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_6925) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-11-13 06:23:17,593 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6925 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_6925) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_6925 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_6925) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))) is different from false [2024-11-13 06:23:18,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:18,046 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 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-13 06:23:18,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:18,051 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 100 treesize of output 58 [2024-11-13 06:23:18,053 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 28 treesize of output 24 [2024-11-13 06:23:18,055 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 42 treesize of output 34 [2024-11-13 06:23:18,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:18,072 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 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-13 06:23:18,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:18,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:18,076 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 38 treesize of output 20 [2024-11-13 06:23:18,642 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 10 treesize of output 8 [2024-11-13 06:23:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:23:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907844735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:23:18,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:23:18,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 16] total 51 [2024-11-13 06:23:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360669782] [2024-11-13 06:23:18,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:23:18,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-13 06:23:18,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:23:18,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-13 06:23:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=2204, Unknown=46, NotChecked=194, Total=2652 [2024-11-13 06:23:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:18,690 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:23:18,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 8.411764705882353) internal successors, (429), 52 states have internal predecessors, (429), 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-13 06:23:18,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:18,691 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:23:24,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-13 06:23:24,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-13 06:23:24,946 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:23:24,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1770194952, now seen corresponding path program 4 times [2024-11-13 06:23:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:24,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106132161] [2024-11-13 06:23:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:23:25,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:25,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106132161] [2024-11-13 06:23:25,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106132161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:23:25,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917092199] [2024-11-13 06:23:25,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 06:23:25,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:25,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:23:25,891 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:23:25,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 06:23:32,126 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 06:23:32,127 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:23:32,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-13 06:23:32,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:23:32,234 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-13 06:23:32,325 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-13 06:23:32,325 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-13 06:23:32,959 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-13 06:23:33,103 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-13 06:23:33,116 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-13 06:23:33,125 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-13 06:23:33,135 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-13 06:23:33,209 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-13 06:23:33,215 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-13 06:23:33,229 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-13 06:23:33,236 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-13 06:23:33,307 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-13 06:23:33,307 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 16 treesize of output 18 [2024-11-13 06:23:33,427 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-13 06:23:33,454 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-13 06:23:33,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:33,488 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 06:23:33,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:33,527 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 33 treesize of output 38 [2024-11-13 06:23:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 06:23:33,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:23:33,585 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7306 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7306) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) is different from false [2024-11-13 06:23:33,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7306 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_7306) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) is different from false [2024-11-13 06:23:33,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:33,859 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 25 treesize of output 26 [2024-11-13 06:23:33,861 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 68 treesize of output 50 [2024-11-13 06:23:33,864 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 28 treesize of output 24 [2024-11-13 06:23:33,866 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 42 treesize of output 34 [2024-11-13 06:23:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:23:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917092199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:23:34,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:23:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 16] total 52 [2024-11-13 06:23:34,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634714668] [2024-11-13 06:23:34,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:23:34,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-13 06:23:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:23:34,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-13 06:23:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2282, Unknown=27, NotChecked=198, Total=2756 [2024-11-13 06:23:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:34,337 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:23:34,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 8.923076923076923) internal successors, (464), 53 states have internal predecessors, (464), 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-13 06:23:34,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:34,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:34,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:34,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:34,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:34,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:23:34,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:40,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:23:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:23:40,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-13 06:23:41,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:41,163 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:23:41,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:41,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1492422552, now seen corresponding path program 1 times [2024-11-13 06:23:41,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:41,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083902107] [2024-11-13 06:23:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 06:23:41,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083902107] [2024-11-13 06:23:41,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083902107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 06:23:41,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 06:23:41,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 06:23:41,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537812653] [2024-11-13 06:23:41,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 06:23:41,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 06:23:41,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:23:41,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 06:23:41,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-13 06:23:41,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:41,756 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:23:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 14.285714285714286) internal successors, (200), 15 states have internal predecessors, (200), 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-13 06:23:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:41,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:23:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:23:41,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:23:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:23:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:23:44,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-13 06:23:44,275 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:23:44,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1706690860, now seen corresponding path program 1 times [2024-11-13 06:23:44,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:44,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419142556] [2024-11-13 06:23:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 06:23:45,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419142556] [2024-11-13 06:23:45,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419142556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:23:45,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434297140] [2024-11-13 06:23:45,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:45,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:45,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:23:45,096 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:23:45,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 06:23:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:45,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 06:23:45,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:23:45,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-13 06:23:45,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-13 06:23:45,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:45,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-13 06:23:46,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:46,129 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 44 treesize of output 35 [2024-11-13 06:23:46,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:46,168 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 44 treesize of output 35 [2024-11-13 06:23:46,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:46,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 44 treesize of output 35 [2024-11-13 06:23:46,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:46,188 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 44 treesize of output 35 [2024-11-13 06:23:46,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:46,198 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 44 treesize of output 35 [2024-11-13 06:23:46,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:46,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-13 06:23:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 06:23:46,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:23:46,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet58#1|)) (forall ((v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet58#1|)) (forall ((v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet58#1|)))) is different from false [2024-11-13 06:23:49,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int) (v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (or (= (select (select (store (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_50| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet58#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_50|)))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int) (v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (or (= (select (select (store (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_50| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet58#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_50|)))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int) (v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (or (= (select (select (store (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_50| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet58#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_50|)))))) is different from false [2024-11-13 06:23:49,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 2 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet58#1|)))) (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int) (v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (or (= (select (select (store (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_50| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet58#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_50|)))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int) (v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (or (= (select (select (store (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_50| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet58#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_50|)))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int) (v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (or (= (select (select (store (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_50| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet58#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_50|)))))))) is different from false [2024-11-13 06:23:49,158 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset| 1)) (.cse3 (+ .cse1 2 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet58#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet58#1|)))) (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int) (v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (or (= (select (select (store (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_50| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet58#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_50|)))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int) (v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (or (= (select (select (store (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_50| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet58#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_50|)))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int) (v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (or (= (select (select (store (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_50| v_ArrVal_7867) |c_t1_funThread1of2ForFork2_insert_~node#1.base| v_ArrVal_7871) |c_ULTIMATE.start_main_~#t1_ids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet58#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_50|)))))))) is different from false [2024-11-13 06:23:49,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:49,171 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 3 case distinctions, treesize of input 46 treesize of output 57 [2024-11-13 06:23:49,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:49,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 269 treesize of output 144 [2024-11-13 06:23:49,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2024-11-13 06:23:49,332 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 20 treesize of output 13 [2024-11-13 06:23:49,343 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:23:49,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 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 1 [2024-11-13 06:23:49,348 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-13 06:23:49,348 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 3 case distinctions, treesize of input 46 treesize of output 1 [2024-11-13 06:23:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2024-11-13 06:23:49,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434297140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:23:49,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:23:49,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2024-11-13 06:23:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471761713] [2024-11-13 06:23:49,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:23:49,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-13 06:23:49,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:23:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 06:23:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1158, Unknown=77, NotChecked=300, Total=1722 [2024-11-13 06:23:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:49,651 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:23:49,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 9.714285714285714) internal successors, (408), 42 states have internal predecessors, (408), 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-13 06:23:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:49,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:49,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:49,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:49,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:49,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:49,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:49,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:23:49,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:23:49,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:23:49,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:53,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:23:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:23:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:23:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:23:53,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-13 06:23:54,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2024-11-13 06:23:54,014 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1_funErr6ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:23:54,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:23:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1367699206, now seen corresponding path program 2 times [2024-11-13 06:23:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:23:54,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858730642] [2024-11-13 06:23:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:23:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:23:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:23:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 06:23:54,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:23:54,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858730642] [2024-11-13 06:23:54,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858730642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:23:54,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256817574] [2024-11-13 06:23:54,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:23:54,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:23:54,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:23:54,825 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:23:54,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 06:23:55,868 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:23:55,869 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:23:55,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 06:23:55,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:23:56,491 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-13 06:23:56,531 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-13 06:23:56,579 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-13 06:23:56,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-13 06:23:56,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:23:56,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-13 06:23:56,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2024-11-13 06:23:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 06:23:56,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:23:56,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1))) (and (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse2 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse2 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse4 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse4 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) is different from false [2024-11-13 06:23:56,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse2 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse4 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse4) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:23:56,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse4 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse2 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse4 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse3 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse4) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse5 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse6) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:23:56,983 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse3 (+ 6 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) (.cse5 (+ 7 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))) (let ((.cse1 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse2 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse8 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|) .cse5 |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)))) (and (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse3) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse4 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse4 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse5) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse6 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|)) (forall ((v_ArrVal_8249 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8249))) (store .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse7 |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse1 |t1_funThread2of2ForFork2_init_#t~nondet3#1|))) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) .cse8) |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1|))))) is different from false [2024-11-13 06:23:56,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:56,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 66 [2024-11-13 06:23:57,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:57,006 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 250 treesize of output 222 [2024-11-13 06:23:57,011 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 177 treesize of output 161 [2024-11-13 06:23:57,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:57,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 42 [2024-11-13 06:23:57,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:57,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 66 [2024-11-13 06:23:57,100 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:57,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:23:57,107 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 146 treesize of output 124 [2024-11-13 06:23:57,113 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 40 treesize of output 36 [2024-11-13 06:23:57,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2024-11-13 06:23:57,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:57,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 66 [2024-11-13 06:23:57,139 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:57,146 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:23:57,146 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 146 treesize of output 124 [2024-11-13 06:23:57,152 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 40 treesize of output 36 [2024-11-13 06:23:57,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2024-11-13 06:23:57,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:23:57,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 66 [2024-11-13 06:23:57,179 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:23:57,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:23:57,186 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 146 treesize of output 124 [2024-11-13 06:23:57,192 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 40 treesize of output 36 [2024-11-13 06:23:57,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2024-11-13 06:23:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2024-11-13 06:23:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256817574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:23:58,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:23:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 48 [2024-11-13 06:23:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366811916] [2024-11-13 06:23:58,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:23:58,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-13 06:23:58,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:23:58,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-13 06:23:58,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1829, Unknown=4, NotChecked=356, Total=2352 [2024-11-13 06:23:58,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:23:58,671 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:23:58,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 8.770833333333334) internal successors, (421), 49 states have internal predecessors, (421), 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-13 06:23:58,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:58,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:58,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:58,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:23:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:24:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:24:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:24:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:03,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-13 06:24:03,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:03,983 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:24:03,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:24:03,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1220935337, now seen corresponding path program 1 times [2024-11-13 06:24:03,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:24:03,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376795185] [2024-11-13 06:24:03,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:03,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:24:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:24:04,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:24:04,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376795185] [2024-11-13 06:24:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376795185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:24:04,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248530622] [2024-11-13 06:24:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:04,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:04,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:24:04,454 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:24:04,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 06:24:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:04,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 06:24:04,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:24:05,066 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 13 treesize of output 9 [2024-11-13 06:24:05,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:24:05,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:05,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:24:05,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:05,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:24:05,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:05,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 45 treesize of output 34 [2024-11-13 06:24:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 06:24:05,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:24:05,268 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-11-13 06:24:05,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-11-13 06:24:05,336 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2)))))) is different from false [2024-11-13 06:24:05,352 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_8533 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8533) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3)))))) is different from false [2024-11-13 06:24:05,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:05,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-11-13 06:24:05,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:05,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 28 [2024-11-13 06:24:05,371 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:24:05,371 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:24:05,374 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:24:05,375 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:24:05,378 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:24:05,379 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 4 case distinctions, treesize of input 37 treesize of output 1 [2024-11-13 06:24:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 06:24:05,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248530622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:24:05,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:24:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-11-13 06:24:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502070612] [2024-11-13 06:24:05,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:24:05,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-13 06:24:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:24:05,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-13 06:24:05,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=710, Unknown=4, NotChecked=228, Total=1056 [2024-11-13 06:24:05,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:05,581 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:24:05,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 11.71875) internal successors, (375), 33 states have internal predecessors, (375), 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-13 06:24:05,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:05,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:05,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:05,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:05,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:05,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:05,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:24:05,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:05,582 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:24:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:24:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:24:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:24:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:24:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:24:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:05,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:24:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:24:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:24:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:24:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:24:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:24:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:24:09,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-13 06:24:09,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-13 06:24:09,198 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:24:09,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:24:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1493657525, now seen corresponding path program 1 times [2024-11-13 06:24:09,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:24:09,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944206812] [2024-11-13 06:24:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:24:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:24:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:24:10,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944206812] [2024-11-13 06:24:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944206812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:24:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633434484] [2024-11-13 06:24:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:10,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:10,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:24:10,662 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:24:10,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-13 06:24:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:11,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 06:24:11,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:24:11,560 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 13 treesize of output 9 [2024-11-13 06:24:11,591 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 23 treesize of output 22 [2024-11-13 06:24:11,627 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 32 treesize of output 34 [2024-11-13 06:24:11,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:24:11,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:11,813 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-13 06:24:11,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:11,829 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-13 06:24:11,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:11,843 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-13 06:24:11,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:11,857 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-13 06:24:11,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:11,984 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-13 06:24:12,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:12,002 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-13 06:24:12,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:12,015 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-13 06:24:12,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:12,036 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-13 06:24:12,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:12,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:12,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:12,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:12,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:12,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 49 [2024-11-13 06:24:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:24:12,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:24:14,540 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int)) (or (forall ((v_ArrVal_8884 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_56|))))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int)) (or (forall ((v_ArrVal_8884 Int)) (= (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_56|))))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int)) (or (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int)) (or (forall ((v_ArrVal_8884 Int)) (= (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_56|))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int)) (or (forall ((v_ArrVal_8884 Int)) (= (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)))))) is different from false [2024-11-13 06:24:16,136 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|)))) is different from false [2024-11-13 06:24:16,925 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse5 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse5)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|)))))) is different from false [2024-11-13 06:24:16,970 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|)))))) is different from false [2024-11-13 06:24:17,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse7 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse4 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse7 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse4 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse4)) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse5 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|))) (forall ((v_ArrVal_8883 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_56| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_56| Int) (v_ArrVal_8884 Int)) (or (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|)) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_56|) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_8883))) (store .cse6 |v_t1_funThread2of2ForFork2_init_~p#1.base_56| (store (select .cse6 |v_t1_funThread2of2ForFork2_init_~p#1.base_56|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_56| v_ArrVal_8884))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse7))))))) is different from false [2024-11-13 06:24:17,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2024-11-13 06:24:17,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,051 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 210 treesize of output 190 [2024-11-13 06:24:17,057 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 173 treesize of output 157 [2024-11-13 06:24:17,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 39 [2024-11-13 06:24:17,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2024-11-13 06:24:17,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:17,167 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:24:17,167 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 142 treesize of output 120 [2024-11-13 06:24:17,173 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 40 treesize of output 36 [2024-11-13 06:24:17,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2024-11-13 06:24:17,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:17,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2024-11-13 06:24:17,205 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:17,212 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:24:17,212 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 142 treesize of output 120 [2024-11-13 06:24:17,218 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 40 treesize of output 36 [2024-11-13 06:24:17,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2024-11-13 06:24:17,240 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 06:24:17,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 1 [2024-11-13 06:24:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-11-13 06:24:17,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633434484] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:24:17,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:24:17,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2024-11-13 06:24:17,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791792847] [2024-11-13 06:24:17,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:24:17,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-13 06:24:17,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:24:17,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-13 06:24:17,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1977, Unknown=5, NotChecked=470, Total=2652 [2024-11-13 06:24:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:17,756 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:24:17,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 9.843137254901961) internal successors, (502), 52 states have internal predecessors, (502), 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-13 06:24:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:17,756 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:24:17,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:24:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:24:23,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-13 06:24:23,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2024-11-13 06:24:23,261 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:24:23,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:24:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1032629136, now seen corresponding path program 1 times [2024-11-13 06:24:23,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:24:23,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512158044] [2024-11-13 06:24:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:24:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:24:24,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:24:24,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512158044] [2024-11-13 06:24:24,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512158044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:24:24,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096915752] [2024-11-13 06:24:24,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:24,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:24,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:24:24,992 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:24:25,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-13 06:24:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:25,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 06:24:25,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:24:25,665 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-13 06:24:25,779 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:24:25,780 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 19 treesize of output 16 [2024-11-13 06:24:25,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:25,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-13 06:24:25,916 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:24:25,917 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 19 treesize of output 16 [2024-11-13 06:24:26,121 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 13 treesize of output 9 [2024-11-13 06:24:26,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-13 06:24:26,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:26,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:24:26,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:26,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-11-13 06:24:26,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:26,364 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-13 06:24:26,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:26,377 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-13 06:24:26,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:26,394 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-13 06:24:26,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:26,406 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-13 06:24:26,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:26,521 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-13 06:24:26,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:26,538 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-13 06:24:26,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:26,554 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-13 06:24:26,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:26,571 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-13 06:24:26,640 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:24:26,640 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-13 06:24:26,802 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-13 06:24:26,812 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-13 06:24:26,821 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-13 06:24:26,832 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-13 06:24:26,871 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-13 06:24:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:24:26,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:24:26,891 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-11-13 06:24:26,957 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-11-13 06:24:26,971 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-11-13 06:24:26,985 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_9272 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_9272) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-11-13 06:24:28,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:28,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2024-11-13 06:24:28,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:28,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 66 [2024-11-13 06:24:28,149 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 28 treesize of output 24 [2024-11-13 06:24:28,155 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 42 treesize of output 34 [2024-11-13 06:24:28,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:28,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2024-11-13 06:24:28,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:28,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:28,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:24:28,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:28,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2024-11-13 06:24:28,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:28,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:28,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-11-13 06:24:28,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:28,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2024-11-13 06:24:28,210 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:28,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:28,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 28 [2024-11-13 06:24:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:24:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096915752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:24:29,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:24:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 50 [2024-11-13 06:24:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454618441] [2024-11-13 06:24:29,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:24:29,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-13 06:24:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:24:29,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-13 06:24:29,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1971, Unknown=21, NotChecked=372, Total=2550 [2024-11-13 06:24:29,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:29,710 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:24:29,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 10.26) internal successors, (513), 51 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 06:24:29,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:29,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:29,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:29,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:29,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:29,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:29,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:24:29,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:24:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:24:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:24:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:24:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:24:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:24:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:24:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:24:35,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-13 06:24:35,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:35,510 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:24:35,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:24:35,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1404199619, now seen corresponding path program 2 times [2024-11-13 06:24:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:24:35,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657724097] [2024-11-13 06:24:35,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:24:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:24:36,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:24:36,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657724097] [2024-11-13 06:24:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657724097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:24:36,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283363387] [2024-11-13 06:24:36,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:24:36,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:36,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:24:36,728 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:24:36,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-13 06:24:37,867 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:24:37,867 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:24:37,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 06:24:37,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:24:38,392 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 13 treesize of output 9 [2024-11-13 06:24:38,422 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 23 treesize of output 22 [2024-11-13 06:24:38,464 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 32 treesize of output 34 [2024-11-13 06:24:38,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:38,583 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 36 treesize of output 27 [2024-11-13 06:24:38,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:38,597 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 36 treesize of output 27 [2024-11-13 06:24:38,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:38,609 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 36 treesize of output 27 [2024-11-13 06:24:38,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:38,625 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 36 treesize of output 27 [2024-11-13 06:24:38,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:38,738 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 36 treesize of output 27 [2024-11-13 06:24:38,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:38,750 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 36 treesize of output 27 [2024-11-13 06:24:38,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:38,765 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 36 treesize of output 27 [2024-11-13 06:24:38,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:38,782 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 36 treesize of output 27 [2024-11-13 06:24:39,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:39,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:39,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:39,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:39,019 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 43 treesize of output 37 [2024-11-13 06:24:39,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:39,056 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 41 treesize of output 46 [2024-11-13 06:24:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:24:39,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:24:41,277 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int)) (or (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) (forall ((v_ArrVal_9622 Int)) (= (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int)) (or (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) (forall ((v_ArrVal_9622 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int)) (or (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int)) (or (forall ((v_ArrVal_9622 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select |c_#race| |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622)) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_62|))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|)))) is different from false [2024-11-13 06:24:42,536 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_9621 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9622 Int)) (or (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9621))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (forall ((v_ArrVal_9621 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9622 Int)) (or (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9621))) (store .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select .cse1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (forall ((v_ArrVal_9621 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9622 Int)) (or (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9621))) (store .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-11-13 06:24:43,099 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_9621 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9622 Int)) (or (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9621))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2)))) (forall ((v_ArrVal_9621 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9622 Int)) (or (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9621))) (store .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select .cse3 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|)))) (forall ((v_ArrVal_9621 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9622 Int)) (or (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|)) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9621))) (store .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))))) is different from false [2024-11-13 06:24:43,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse5 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse5 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_9621 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9622 Int)) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9621))) (store .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select .cse0 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|)))) (forall ((v_ArrVal_9621 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9622 Int)) (or (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9621))) (store .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select .cse2 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3)))) (forall ((v_ArrVal_9621 (Array Int Int)) (|v_t1_funThread2of2ForFork2_init_~p#1.base_62| Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_62| Int) (v_ArrVal_9622 Int)) (or (< 0 |v_t1_funThread2of2ForFork2_init_~p#1.offset_62|) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_9621))) (store .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_62| (store (select .cse4 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|) |v_t1_funThread2of2ForFork2_init_~p#1.offset_62| v_ArrVal_9622))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse5) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_#StackHeapBarrier| (+ 1 |v_t1_funThread2of2ForFork2_init_~p#1.base_62|))))))) is different from false [2024-11-13 06:24:43,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:43,155 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 3 case distinctions, treesize of input 63 treesize of output 54 [2024-11-13 06:24:43,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:43,163 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 226 treesize of output 202 [2024-11-13 06:24:43,170 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 173 treesize of output 157 [2024-11-13 06:24:43,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:43,233 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 67 treesize of output 39 [2024-11-13 06:24:43,243 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-11-13 06:24:43,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 1 [2024-11-13 06:24:43,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:24:43,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 54 [2024-11-13 06:24:43,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:24:43,263 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:24:43,263 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 126 treesize of output 108 [2024-11-13 06:24:43,268 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 40 treesize of output 36 [2024-11-13 06:24:43,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 66 [2024-11-13 06:24:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-11-13 06:24:43,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283363387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:24:43,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:24:43,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2024-11-13 06:24:43,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848002245] [2024-11-13 06:24:43,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:24:43,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-13 06:24:43,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:24:43,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-13 06:24:43,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2067, Unknown=4, NotChecked=380, Total=2652 [2024-11-13 06:24:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:43,814 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:24:43,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 9.843137254901961) internal successors, (502), 52 states have internal predecessors, (502), 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-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:24:43,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:24:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:24:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:24:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:24:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:24:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:24:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:24:43,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:24:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:24:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:24:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:24:49,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-13 06:24:49,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2024-11-13 06:24:49,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:24:49,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:24:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash 583710878, now seen corresponding path program 2 times [2024-11-13 06:24:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:24:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199039228] [2024-11-13 06:24:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:24:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:24:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:24:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:24:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:24:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199039228] [2024-11-13 06:24:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199039228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:24:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97112270] [2024-11-13 06:24:51,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 06:24:51,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:24:51,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:24:51,382 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:24:51,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-13 06:24:52,494 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 06:24:52,494 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:24:52,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-13 06:24:52,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:24:52,517 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-13 06:24:52,712 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:24:52,712 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 19 treesize of output 16 [2024-11-13 06:24:52,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:52,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-13 06:24:52,913 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:24:52,913 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 19 treesize of output 16 [2024-11-13 06:24:53,193 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 13 treesize of output 9 [2024-11-13 06:24:53,234 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 23 treesize of output 22 [2024-11-13 06:24:53,278 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 32 treesize of output 34 [2024-11-13 06:24:53,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:53,421 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 36 treesize of output 27 [2024-11-13 06:24:53,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:53,437 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 36 treesize of output 27 [2024-11-13 06:24:53,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:53,457 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 36 treesize of output 27 [2024-11-13 06:24:53,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:53,471 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 36 treesize of output 27 [2024-11-13 06:24:53,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:53,584 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 36 treesize of output 27 [2024-11-13 06:24:53,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:53,594 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 36 treesize of output 27 [2024-11-13 06:24:53,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:53,610 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 36 treesize of output 27 [2024-11-13 06:24:53,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:24:53,622 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 36 treesize of output 27 [2024-11-13 06:24:53,683 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:24:53,684 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-13 06:24:53,874 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 36 treesize of output 27 [2024-11-13 06:24:53,888 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 41 treesize of output 46 [2024-11-13 06:24:53,944 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 50 treesize of output 58 [2024-11-13 06:24:54,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2024-11-13 06:24:54,083 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 71 treesize of output 70 [2024-11-13 06:24:54,152 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 71 treesize of output 70 [2024-11-13 06:25:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:25:02,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:25:03,692 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse3 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 2)) (.cse4 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 3)) (.cse5 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 4)) (.cse6 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10007))) (let ((.cse0 (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_10012) .cse5 v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse8 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10007))) (let ((.cse7 (store (select .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_10012) .cse5 v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse10 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10007))) (let ((.cse9 (store (select .cse10 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse9) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse10 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse9) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_10012) .cse5 v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse12 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10007))) (let ((.cse11 (store (select .cse12 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse11) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse12 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse11) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_10012) .cse5 v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-11-13 06:25:03,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int)) (or (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10007))) (let ((.cse0 (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int)) (or (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse4 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10007))) (let ((.cse3 (store (select .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int)) (or (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10007))) (let ((.cse5 (store (select .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int)) (or (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse8 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10007))) (let ((.cse7 (store (select .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|))))) is different from false [2024-11-13 06:25:03,873 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (or (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10007))) (let ((.cse0 (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (or (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse4 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10007))) (let ((.cse3 (store (select .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))))) (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (or (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) (= (select (select (let ((.cse6 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10007))) (let ((.cse5 (store (select .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (or (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) (= (select (select (let ((.cse8 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10007))) (let ((.cse7 (store (select .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-11-13 06:25:03,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (or (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10007))) (let ((.cse0 (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|))) (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10007))) (let ((.cse3 (store (select .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse4 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse3) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|))) (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (or (= (select (select (let ((.cse6 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10007))) (let ((.cse5 (store (select .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse6 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse5) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|))) (forall ((v_ArrVal_10007 (Array Int Int)) (v_ArrVal_10012 Int) (v_ArrVal_10015 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_65| Int) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int)) (or (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse8 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10007))) (let ((.cse7 (store (select .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse8 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse7) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_65|) v_ArrVal_10012) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_65| 4) v_ArrVal_10015)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))))))) is different from false [2024-11-13 06:25:07,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:07,622 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 3 case distinctions, treesize of input 106 treesize of output 116 [2024-11-13 06:25:07,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:07,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 77 treesize of output 41 [2024-11-13 06:25:07,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:07,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 132 [2024-11-13 06:25:07,672 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 318 treesize of output 286 [2024-11-13 06:25:07,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 104 [2024-11-13 06:25:07,684 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 1090 treesize of output 1074 [2024-11-13 06:25:07,699 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 17 treesize of output 13 [2024-11-13 06:25:07,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:07,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:07,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2024-11-13 06:25:07,748 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:07,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 28 [2024-11-13 06:25:07,754 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:07,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:25:07,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 46 [2024-11-13 06:25:07,764 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:25:07,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 28 [2024-11-13 06:25:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:25:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97112270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:25:09,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:25:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 23] total 60 [2024-11-13 06:25:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683393641] [2024-11-13 06:25:09,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:25:09,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-13 06:25:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:25:09,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-13 06:25:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2964, Unknown=18, NotChecked=452, Total=3660 [2024-11-13 06:25:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:25:09,493 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:25:09,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 8.766666666666667) internal successors, (526), 61 states have internal predecessors, (526), 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-13 06:25:09,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:09,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:09,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:25:09,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:09,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:09,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:09,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:25:09,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:25:09,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:25:09,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:25:14,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:18,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:20,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:28,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:31,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:33,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:35,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:37,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:39,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:41,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:43,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:45,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:47,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:49,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:51,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:53,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:55,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:57,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:25:59,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:01,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:03,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:07,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:11,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:15,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:20,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:22,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:26,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:28,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:30,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:34,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:38,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:40,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:26:59,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:01,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:03,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:05,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:07,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:09,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:11,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:13,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:15,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:17,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:19,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:21,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:23,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:25,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:27,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:29,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:31,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:33,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:35,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:37,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:39,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:42,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:44,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:48,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:52,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:54,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:56,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:27:58,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:00,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:02,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:04,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:06,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:08,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:10,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:12,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:14,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:16,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:18,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:20,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:22,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:24,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:26,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:28,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:30,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:32,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:34,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:36,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:38,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:40,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:42,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:44,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:46,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:48,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:50,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:52,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:54,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:56,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:28:59,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:29:03,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:29:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:29:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:29:03,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:29:03,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-11-13 06:29:03,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2024-11-13 06:29:03,223 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:29:03,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:29:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash 990310581, now seen corresponding path program 3 times [2024-11-13 06:29:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:29:03,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805641859] [2024-11-13 06:29:03,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:29:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:29:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:29:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:29:04,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:29:04,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805641859] [2024-11-13 06:29:04,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805641859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:29:04,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089281744] [2024-11-13 06:29:04,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 06:29:04,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:29:04,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:29:04,324 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:29:04,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-13 06:29:06,600 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 06:29:06,600 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:29:06,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-13 06:29:06,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:29:07,203 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-13 06:29:07,239 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-13 06:29:07,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:07,400 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 23 treesize of output 16 [2024-11-13 06:29:07,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:07,410 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 23 treesize of output 16 [2024-11-13 06:29:07,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:07,422 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 23 treesize of output 16 [2024-11-13 06:29:07,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:07,434 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 23 treesize of output 16 [2024-11-13 06:29:07,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:07,511 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 23 treesize of output 16 [2024-11-13 06:29:07,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:07,520 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 23 treesize of output 16 [2024-11-13 06:29:07,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:07,533 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 23 treesize of output 16 [2024-11-13 06:29:07,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:07,541 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 23 treesize of output 16 [2024-11-13 06:29:07,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:07,630 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 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-13 06:29:07,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:07,638 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 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-13 06:29:07,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:07,647 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 33 treesize of output 38 [2024-11-13 06:29:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 06:29:07,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:29:08,244 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10364 Int) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_10362 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_10362))) (store .cse0 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_10364))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_10364 Int) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_10362 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_10362))) (store .cse1 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse1 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_10364))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-11-13 06:29:08,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse1 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_10364 Int) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_10362 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_10362))) (store .cse0 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse0 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_10364))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10364 Int) (|t1_funThread2of2ForFork2_init_~p#1.base| Int) (v_ArrVal_10362 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_10362))) (store .cse2 |t1_funThread2of2ForFork2_init_~p#1.base| (store (select .cse2 |t1_funThread2of2ForFork2_init_~p#1.base|) 0 v_ArrVal_10364))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-11-13 06:29:08,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:08,401 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 2 case distinctions, treesize of input 53 treesize of output 44 [2024-11-13 06:29:08,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:08,407 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 310 treesize of output 280 [2024-11-13 06:29:08,413 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 174 treesize of output 158 [2024-11-13 06:29:08,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:08,507 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 50 treesize of output 30 [2024-11-13 06:29:08,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:08,516 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 53 treesize of output 44 [2024-11-13 06:29:08,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:29:08,522 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:29:08,523 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 110 treesize of output 96 [2024-11-13 06:29:08,527 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 40 treesize of output 36 [2024-11-13 06:29:08,536 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-11-13 06:29:08,537 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 88 treesize of output 66 [2024-11-13 06:29:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-11-13 06:29:09,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089281744] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:29:09,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:29:09,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 18] total 48 [2024-11-13 06:29:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135447231] [2024-11-13 06:29:09,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:29:09,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-13 06:29:09,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:29:09,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-13 06:29:09,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1974, Unknown=2, NotChecked=182, Total=2352 [2024-11-13 06:29:09,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:29:09,184 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:29:09,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 9.354166666666666) internal successors, (449), 49 states have internal predecessors, (449), 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-13 06:29:09,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:09,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:09,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:29:09,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:09,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:09,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:09,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:29:09,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:29:09,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:29:09,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:29:17,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:29:19,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:29:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:29:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:29:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:29:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:29:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:29:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-13 06:29:19,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-13 06:29:19,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-13 06:29:19,659 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:29:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:29:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1341338768, now seen corresponding path program 3 times [2024-11-13 06:29:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:29:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663721890] [2024-11-13 06:29:19,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:29:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:29:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:29:21,341 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:29:21,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:29:21,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663721890] [2024-11-13 06:29:21,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663721890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:29:21,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942026724] [2024-11-13 06:29:21,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 06:29:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:29:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:29:21,344 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:29:21,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-13 06:29:26,150 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-13 06:29:26,150 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:29:26,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-13 06:29:26,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:29:26,176 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-13 06:29:26,352 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:29:26,352 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 19 treesize of output 16 [2024-11-13 06:29:26,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:26,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-13 06:29:26,561 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 06:29:26,562 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-13 06:29:26,875 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 13 treesize of output 9 [2024-11-13 06:29:26,915 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 23 treesize of output 22 [2024-11-13 06:29:27,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:27,025 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-13 06:29:27,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:27,037 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-13 06:29:27,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:27,049 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-13 06:29:27,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:27,062 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-13 06:29:27,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:27,152 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-13 06:29:27,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:27,169 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-13 06:29:27,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:27,178 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-13 06:29:27,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:29:27,192 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-13 06:29:27,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:29:27,257 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-13 06:29:27,465 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-13 06:29:27,476 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-13 06:29:27,530 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 41 treesize of output 46 [2024-11-13 06:29:27,595 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 50 treesize of output 58 [2024-11-13 06:29:27,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 67 [2024-11-13 06:29:27,737 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 71 treesize of output 70 [2024-11-13 06:29:27,812 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 71 treesize of output 70 [2024-11-13 06:29:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:29:31,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:29:34,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 1)) (.cse3 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 2)) (.cse4 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 3)) (.cse5 (+ |c_t1_funThread2of2ForFork2_init_~p#1.offset| 4)) (.cse6 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse7 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (v_ArrVal_10757 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10748))) (let ((.cse0 (store (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse7 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_10755) .cse5 v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse7) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (v_ArrVal_10757 Int)) (= (select (select (let ((.cse9 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10748))) (let ((.cse8 (store (store (select .cse9 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse7 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse8) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse9 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse8) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_10755) .cse5 v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (v_ArrVal_10757 Int)) (= (select (select (let ((.cse11 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10748))) (let ((.cse10 (store (store (select .cse11 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse7 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse10) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse11 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse10) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_10755) .cse5 v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (v_ArrVal_10757 Int)) (= (select (select (let ((.cse13 (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_10748))) (let ((.cse12 (store (store (select .cse13 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse6 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse7 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse12) |c_t1_funThread2of2ForFork2_init_~p#1.base| (store (store (store (store (select (store .cse13 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse12) |c_t1_funThread2of2ForFork2_init_~p#1.base|) .cse2 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse3 |t1_funThread2of2ForFork2_init_#t~nondet3#1|) .cse4 v_ArrVal_10755) .cse5 v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-11-13 06:29:34,324 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int)) (or (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (v_ArrVal_10757 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10748))) (let ((.cse0 (store (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int)) (or (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (v_ArrVal_10757 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse5 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10748))) (let ((.cse4 (store (store (select .cse5 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse4) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse5 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse4) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int)) (or (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (v_ArrVal_10757 Int)) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse7 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10748))) (let ((.cse6 (store (store (select .cse7 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse6) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse7 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse6) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int)) (or (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (v_ArrVal_10757 Int)) (= (select (select (let ((.cse9 (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_10748))) (let ((.cse8 (store (store (select .cse9 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse8) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| (store (store (store (store (select (store .cse9 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse8) |c_t1_funThread2of2ForFork2_init_#in~p#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (< |c_t1_funThread2of2ForFork2_init_#in~p#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|))))) is different from false [2024-11-13 06:29:34,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse3 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int) (v_ArrVal_10757 Int)) (or (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10748))) (let ((.cse0 (store (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))))) (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int) (v_ArrVal_10757 Int)) (or (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse5 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10748))) (let ((.cse4 (store (store (select .cse5 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse4) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse5 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse4) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3)))) (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int) (v_ArrVal_10757 Int)) (or (= (select (select (let ((.cse7 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10748))) (let ((.cse6 (store (store (select .cse7 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse6) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse7 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse6) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|))) (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int) (v_ArrVal_10757 Int)) (or (< |c_t1_funThread2of2ForFork2_~p~1#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) (= (select (select (let ((.cse9 (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_10748))) (let ((.cse8 (store (store (select .cse9 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse8) |c_t1_funThread2of2ForFork2_~p~1#1.base| (store (store (store (store (select (store .cse9 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse8) |c_t1_funThread2of2ForFork2_~p~1#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))))) is different from false [2024-11-13 06:29:34,573 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse3 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int) (v_ArrVal_10757 Int)) (or (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) (= (select (select (let ((.cse1 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10748))) (let ((.cse0 (store (store (select .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse1 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse0) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int) (v_ArrVal_10757 Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10748))) (let ((.cse4 (store (store (select .cse5 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse4) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse5 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse4) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|))) (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int) (v_ArrVal_10757 Int)) (or (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (let ((.cse7 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10748))) (let ((.cse6 (store (store (select .cse7 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse6) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse7 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse6) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3)))) (forall ((v_ArrVal_10748 (Array Int Int)) (|t1_funThread2of2ForFork2_init_#t~nondet3#1| Int) (v_ArrVal_10755 Int) (|v_t1_funThread2of2ForFork2_init_~p#1.offset_71| Int) (v_ArrVal_10757 Int)) (or (= (select (select (let ((.cse9 (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_10748))) (let ((.cse8 (store (store (select .cse9 |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse8) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| (store (store (store (store (select (store .cse9 |c_t1_funThread1of2ForFork2_insert_~list#1.base| .cse8) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base|) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 1) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 2 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) |t1_funThread2of2ForFork2_init_#t~nondet3#1|) (+ 3 |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|) v_ArrVal_10755) (+ |v_t1_funThread2of2ForFork2_init_~p#1.offset_71| 4) v_ArrVal_10757)))) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.offset| |v_t1_funThread2of2ForFork2_init_~p#1.offset_71|))))) is different from false [2024-11-13 06:29:37,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:37,900 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 2 case distinctions, treesize of input 106 treesize of output 111 [2024-11-13 06:29:37,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:37,907 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 72 treesize of output 42 [2024-11-13 06:29:37,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:37,948 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 137 treesize of output 127 [2024-11-13 06:29:37,953 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 686 treesize of output 618 [2024-11-13 06:29:37,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 146 treesize of output 110 [2024-11-13 06:29:37,966 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 4402 treesize of output 4338 [2024-11-13 06:29:37,984 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 17 treesize of output 13 [2024-11-13 06:29:38,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:29:38,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:29:38,026 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 30 treesize of output 36 [2024-11-13 06:29:38,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:29:38,031 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 0 case distinctions, treesize of input 54 treesize of output 24 [2024-11-13 06:29:38,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:29:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:29:40,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942026724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:29:40,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:29:40,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 23] total 60 [2024-11-13 06:29:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351466724] [2024-11-13 06:29:40,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:29:40,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-13 06:29:40,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:29:40,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-13 06:29:40,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2953, Unknown=12, NotChecked=452, Total=3660 [2024-11-13 06:29:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:29:40,154 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:29:40,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 8.75) internal successors, (525), 61 states have internal predecessors, (525), 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-13 06:29:40,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:40,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:40,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:29:40,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:40,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:40,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:40,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:29:40,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-11-13 06:29:40,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:29:46,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:29:50,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:29:59,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:01,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:03,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:05,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:07,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:10,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:13,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:17,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:21,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:23,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:25,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:27,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:30,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:32,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:34,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:36,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:38,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:40,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:42,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:44,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:46,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:48,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:50,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:52,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:54,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:56,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:30:59,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:01,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:03,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:05,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:07,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:09,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:20,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:22,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:24,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:26,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:28,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:36,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:42,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:44,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:46,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:48,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:50,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:52,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:54,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:56,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:31:58,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:00,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:02,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:04,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:06,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:08,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:10,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:12,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:14,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:16,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:18,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:20,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:22,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:25,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:27,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:29,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:31,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:33,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:35,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:37,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:39,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:41,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:43,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:45,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:47,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:49,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:51,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:53,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:57,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:32:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:32:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:32:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:32:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:32:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:32:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:32:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:32:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:32:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:32:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:32:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:32:57,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-13 06:32:57,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:32:57,667 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:32:57,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:32:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1168695747, now seen corresponding path program 4 times [2024-11-13 06:32:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:32:57,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237323742] [2024-11-13 06:32:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:32:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:32:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:32:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:32:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:32:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237323742] [2024-11-13 06:32:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237323742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:32:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679107661] [2024-11-13 06:32:58,759 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 06:32:58,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:32:58,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:32:58,761 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:32:58,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-13 06:33:04,921 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 06:33:04,921 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:33:04,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-13 06:33:04,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:33:05,145 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-13 06:33:05,233 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 06:33:05,234 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-13 06:33:05,574 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 13 treesize of output 9 [2024-11-13 06:33:05,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:05,667 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-13 06:33:05,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:05,681 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-13 06:33:05,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:05,691 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-13 06:33:05,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:05,699 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-13 06:33:05,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:05,777 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-13 06:33:05,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:05,785 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-13 06:33:05,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:05,798 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-13 06:33:05,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:05,805 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-13 06:33:05,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:33:05,882 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-13 06:33:06,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:06,037 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 25 treesize of output 13 [2024-11-13 06:33:06,072 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 23 treesize of output 22 [2024-11-13 06:33:06,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:33:06,115 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 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:33:06,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:33:06,165 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 41 treesize of output 46 [2024-11-13 06:33:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:33:06,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:33:06,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:33:06,701 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-13 06:33:06,703 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 22 treesize of output 16 [2024-11-13 06:33:07,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:33:07,366 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 30 treesize of output 35 [2024-11-13 06:33:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:33:07,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679107661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:33:07,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:33:07,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 47 [2024-11-13 06:33:07,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249711283] [2024-11-13 06:33:07,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:33:07,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-13 06:33:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:33:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-13 06:33:07,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2070, Unknown=1, NotChecked=0, Total=2256 [2024-11-13 06:33:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:33:07,609 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:33:07,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 10.53191489361702) internal successors, (495), 48 states have internal predecessors, (495), 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-13 06:33:07,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:33:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:33:07,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:33:07,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:33:07,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:33:07,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:33:07,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:33:16,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:33:18,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:33:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:33:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:33:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:33:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:33:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:33:18,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2024-11-13 06:33:18,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:33:18,992 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:33:18,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:33:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1311623266, now seen corresponding path program 4 times [2024-11-13 06:33:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:33:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107012218] [2024-11-13 06:33:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:33:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:33:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:33:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 06:33:20,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:33:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107012218] [2024-11-13 06:33:20,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107012218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:33:20,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603221834] [2024-11-13 06:33:20,666 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 06:33:20,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:33:20,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:33:20,668 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:33:20,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-13 06:33:28,898 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 06:33:28,898 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:33:28,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-13 06:33:28,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:33:28,919 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-13 06:33:29,077 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:33:29,077 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 19 treesize of output 16 [2024-11-13 06:33:29,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:29,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-13 06:33:29,308 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-13 06:33:29,309 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-13 06:33:29,787 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 13 treesize of output 9 [2024-11-13 06:33:29,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:29,918 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-13 06:33:29,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:29,931 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-13 06:33:29,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:29,942 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-13 06:33:29,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:29,950 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-13 06:33:30,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:30,025 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-13 06:33:30,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:30,035 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-13 06:33:30,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:30,045 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-13 06:33:30,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:33:30,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 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-13 06:33:30,126 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-13 06:33:30,127 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 16 treesize of output 18 [2024-11-13 06:33:30,259 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-13 06:33:30,266 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 23 treesize of output 22 [2024-11-13 06:33:30,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:33:30,275 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-13 06:33:30,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:33:30,288 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-13 06:33:30,299 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-13 06:33:30,311 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-13 06:33:30,324 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-13 06:33:30,367 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-13 06:33:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:33:30,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:33:30,391 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_11500 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_11500 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_11500 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))) (forall ((v_ArrVal_11500 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|))) is different from false [2024-11-13 06:33:30,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse3 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_11500 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11500 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11500 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11500 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse3)))))) is different from false [2024-11-13 06:33:30,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse0 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2))) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-11-13 06:33:30,793 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1| (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_init_#in~p#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)))))) is different from false [2024-11-13 06:33:30,824 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-11-13 06:33:30,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse2 (+ 7 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) (.cse0 (+ 5 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|))) (and (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse2) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~list#1.offset|)) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse1) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) (forall ((v_ArrVal_11490 (Array Int Int)) (v_ArrVal_11500 (Array Int Int))) (= (select (select (store (store |c_#race| |c_t1_funThread1of2ForFork2_insert_~list#1.base| (store (store (store (select (store |c_#race| |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11490) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)) |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| v_ArrVal_11500) |c_t1_funThread1of2ForFork2_insert_~list#1.base|) .cse0) |c_t1_funThread1of2ForFork2_insert_#t~nondet13#1|)))) is different from false [2024-11-13 06:33:31,692 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:33:31,694 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:33:31,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:33:31,697 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 25 treesize of output 26 [2024-11-13 06:33:31,699 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:33:31,701 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 22 treesize of output 16 [2024-11-13 06:33:31,704 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 06:33:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 06:33:37,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603221834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:33:37,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:33:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27, 20] total 59 [2024-11-13 06:33:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626267860] [2024-11-13 06:33:37,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:33:37,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-13 06:33:37,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:33:37,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-13 06:33:37,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2642, Unknown=47, NotChecked=654, Total=3540 [2024-11-13 06:33:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:33:37,265 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:33:37,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 8.64406779661017) internal successors, (510), 60 states have internal predecessors, (510), 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-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:33:37,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:33:37,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:33:48,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:33:50,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:33:53,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:33:55,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:33:57,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:33:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:33:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:33:58,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:33:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:33:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:33:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:33:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:33:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 06:33:58,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2024-11-13 06:33:58,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2024-11-13 06:33:58,422 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:33:58,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:33:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash 445965787, now seen corresponding path program 1 times [2024-11-13 06:33:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:33:58,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271645227] [2024-11-13 06:33:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:33:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:33:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:33:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 06:33:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:33:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271645227] [2024-11-13 06:33:59,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271645227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:33:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082050583] [2024-11-13 06:33:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:33:59,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:33:59,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:33:59,301 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:33:59,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-13 06:33:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:33:59,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 06:33:59,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:34:00,189 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 13 treesize of output 9 [2024-11-13 06:34:00,218 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 23 treesize of output 22 [2024-11-13 06:34:00,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:34:00,255 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 1 case distinctions, treesize of input 32 treesize of output 34 [2024-11-13 06:34:00,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:34:00,298 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 41 treesize of output 46 [2024-11-13 06:34:00,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:34:00,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:34:00,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:34:00,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 06:34:00,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 06:34:00,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 49 [2024-11-13 06:34:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 06:34:00,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:34:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 06:34:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082050583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:34:01,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:34:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 45 [2024-11-13 06:34:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519198779] [2024-11-13 06:34:01,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:34:01,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-13 06:34:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:34:01,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-13 06:34:01,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1847, Unknown=0, NotChecked=0, Total=2070 [2024-11-13 06:34:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:34:01,833 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:34:01,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 11.088888888888889) internal successors, (499), 46 states have internal predecessors, (499), 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-13 06:34:01,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:01,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:01,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:34:01,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-13 06:34:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:34:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:34:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:34:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:34:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:34:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:34:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:34:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:34:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:34:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-13 06:34:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:34:07,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-13 06:34:07,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:34:07,296 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-13 06:34:07,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 06:34:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash -522474096, now seen corresponding path program 5 times [2024-11-13 06:34:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 06:34:07,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986797200] [2024-11-13 06:34:07,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 06:34:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 06:34:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 06:34:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 06:34:08,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 06:34:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986797200] [2024-11-13 06:34:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986797200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 06:34:08,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628541980] [2024-11-13 06:34:08,905 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 06:34:08,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 06:34:08,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 06:34:08,906 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 06:34:08,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-13 06:34:09,920 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-13 06:34:09,920 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 06:34:09,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-13 06:34:09,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 06:34:09,933 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-13 06:34:10,032 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:34:10,032 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 19 treesize of output 16 [2024-11-13 06:34:10,114 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:34:10,115 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 19 treesize of output 16 [2024-11-13 06:34:10,164 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-13 06:34:10,165 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 19 treesize of output 16 [2024-11-13 06:34:10,420 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 06:34:10,421 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-13 06:34:10,543 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-13 06:34:10,581 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-13 06:34:10,624 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-13 06:34:10,672 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-13 06:34:10,723 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 42 treesize of output 50 [2024-11-13 06:34:10,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 59 [2024-11-13 06:34:10,852 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 63 treesize of output 62 [2024-11-13 06:34:10,926 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 63 treesize of output 62 [2024-11-13 06:34:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 06:34:15,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 06:34:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 06:34:19,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628541980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 06:34:19,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 06:34:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 19] total 51 [2024-11-13 06:34:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390236216] [2024-11-13 06:34:19,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 06:34:19,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-13 06:34:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 06:34:19,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-13 06:34:19,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2388, Unknown=2, NotChecked=0, Total=2652 [2024-11-13 06:34:19,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:34:19,223 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 06:34:19,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 8.784313725490197) internal successors, (448), 52 states have internal predecessors, (448), 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-13 06:34:19,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:19,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:34:19,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-13 06:34:19,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 06:34:24,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:34:28,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:34:36,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 06:34:38,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15