./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_84-list2_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9a849f68 Calling Ultimate with: /root/.sdkman/candidates/java/current/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_84-list2_racing2.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 f70125267ee7251a74a40ef1ba0ea3ced14d0fe45e7a9ea5a666e1eecab0c01c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-26 03:22:32,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-26 03:22:32,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-10-26 03:22:32,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-26 03:22:32,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-26 03:22:32,823 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-26 03:22:32,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-26 03:22:32,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-26 03:22:32,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-26 03:22:32,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-26 03:22:32,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-26 03:22:32,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-26 03:22:32,829 INFO L153 SettingsManager]: * Use SBE=true [2024-10-26 03:22:32,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-26 03:22:32,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-26 03:22:32,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-26 03:22:32,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-26 03:22:32,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-26 03:22:32,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-26 03:22:32,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-26 03:22:32,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-26 03:22:32,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-26 03:22:32,837 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-26 03:22:32,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-26 03:22:32,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-26 03:22:32,838 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-26 03:22:32,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-26 03:22:32,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-26 03:22:32,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-26 03:22:32,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-26 03:22:32,839 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-10-26 03:22:32,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-26 03:22:32,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 03:22:32,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-26 03:22:32,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-26 03:22:32,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-26 03:22:32,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-26 03:22:32,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-26 03:22:32,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-26 03:22:32,846 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-26 03:22:32,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-26 03:22:32,847 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-26 03:22:32,847 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-26 03:22:32,847 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 -> f70125267ee7251a74a40ef1ba0ea3ced14d0fe45e7a9ea5a666e1eecab0c01c [2024-10-26 03:22:33,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-26 03:22:33,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-26 03:22:33,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-26 03:22:33,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-26 03:22:33,184 INFO L274 PluginConnector]: CDTParser initialized [2024-10-26 03:22:33,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_84-list2_racing2.i [2024-10-26 03:22:34,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-26 03:22:35,214 INFO L384 CDTParser]: Found 1 translation units. [2024-10-26 03:22:35,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_84-list2_racing2.i [2024-10-26 03:22:35,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e60d1f339/268669c6bd584ba1aafa15a9aa807b3f/FLAG2c45ea0e5 [2024-10-26 03:22:35,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e60d1f339/268669c6bd584ba1aafa15a9aa807b3f [2024-10-26 03:22:35,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-26 03:22:35,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-26 03:22:35,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-26 03:22:35,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-26 03:22:35,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-26 03:22:35,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:22:35" (1/1) ... [2024-10-26 03:22:35,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d889515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:35, skipping insertion in model container [2024-10-26 03:22:35,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 03:22:35" (1/1) ... [2024-10-26 03:22:35,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-26 03:22:35,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 03:22:35,978 INFO L200 MainTranslator]: Completed pre-run [2024-10-26 03:22:36,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-26 03:22:36,148 INFO L204 MainTranslator]: Completed translation [2024-10-26 03:22:36,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36 WrapperNode [2024-10-26 03:22:36,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-26 03:22:36,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-26 03:22:36,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-26 03:22:36,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-26 03:22:36,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,272 INFO L138 Inliner]: procedures = 280, calls = 99, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 649 [2024-10-26 03:22:36,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-26 03:22:36,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-26 03:22:36,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-26 03:22:36,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-26 03:22:36,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-26 03:22:36,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-26 03:22:36,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-26 03:22:36,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-26 03:22:36,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (1/1) ... [2024-10-26 03:22:36,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-26 03:22:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:22:36,440 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-10-26 03:22:36,445 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-10-26 03:22:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-26 03:22:36,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-26 03:22:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2024-10-26 03:22:36,509 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2024-10-26 03:22:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-26 03:22:36,509 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2024-10-26 03:22:36,510 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2024-10-26 03:22:36,510 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-26 03:22:36,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-26 03:22:36,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-26 03:22:36,515 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-26 03:22:36,791 INFO L238 CfgBuilder]: Building ICFG [2024-10-26 03:22:36,795 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-26 03:22:38,029 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-26 03:22:38,029 INFO L287 CfgBuilder]: Performing block encoding [2024-10-26 03:22:38,104 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-26 03:22:38,104 INFO L314 CfgBuilder]: Removed 29 assume(true) statements. [2024-10-26 03:22:38,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:22:38 BoogieIcfgContainer [2024-10-26 03:22:38,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-26 03:22:38,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-26 03:22:38,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-26 03:22:38,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-26 03:22:38,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 03:22:35" (1/3) ... [2024-10-26 03:22:38,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781d55f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:22:38, skipping insertion in model container [2024-10-26 03:22:38,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 03:22:36" (2/3) ... [2024-10-26 03:22:38,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@781d55f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 03:22:38, skipping insertion in model container [2024-10-26 03:22:38,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 03:22:38" (3/3) ... [2024-10-26 03:22:38,119 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_84-list2_racing2.i [2024-10-26 03:22:38,145 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-26 03:22:38,146 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-26 03:22:38,146 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-26 03:22:38,349 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2024-10-26 03:22:38,449 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:22:38,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:22:38,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:22:38,454 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-10-26 03:22:38,456 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-10-26 03:22:38,522 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:22:38,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t3_funThread1of1ForFork0 ======== [2024-10-26 03:22:38,551 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;@29e2a666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:22:38,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-26 03:23:10,247 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-10-26 03:23:10,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash -637955433, now seen corresponding path program 1 times [2024-10-26 03:23:10,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:10,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261549005] [2024-10-26 03:23:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:10,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:23:10,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261549005] [2024-10-26 03:23:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261549005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:23:10,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739142109] [2024-10-26 03:23:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:10,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:10,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:10,996 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-10-26 03:23:10,998 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-10-26 03:23:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:11,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 03:23:11,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:23:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-26 03:23:11,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 03:23:11,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739142109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:23:11,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 03:23:11,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-26 03:23:11,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684443703] [2024-10-26 03:23:11,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:23:11,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:23:11,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:23:11,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:23:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:11,319 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:11,320 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-10-26 03:23:11,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:15,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-26 03:23:16,182 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-10-26 03:23:16,183 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-10-26 03:23:16,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash -583718242, now seen corresponding path program 1 times [2024-10-26 03:23:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:16,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375651915] [2024-10-26 03:23:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:16,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:23:16,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:16,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375651915] [2024-10-26 03:23:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375651915] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:23:16,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771239852] [2024-10-26 03:23:16,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:16,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:16,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:16,568 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-10-26 03:23:16,571 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-10-26 03:23:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:16,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-26 03:23:16,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:23:16,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:23:16,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:23:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:23:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771239852] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:23:16,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:23:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-26 03:23:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078695972] [2024-10-26 03:23:16,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:23:16,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-26 03:23:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-26 03:23:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-26 03:23:16,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:16,944 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:16,946 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-10-26 03:23:16,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:16,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:19,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:19,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2024-10-26 03:23:19,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-10-26 03:23:19,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-10-26 03:23:19,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-10-26 03:23:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-10-26 03:23:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-10-26 03:23:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-10-26 03:23:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-10-26 03:23:19,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-26 03:23:19,660 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-10-26 03:23:19,669 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-26 03:23:19,671 INFO L312 ceAbstractionStarter]: Result for error location t3_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/4) [2024-10-26 03:23:19,681 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:23:19,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:23:19,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:19,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:23:19,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-26 03:23:19,691 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:23:19,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork1 ======== [2024-10-26 03:23:19,693 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;@29e2a666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:23:19,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-26 03:23:23,062 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-10-26 03:23:23,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2028440439, now seen corresponding path program 1 times [2024-10-26 03:23:23,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:23,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246149819] [2024-10-26 03:23:23,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:23,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:23,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246149819] [2024-10-26 03:23:23,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246149819] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:23:23,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334174266] [2024-10-26 03:23:23,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:23,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:23,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:23,270 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-10-26 03:23:23,272 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-10-26 03:23:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:23,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-26 03:23:23,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:23:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-26 03:23:23,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-26 03:23:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334174266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:23:23,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-26 03:23:23,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-26 03:23:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346829344] [2024-10-26 03:23:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:23:23,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:23:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:23,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:23:23,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:23:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:23,474 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:23,475 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-10-26 03:23:23,475 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:23,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:23,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-26 03:23:24,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:24,057 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-10-26 03:23:24,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:24,057 INFO L85 PathProgramCache]: Analyzing trace with hash 534367274, now seen corresponding path program 1 times [2024-10-26 03:23:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:24,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323532181] [2024-10-26 03:23:24,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:24,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323532181] [2024-10-26 03:23:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323532181] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:23:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349385374] [2024-10-26 03:23:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:24,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:24,267 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-10-26 03:23:24,270 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-10-26 03:23:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:24,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-26 03:23:24,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:23:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:24,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:23:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349385374] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:23:24,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:23:24,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-26 03:23:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257596198] [2024-10-26 03:23:24,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:23:24,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-26 03:23:24,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:24,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-26 03:23:24,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-26 03:23:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:24,564 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:24,564 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-10-26 03:23:24,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:24,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:26,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2024-10-26 03:23:26,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-10-26 03:23:26,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-10-26 03:23:26,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-10-26 03:23:26,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-10-26 03:23:26,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-10-26 03:23:26,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-10-26 03:23:26,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-10-26 03:23:26,859 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-10-26 03:23:27,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:27,048 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-26 03:23:27,049 INFO L312 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork1 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (2/4) [2024-10-26 03:23:27,057 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:23:27,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:23:27,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:27,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:23:27,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-10-26 03:23:27,063 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:23:27,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of1ForFork2 ======== [2024-10-26 03:23:27,064 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;@29e2a666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:23:27,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-26 03:23:27,460 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-10-26 03:23:27,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1872216114, now seen corresponding path program 1 times [2024-10-26 03:23:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060969236] [2024-10-26 03:23:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:28,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:28,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060969236] [2024-10-26 03:23:28,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060969236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:23:28,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:23:28,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:23:28,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044363485] [2024-10-26 03:23:28,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:23:28,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:23:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:28,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:23:28,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:23:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:28,109 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:28,109 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-10-26 03:23:28,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:28,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:28,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-26 03:23:28,609 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-10-26 03:23:28,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1109606701, now seen corresponding path program 1 times [2024-10-26 03:23:28,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:28,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205332382] [2024-10-26 03:23:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205332382] [2024-10-26 03:23:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205332382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:23:29,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:23:29,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:23:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719157080] [2024-10-26 03:23:29,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:23:29,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:23:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:29,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:23:29,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:23:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:29,417 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:29,419 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-10-26 03:23:29,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:29,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:29,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-26 03:23:29,714 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-10-26 03:23:29,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1566982791, now seen corresponding path program 1 times [2024-10-26 03:23:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:29,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489561598] [2024-10-26 03:23:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:29,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:29,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489561598] [2024-10-26 03:23:29,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489561598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:23:29,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:23:29,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:23:29,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933924395] [2024-10-26 03:23:29,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:23:29,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:23:29,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:29,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:23:29,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:23:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:29,800 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:29,800 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-10-26 03:23:29,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:29,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:29,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:30,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-26 03:23:30,589 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-10-26 03:23:30,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:30,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1786421597, now seen corresponding path program 1 times [2024-10-26 03:23:30,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:30,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90515118] [2024-10-26 03:23:30,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:30,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:31,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90515118] [2024-10-26 03:23:31,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90515118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:23:31,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:23:31,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:23:31,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952597354] [2024-10-26 03:23:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:23:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:23:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:31,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:23:31,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:23:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:31,110 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:31,110 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-10-26 03:23:31,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:31,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:31,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:31,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:32,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-26 03:23:32,009 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-10-26 03:23:32,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash 905760852, now seen corresponding path program 1 times [2024-10-26 03:23:32,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:32,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971332513] [2024-10-26 03:23:32,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:32,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971332513] [2024-10-26 03:23:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971332513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:23:32,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:23:32,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:23:32,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792793081] [2024-10-26 03:23:32,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:23:32,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:23:32,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:32,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:23:32,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:23:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:32,515 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:32,516 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-10-26 03:23:32,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:32,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:32,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:32,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:32,516 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:33,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-26 03:23:33,070 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-10-26 03:23:33,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1596972455, now seen corresponding path program 1 times [2024-10-26 03:23:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:33,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67229700] [2024-10-26 03:23:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:33,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:33,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:33,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67229700] [2024-10-26 03:23:33,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67229700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:23:33,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:23:33,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:23:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500481732] [2024-10-26 03:23:33,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:23:33,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:23:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:33,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:23:33,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:23:33,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:33,586 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:33,587 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-10-26 03:23:33,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:33,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:33,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:33,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:33,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:33,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:34,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:34,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:34,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:34,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:34,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:34,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-26 03:23:34,154 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-10-26 03:23:34,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash -238470661, now seen corresponding path program 1 times [2024-10-26 03:23:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:34,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746673379] [2024-10-26 03:23:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:34,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746673379] [2024-10-26 03:23:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746673379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:23:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283834881] [2024-10-26 03:23:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:34,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:34,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:34,954 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-10-26 03:23:34,956 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-10-26 03:23:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:35,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-26 03:23:35,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:23:35,409 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-10-26 03:23:35,439 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-10-26 03:23:35,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:35,618 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-10-26 03:23:35,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:35,662 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-10-26 03:23:35,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:23:35,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 45 treesize of output 34 [2024-10-26 03:23:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:35,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:23:35,847 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-10-26 03:23:35,954 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-10-26 03:23:40,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:40,160 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-10-26 03:23:40,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:40,167 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-10-26 03:23:40,179 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:23:40,180 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-10-26 03:23:40,186 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:23:40,186 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-10-26 03:23:40,192 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:23:40,193 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-10-26 03:23:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:23:40,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283834881] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:23:40,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:23:40,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-26 03:23:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145259682] [2024-10-26 03:23:40,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:23:40,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-26 03:23:40,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-26 03:23:40,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=568, Unknown=26, NotChecked=102, Total=812 [2024-10-26 03:23:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:40,372 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:40,372 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-10-26 03:23:40,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:40,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:40,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:40,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:40,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:40,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:40,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:23:42,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-26 03:23:42,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:42,202 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-10-26 03:23:42,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash -727144743, now seen corresponding path program 1 times [2024-10-26 03:23:42,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:42,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782185752] [2024-10-26 03:23:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:42,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:42,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:42,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782185752] [2024-10-26 03:23:42,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782185752] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:23:42,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964634832] [2024-10-26 03:23:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:42,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:42,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:42,404 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-10-26 03:23:42,406 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-10-26 03:23:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:42,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-26 03:23:42,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:23:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:42,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:23:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:42,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964634832] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:23:42,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:23:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-26 03:23:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067150010] [2024-10-26 03:23:42,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:23:42,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-26 03:23:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-26 03:23:42,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-26 03:23:42,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:42,929 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:42,930 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-10-26 03:23:42,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:42,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:42,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:42,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:42,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:42,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:42,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:23:42,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:44,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:44,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:44,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:44,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:23:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:44,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-26 03:23:44,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:44,449 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-10-26 03:23:44,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:44,449 INFO L85 PathProgramCache]: Analyzing trace with hash 707137646, now seen corresponding path program 1 times [2024-10-26 03:23:44,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:44,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926513630] [2024-10-26 03:23:44,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:44,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:45,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:45,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926513630] [2024-10-26 03:23:45,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926513630] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:23:45,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696650648] [2024-10-26 03:23:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:45,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:45,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:45,467 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-10-26 03:23:45,469 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-10-26 03:23:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:45,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:23:45,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:23:46,002 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-10-26 03:23:46,026 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-10-26 03:23:46,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:46,072 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-10-26 03:23:46,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:46,122 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-10-26 03:23:46,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:23:46,250 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-10-26 03:23:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:46,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:23:46,282 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-10-26 03:23:46,391 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-10-26 03:23:46,410 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-10-26 03:23:48,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:48,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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2024-10-26 03:23:48,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:48,519 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-10-26 03:23:48,534 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:23:48,534 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-10-26 03:23:48,541 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:23:48,542 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-10-26 03:23:48,547 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:23:48,548 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-10-26 03:23:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:23:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696650648] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:23:48,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:23:48,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-26 03:23:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324150427] [2024-10-26 03:23:48,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:23:48,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-26 03:23:48,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:48,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-26 03:23:48,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=745, Unknown=15, NotChecked=174, Total=1056 [2024-10-26 03:23:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:48,829 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:48,830 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-10-26 03:23:48,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:48,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:48,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:48,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:48,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:48,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:48,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:23:48,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:48,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:50,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:50,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:50,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:23:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:23:50,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-26 03:23:50,925 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,SelfDestructingSolverStorable12 [2024-10-26 03:23:50,926 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-10-26 03:23:50,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1843762731, now seen corresponding path program 1 times [2024-10-26 03:23:50,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:50,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55006869] [2024-10-26 03:23:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:51,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55006869] [2024-10-26 03:23:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55006869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:23:51,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664176154] [2024-10-26 03:23:51,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:23:51,707 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-10-26 03:23:51,709 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-10-26 03:23:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:51,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:23:51,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:23:52,234 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-10-26 03:23:52,260 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-10-26 03:23:52,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:52,304 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-10-26 03:23:52,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:52,348 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-10-26 03:23:52,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:23:52,669 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-10-26 03:23:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:52,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:23:52,705 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store |c_#race| |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| 7)) 0)) (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store |c_#race| |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 |c_#race| |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 |c_#race| |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))) is different from false [2024-10-26 03:23:52,812 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-10-26 03:23:57,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:57,022 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-10-26 03:23:57,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:23:57,026 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-10-26 03:23:57,035 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:23:57,035 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-10-26 03:23:57,041 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:23:57,041 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-10-26 03:23:57,046 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:23:57,046 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-10-26 03:23:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:23:57,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664176154] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:23:57,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:23:57,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-26 03:23:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972985521] [2024-10-26 03:23:57,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:23:57,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-26 03:23:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-26 03:23:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=765, Unknown=45, NotChecked=118, Total=1056 [2024-10-26 03:23:57,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:57,273 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:57,274 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-10-26 03:23:57,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:57,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:57,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:57,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:23:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:23:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:23:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:23:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:23:59,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-26 03:23:59,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:23:59,260 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-10-26 03:23:59,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1566981797, now seen corresponding path program 1 times [2024-10-26 03:23:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:59,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272758521] [2024-10-26 03:23:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:23:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:23:59,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:23:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272758521] [2024-10-26 03:23:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272758521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:23:59,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:23:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:23:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440411014] [2024-10-26 03:23:59,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:23:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:23:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:23:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:23:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:23:59,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:59,351 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:23:59,351 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-10-26 03:23:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:23:59,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:23:59,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:23:59,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:23:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:23:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:23:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:23:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:23:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:23:59,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-26 03:23:59,633 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-10-26 03:23:59,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:23:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1126277137, now seen corresponding path program 1 times [2024-10-26 03:23:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:23:59,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202077656] [2024-10-26 03:23:59,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:23:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:23:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:00,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202077656] [2024-10-26 03:24:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202077656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:24:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982010648] [2024-10-26 03:24:00,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:00,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:24:00,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:24:00,702 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-10-26 03:24:00,705 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-10-26 03:24:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:01,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:24:01,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:24:01,225 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-10-26 03:24:01,248 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-10-26 03:24:01,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:01,282 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-10-26 03:24:01,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:01,321 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-10-26 03:24:01,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:01,442 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-10-26 03:24:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:01,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:24:01,469 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-10-26 03:24:01,562 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-10-26 03:24:01,577 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-10-26 03:24:01,591 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-10-26 03:24:01,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:01,604 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-10-26 03:24:01,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:01,609 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-10-26 03:24:01,619 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:01,619 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-10-26 03:24:01,624 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:01,624 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-10-26 03:24:01,629 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:01,629 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-10-26 03:24:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:24:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982010648] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:24:01,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:24:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-10-26 03:24:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490915077] [2024-10-26 03:24:01,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:24:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-26 03:24:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:01,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-26 03:24:01,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=824, Unknown=4, NotChecked=244, Total=1190 [2024-10-26 03:24:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:01,837 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:01,838 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-10-26 03:24:01,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:01,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:01,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:01,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:01,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:01,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:01,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:01,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:01,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:01,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:01,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:01,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:03,006 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-10-26 03:24:03,193 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,SelfDestructingSolverStorable15 [2024-10-26 03:24:03,193 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-10-26 03:24:03,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:03,194 INFO L85 PathProgramCache]: Analyzing trace with hash 535470474, now seen corresponding path program 1 times [2024-10-26 03:24:03,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:03,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42602887] [2024-10-26 03:24:03,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:03,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42602887] [2024-10-26 03:24:04,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42602887] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:24:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103222745] [2024-10-26 03:24:04,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:04,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:24:04,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:24:04,087 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-10-26 03:24:04,088 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-10-26 03:24:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:04,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:24:04,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:24:04,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-10-26 03:24:04,583 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-10-26 03:24:04,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:04,611 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-10-26 03:24:04,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:04,646 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-10-26 03:24:04,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:04,747 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-10-26 03:24:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:04,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:24:06,922 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-10-26 03:24:06,940 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-10-26 03:24:06,957 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-10-26 03:24:06,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:06,972 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-10-26 03:24:06,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:06,977 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-10-26 03:24:06,985 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:06,985 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-10-26 03:24:06,991 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:06,991 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-10-26 03:24:06,997 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:06,997 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-10-26 03:24:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:07,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103222745] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:24:07,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:24:07,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-10-26 03:24:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957195290] [2024-10-26 03:24:07,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:24:07,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-26 03:24:07,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:07,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-26 03:24:07,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=870, Unknown=14, NotChecked=186, Total=1190 [2024-10-26 03:24:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:07,192 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:07,192 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-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:07,193 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:08,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-26 03:24:08,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-26 03:24:08,552 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-10-26 03:24:08,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:08,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1534845283, now seen corresponding path program 1 times [2024-10-26 03:24:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:08,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525880622] [2024-10-26 03:24:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:08,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525880622] [2024-10-26 03:24:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525880622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:24:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532178750] [2024-10-26 03:24:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:09,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:24:09,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:24:09,270 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-10-26 03:24:09,271 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-10-26 03:24:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:09,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-26 03:24:09,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:24:09,666 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-10-26 03:24:09,684 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-10-26 03:24:09,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:09,711 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-10-26 03:24:09,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:09,744 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-10-26 03:24:09,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:09,845 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-10-26 03:24:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:09,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:24:09,865 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1_ids~0#1.base| v_ArrVal_3565) |c_t1_funThread1of1ForFork2_init_~p#1.base|) (+ 7 |c_t1_funThread1of1ForFork2_init_~p#1.offset|)) |c_t1_funThread1of1ForFork2_init_#t~nondet4#1|)) (forall ((v_ArrVal_3565 (Array Int Int))) (= (select (select (store |c_#race| |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 |c_#race| |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 |c_#race| |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-10-26 03:24:09,935 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-10-26 03:24:09,948 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-10-26 03:24:09,962 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-10-26 03:24:09,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:09,973 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-10-26 03:24:09,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:09,977 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-10-26 03:24:09,983 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:09,983 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-10-26 03:24:09,992 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:09,992 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-10-26 03:24:09,999 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:09,999 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-10-26 03:24:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:24:10,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532178750] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:24:10,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:24:10,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-26 03:24:10,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888394463] [2024-10-26 03:24:10,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:24:10,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-26 03:24:10,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:10,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-26 03:24:10,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=510, Unknown=4, NotChecked=196, Total=812 [2024-10-26 03:24:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:10,080 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:10,081 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-10-26 03:24:10,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:10,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:10,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:10,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:10,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:10,081 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:10,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:10,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:10,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:10,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:10,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:10,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:10,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:10,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:12,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-26 03:24:12,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-26 03:24:12,305 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-10-26 03:24:12,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1367310864, now seen corresponding path program 1 times [2024-10-26 03:24:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:12,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217244714] [2024-10-26 03:24:12,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:12,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:12,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217244714] [2024-10-26 03:24:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217244714] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:24:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280902156] [2024-10-26 03:24:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:12,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:24:12,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:24:12,875 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-10-26 03:24:12,877 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-10-26 03:24:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:13,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-26 03:24:13,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:24:13,281 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-10-26 03:24:13,301 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-10-26 03:24:13,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:13,331 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-10-26 03:24:13,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:13,362 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-10-26 03:24:13,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:13,461 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-10-26 03:24:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:13,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:24:13,482 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-10-26 03:24:13,547 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-10-26 03:24:13,563 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-10-26 03:24:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:24:15,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280902156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:24:15,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:24:15,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-10-26 03:24:15,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447803877] [2024-10-26 03:24:15,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:24:15,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-26 03:24:15,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:15,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-26 03:24:15,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=509, Unknown=3, NotChecked=144, Total=756 [2024-10-26 03:24:15,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:15,671 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:15,671 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-10-26 03:24:15,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:15,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:15,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-26 03:24:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:17,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:17,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2024-10-26 03:24:17,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-10-26 03:24:17,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-10-26 03:24:17,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-10-26 03:24:17,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-10-26 03:24:17,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-10-26 03:24:17,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-10-26 03:24:17,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-26 03:24:17,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:24:17,386 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-26 03:24:17,387 INFO L312 ceAbstractionStarter]: Result for error location t1_funThread1of1ForFork2 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (3/4) [2024-10-26 03:24:17,398 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:24:17,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:24:17,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:24:17,400 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:24:17,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2024-10-26 03:24:17,405 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:24:17,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-26 03:24:17,409 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;@29e2a666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:24:17,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-10-26 03:24:17,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-10-26 03:24:17,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash -268106916, now seen corresponding path program 1 times [2024-10-26 03:24:17,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:17,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120964661] [2024-10-26 03:24:17,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:17,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:17,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:17,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120964661] [2024-10-26 03:24:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120964661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:24:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948763186] [2024-10-26 03:24:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:17,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:24:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:17,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:24:17,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:24:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:17,458 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-10-26 03:24:17,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-26 03:24:17,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-10-26 03:24:17,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:17,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1765068408, now seen corresponding path program 1 times [2024-10-26 03:24:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:17,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712636296] [2024-10-26 03:24:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:17,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:17,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712636296] [2024-10-26 03:24:17,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712636296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:17,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:17,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:24:17,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058699767] [2024-10-26 03:24:17,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:17,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:24:17,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:17,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:24:17,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:24:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,488 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:17,488 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-10-26 03:24:17,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-26 03:24:17,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-10-26 03:24:17,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash 449799134, now seen corresponding path program 1 times [2024-10-26 03:24:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:17,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566016936] [2024-10-26 03:24:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:17,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566016936] [2024-10-26 03:24:17,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566016936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:17,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:17,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:24:17,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007783727] [2024-10-26 03:24:17,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:17,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:24:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:17,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:24:17,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:24:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,628 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:17,628 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-10-26 03:24:17,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-26 03:24:17,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-10-26 03:24:17,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1878191699, now seen corresponding path program 1 times [2024-10-26 03:24:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:17,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917634277] [2024-10-26 03:24:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917634277] [2024-10-26 03:24:17,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917634277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:17,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:24:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533903003] [2024-10-26 03:24:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:17,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:24:17,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:24:17,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:24:17,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,837 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:17,837 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-10-26 03:24:17,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-26 03:24:17,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-10-26 03:24:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -481464965, now seen corresponding path program 1 times [2024-10-26 03:24:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941615254] [2024-10-26 03:24:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:17,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:17,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941615254] [2024-10-26 03:24:17,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941615254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:17,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:17,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:24:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969872124] [2024-10-26 03:24:17,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:17,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:24:17,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:17,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:24:17,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:24:17,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,912 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:17,912 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-10-26 03:24:17,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-26 03:24:17,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-10-26 03:24:17,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:17,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2116067288, now seen corresponding path program 1 times [2024-10-26 03:24:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:17,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781455223] [2024-10-26 03:24:17,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781455223] [2024-10-26 03:24:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781455223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:17,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:17,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:24:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448242318] [2024-10-26 03:24:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:17,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:24:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:17,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:24:17,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:24:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:17,955 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:17,955 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-10-26 03:24:17,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:17,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:17,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-26 03:24:18,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-10-26 03:24:18,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash -978516245, now seen corresponding path program 1 times [2024-10-26 03:24:18,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:18,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342683089] [2024-10-26 03:24:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:18,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:18,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342683089] [2024-10-26 03:24:18,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342683089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:18,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:18,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:24:18,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890010915] [2024-10-26 03:24:18,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:18,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:24:18,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:18,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:24:18,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:24:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:18,393 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:18,394 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-10-26 03:24:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:18,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-26 03:24:18,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2024-10-26 03:24:18,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1906406228, now seen corresponding path program 1 times [2024-10-26 03:24:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:18,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667556245] [2024-10-26 03:24:18,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 03:24:18,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-26 03:24:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-26 03:24:18,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-26 03:24:18,841 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-26 03:24:18,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 24 remaining) [2024-10-26 03:24:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 24 remaining) [2024-10-26 03:24:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2024-10-26 03:24:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2024-10-26 03:24:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2024-10-26 03:24:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2024-10-26 03:24:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2024-10-26 03:24:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2024-10-26 03:24:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (13 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (12 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (11 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (10 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2024-10-26 03:24:18,843 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2024-10-26 03:24:18,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2024-10-26 03:24:18,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2024-10-26 03:24:18,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 24 remaining) [2024-10-26 03:24:18,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-26 03:24:18,848 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-26 03:24:18,849 INFO L312 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,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (4/4) [2024-10-26 03:24:18,850 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-26 03:24:18,850 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-26 03:24:18,963 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-10-26 03:24:18,974 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:24:18,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-26 03:24:18,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:24:18,976 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-26 03:24:18,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-10-26 03:24:18,981 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-26 03:24:18,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of2ForFork2 ======== [2024-10-26 03:24:18,982 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;@29e2a666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-26 03:24:18,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-26 03:24:19,908 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-10-26 03:24:19,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:19,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1486664354, now seen corresponding path program 1 times [2024-10-26 03:24:19,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:19,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225623574] [2024-10-26 03:24:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:19,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:20,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:20,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225623574] [2024-10-26 03:24:20,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225623574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:20,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:20,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:24:20,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279417647] [2024-10-26 03:24:20,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:20,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:24:20,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:20,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:24:20,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:24:20,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:20,261 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:20,261 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-10-26 03:24:20,261 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:20,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:20,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-26 03:24:20,923 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-10-26 03:24:20,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash -32183581, now seen corresponding path program 1 times [2024-10-26 03:24:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:20,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615301405] [2024-10-26 03:24:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615301405] [2024-10-26 03:24:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615301405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:21,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:24:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3724962] [2024-10-26 03:24:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:24:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:24:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:24:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:21,276 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:21,276 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-10-26 03:24:21,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:21,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:21,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:21,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-26 03:24:21,685 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-10-26 03:24:21,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1505196023, now seen corresponding path program 1 times [2024-10-26 03:24:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532516908] [2024-10-26 03:24:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532516908] [2024-10-26 03:24:21,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532516908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:21,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:21,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-26 03:24:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539621894] [2024-10-26 03:24:21,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:21,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:24:21,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:21,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:24:21,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:24:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:21,739 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:21,739 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-10-26 03:24:21,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:21,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:21,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:22,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-26 03:24:22,833 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-10-26 03:24:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 684582451, now seen corresponding path program 1 times [2024-10-26 03:24:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814720299] [2024-10-26 03:24:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:23,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814720299] [2024-10-26 03:24:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814720299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:23,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:24:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004129017] [2024-10-26 03:24:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:23,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:24:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:23,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:24:23,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:24:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:23,132 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:23,133 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-10-26 03:24:23,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:23,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:23,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:23,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:24,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-26 03:24:24,552 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-10-26 03:24:24,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash 117832833, now seen corresponding path program 1 times [2024-10-26 03:24:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:24,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631048150] [2024-10-26 03:24:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:24,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:24,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:24,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631048150] [2024-10-26 03:24:24,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631048150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:24,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:24,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:24:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191283892] [2024-10-26 03:24:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:24,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:24:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:24,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:24:24,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:24:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:24,920 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:24,920 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-10-26 03:24:24,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:24,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:24,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:24,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:24,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:25,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-26 03:24:25,639 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-10-26 03:24:25,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1609531386, now seen corresponding path program 1 times [2024-10-26 03:24:25,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:25,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059131048] [2024-10-26 03:24:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:26,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059131048] [2024-10-26 03:24:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059131048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:26,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:26,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-26 03:24:26,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281243323] [2024-10-26 03:24:26,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:26,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:24:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:26,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:24:26,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:24:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:26,194 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:26,195 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-10-26 03:24:26,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:26,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:26,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:26,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:26,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:26,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:32,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-26 03:24:32,546 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-10-26 03:24:32,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1190074157, now seen corresponding path program 1 times [2024-10-26 03:24:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:32,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679987798] [2024-10-26 03:24:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:33,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:33,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679987798] [2024-10-26 03:24:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679987798] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:24:33,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82701566] [2024-10-26 03:24:33,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:33,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:24:33,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:24:33,257 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-10-26 03:24:33,258 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-10-26 03:24:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:33,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-26 03:24:33,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:24:33,823 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-10-26 03:24:33,842 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-10-26 03:24:33,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:33,868 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-10-26 03:24:33,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:33,900 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-10-26 03:24:34,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:34,018 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-10-26 03:24:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:34,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:24:34,040 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-10-26 03:24:34,103 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-10-26 03:24:34,114 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-10-26 03:24:34,127 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-10-26 03:24:34,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:34,142 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-10-26 03:24:34,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:34,148 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-10-26 03:24:34,157 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:34,157 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-10-26 03:24:34,163 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:34,163 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-10-26 03:24:34,169 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:24:34,170 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-10-26 03:24:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:24:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82701566] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:24:34,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:24:34,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-26 03:24:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694388498] [2024-10-26 03:24:34,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:24:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-26 03:24:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:34,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-26 03:24:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=510, Unknown=4, NotChecked=196, Total=812 [2024-10-26 03:24:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:34,296 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:34,296 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-10-26 03:24:34,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:34,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:34,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:34,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:34,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:34,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:34,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:39,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-26 03:24:39,256 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,SelfDestructingSolverStorable33 [2024-10-26 03:24:39,256 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-10-26 03:24:39,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash -962675846, now seen corresponding path program 1 times [2024-10-26 03:24:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:39,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254400260] [2024-10-26 03:24:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-26 03:24:39,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:39,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254400260] [2024-10-26 03:24:39,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254400260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:39,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:39,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-26 03:24:39,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667512681] [2024-10-26 03:24:39,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:39,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-26 03:24:39,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:39,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-26 03:24:39,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-26 03:24:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:39,715 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:39,715 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-10-26 03:24:39,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:39,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:39,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:39,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:43,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-26 03:24:43,847 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-10-26 03:24:43,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:43,848 INFO L85 PathProgramCache]: Analyzing trace with hash -585259841, now seen corresponding path program 1 times [2024-10-26 03:24:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:43,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689345616] [2024-10-26 03:24:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:24:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689345616] [2024-10-26 03:24:45,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689345616] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:24:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035950847] [2024-10-26 03:24:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:24:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:24:45,103 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-10-26 03:24:45,105 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-10-26 03:24:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:45,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-26 03:24:45,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:24:45,565 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-10-26 03:24:45,764 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-10-26 03:24:45,789 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-10-26 03:24:45,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:45,825 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-10-26 03:24:45,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:45,867 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-10-26 03:24:46,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:46,003 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-10-26 03:24:46,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:46,016 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-10-26 03:24:46,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:46,030 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-10-26 03:24:46,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:46,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 45 treesize of output 34 [2024-10-26 03:24:46,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:46,161 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-10-26 03:24:46,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:46,182 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-10-26 03:24:46,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24: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 45 treesize of output 34 [2024-10-26 03:24:46,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:24:46,214 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-10-26 03:24:46,281 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:24:46,282 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-10-26 03:24:46,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2024-10-26 03:24:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:24:46,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:24:46,362 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5622 (Array Int Int))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 5 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~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_~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))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_~p#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|))))) is different from false [2024-10-26 03:24:46,382 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-10-26 03:24:46,397 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#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))) (= |c_t1_funThread1of2ForFork2_insert_#t~nondet14#1| (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#1.base| v_ArrVal_5622) |c_t1_funThread1of2ForFork2_insert_~node#1.base|) (+ 4 |c_t1_funThread1of2ForFork2_insert_~node#1.offset|)))) (forall ((v_ArrVal_5622 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#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_~p~1#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|))) is different from false [2024-10-26 03:24:46,411 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-10-26 03:24:49,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:49,510 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-10-26 03:24:49,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:49,514 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-10-26 03:24:49,521 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-10-26 03:24:49,524 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-10-26 03:24:49,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:49,551 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-10-26 03:24:49,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:24:49,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:49,556 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-10-26 03:24:49,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:49,570 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-10-26 03:24:49,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:24:49,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:49,575 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-10-26 03:24:49,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:49,589 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-10-26 03:24:49,593 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:24:49,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:24:49,596 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-10-26 03:24:53,226 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-10-26 03:24:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:24:53,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035950847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:24:53,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:24:53,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 40 [2024-10-26 03:24:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220519766] [2024-10-26 03:24:53,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:24:53,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-26 03:24:53,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:53,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-26 03:24:53,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1151, Unknown=27, NotChecked=292, Total=1640 [2024-10-26 03:24:53,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:53,270 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:53,270 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-10-26 03:24:53,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:53,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:53,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:53,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:53,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:24:57,903 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-10-26 03:24:58,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:24:58,089 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-10-26 03:24:58,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1852770314, now seen corresponding path program 1 times [2024-10-26 03:24:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:58,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865493705] [2024-10-26 03:24:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:24:58,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865493705] [2024-10-26 03:24:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865493705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:24:58,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:24:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-26 03:24:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961941343] [2024-10-26 03:24:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:24:58,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-26 03:24:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:24:58,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-26 03:24:58,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-26 03:24:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:58,304 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:24:58,305 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-10-26 03:24:58,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:58,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:58,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:58,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:58,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:58,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:58,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:58,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:58,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:24:58,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:24:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:24:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:24:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:24:59,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:24:59,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-26 03:24:59,484 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-10-26 03:24:59,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:24:59,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2081196179, now seen corresponding path program 1 times [2024-10-26 03:24:59,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:24:59,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122653010] [2024-10-26 03:24:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:24:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:24:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:24:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:24:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122653010] [2024-10-26 03:24:59,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122653010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:24:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970780106] [2024-10-26 03:24:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:24:59,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:24:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:24:59,697 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-10-26 03:24:59,697 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-10-26 03:25:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:25:00,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-26 03:25:00,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:25:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:25:00,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:25:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:25:00,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970780106] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:25:00,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:25:00,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-26 03:25:00,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240892739] [2024-10-26 03:25:00,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:25:00,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-26 03:25:00,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:25:00,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-26 03:25:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-26 03:25:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:25:00,303 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:25:00,303 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-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:25:00,303 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:00,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:25:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:25:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:00,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:25:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:25:00,936 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-10-26 03:25:01,122 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,SelfDestructingSolverStorable37 [2024-10-26 03:25:01,122 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-10-26 03:25:01,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:25:01,123 INFO L85 PathProgramCache]: Analyzing trace with hash 149572525, now seen corresponding path program 2 times [2024-10-26 03:25:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:25:01,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300450999] [2024-10-26 03:25:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:25:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:25:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:25:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:25:02,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:25:02,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300450999] [2024-10-26 03:25:02,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300450999] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:25:02,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441917554] [2024-10-26 03:25:02,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:25:02,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:25:02,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:25:02,113 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-10-26 03:25:02,114 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-10-26 03:25:02,898 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:25:02,898 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:25:02,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-10-26 03:25:02,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:25:02,954 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-10-26 03:25:02,971 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:25:02,972 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-10-26 03:25:03,238 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-10-26 03:25:03,270 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-10-26 03:25:03,307 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-10-26 03:25:03,436 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-10-26 03:25:03,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-10-26 03:25:03,555 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-10-26 03:25:03,569 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-10-26 03:25:03,674 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-10-26 03:25:03,689 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-10-26 03:25:03,704 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-10-26 03:25:03,719 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-10-26 03:25:03,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:03,946 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-10-26 03:25:03,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:03,955 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-10-26 03:25:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:25:03,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:25:04,618 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-10-26 03:25:04,898 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-10-26 03:25:07,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:07,174 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-10-26 03:25:07,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:07,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 330 treesize of output 292 [2024-10-26 03:25:07,191 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-10-26 03:25:07,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:07,255 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-10-26 03:25:07,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:07,271 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-10-26 03:25:07,274 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:25:07,282 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:25:07,282 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-10-26 03:25:07,289 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-10-26 03:25:07,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:25:07,304 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-26 03:25:07,305 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-10-26 03:25:07,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:07,330 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-10-26 03:25:07,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:25:07,340 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:25:07,341 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-10-26 03:25:07,348 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-10-26 03:25:07,365 INFO L349 Elim1Store]: treesize reduction 27, result has 12.9 percent of original size [2024-10-26 03:25:07,365 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-10-26 03:25:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-10-26 03:25:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441917554] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:25:07,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:25:07,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 46 [2024-10-26 03:25:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24645487] [2024-10-26 03:25:07,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:25:07,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-26 03:25:07,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:25:07,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-26 03:25:07,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1805, Unknown=29, NotChecked=174, Total=2162 [2024-10-26 03:25:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:25:07,877 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:25:07,878 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-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:25:07,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:25:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:25:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:25:14,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-26 03:25:14,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-26 03:25:14,994 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-10-26 03:25:14,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:25:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash -481121857, now seen corresponding path program 3 times [2024-10-26 03:25:14,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:25:14,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981414709] [2024-10-26 03:25:14,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:25:14,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:25:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:25:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:25:15,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:25:15,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981414709] [2024-10-26 03:25:15,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981414709] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:25:15,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229015227] [2024-10-26 03:25:15,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 03:25:15,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:25:15,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:25:15,986 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-10-26 03:25:15,987 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-10-26 03:25:20,425 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 03:25:20,425 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:25:20,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-26 03:25:20,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:25:20,586 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-10-26 03:25:20,967 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-10-26 03:25:21,003 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-10-26 03:25:21,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:25:21,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-26 03:25:21,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:25:21,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-10-26 03:25:21,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:25:21,182 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-10-26 03:25:21,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:25:21,195 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-10-26 03:25:21,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:25:21,365 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-10-26 03:25:21,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:25:21,375 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-10-26 03:25:21,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:25:21,386 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-10-26 03:25:21,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:25:21,398 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-10-26 03:25:21,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:25:21,452 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-10-26 03:25:21,596 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-10-26 03:25:21,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:21,629 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-10-26 03:25:21,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:21,666 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-10-26 03:25:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-26 03:25:21,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:25:21,845 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-10-26 03:25:24,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:24,382 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-10-26 03:25:24,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:24,386 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-10-26 03:25:24,389 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-10-26 03:25:24,391 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-10-26 03:25:24,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:24,408 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-10-26 03:25:24,410 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:25:24,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:24,412 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-10-26 03:25:26,812 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-10-26 03:25:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:25:26,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229015227] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:25:26,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:25:26,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 16] total 51 [2024-10-26 03:25:26,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113854093] [2024-10-26 03:25:26,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:25:26,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 03:25:26,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:25:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 03:25:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2283, Unknown=62, NotChecked=98, Total=2652 [2024-10-26 03:25:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:25:26,865 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:25:26,865 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-10-26 03:25:26,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:26,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:26,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:25:26,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:25:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:25:33,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-10-26 03:25:33,421 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,SelfDestructingSolverStorable39 [2024-10-26 03:25:33,421 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-10-26 03:25:33,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:25:33,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1566232237, now seen corresponding path program 4 times [2024-10-26 03:25:33,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:25:33,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671709901] [2024-10-26 03:25:33,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:25:33,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:25:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:25:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:25:34,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:25:34,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671709901] [2024-10-26 03:25:34,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671709901] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:25:34,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292858751] [2024-10-26 03:25:34,371 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-26 03:25:34,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:25:34,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:25:34,374 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-10-26 03:25:34,376 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-10-26 03:25:39,754 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-26 03:25:39,754 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:25:39,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-10-26 03:25:39,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:25:39,855 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-10-26 03:25:39,942 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-26 03:25:39,943 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-10-26 03:25:40,553 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-10-26 03:25:40,695 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-10-26 03:25:40,707 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-10-26 03:25:40,715 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-10-26 03:25:40,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-26 03:25:40,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 16 treesize of output 11 [2024-10-26 03:25:40,808 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-10-26 03:25:40,822 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-10-26 03:25:40,828 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-10-26 03:25:40,901 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-26 03:25:40,901 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-10-26 03:25:41,017 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-10-26 03:25:41,044 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-10-26 03:25:41,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:41,076 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-10-26 03:25:41,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:41,112 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-10-26 03:25:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-26 03:25:41,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:25:41,165 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-10-26 03:25:41,171 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7306 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_init_#in~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-10-26 03:25:41,176 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7306 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of2ForFork2_~p~1#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-10-26 03:25:41,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:25:41,480 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-10-26 03:25:41,483 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-10-26 03:25:41,487 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-10-26 03:25:41,490 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-10-26 03:25:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:25:44,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292858751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:25:44,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:25:44,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 26, 16] total 52 [2024-10-26 03:25:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815316598] [2024-10-26 03:25:44,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:25:44,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-26 03:25:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:25:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-26 03:25:44,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2196, Unknown=18, NotChecked=294, Total=2756 [2024-10-26 03:25:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:25:44,612 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:25:44,612 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-10-26 03:25:44,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:44,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:44,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:44,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:44,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:44,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:44,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:25:44,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:44,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:25:44,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:44,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:25:44,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:25:44,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:25:44,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:25:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:25:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:25:58,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-10-26 03:25:58,719 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,SelfDestructingSolverStorable40 [2024-10-26 03:25:58,719 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-10-26 03:25:58,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:25:58,720 INFO L85 PathProgramCache]: Analyzing trace with hash 667505584, now seen corresponding path program 1 times [2024-10-26 03:25:58,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:25:58,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215994848] [2024-10-26 03:25:58,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:25:58,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:25:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:25:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-26 03:25:59,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:25:59,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215994848] [2024-10-26 03:25:59,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215994848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-26 03:25:59,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-26 03:25:59,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-26 03:25:59,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902751476] [2024-10-26 03:25:59,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-26 03:25:59,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-26 03:25:59,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:25:59,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-26 03:25:59,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-26 03:25:59,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:25:59,592 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:25:59,593 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-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:25:59,593 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:26:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:26:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:26:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:03,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-26 03:26:03,949 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-10-26 03:26:03,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:26:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1370923417, now seen corresponding path program 1 times [2024-10-26 03:26:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:26:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008751146] [2024-10-26 03:26:03,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:26:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:26:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:26:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-26 03:26:05,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:26:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008751146] [2024-10-26 03:26:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008751146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:26:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275569411] [2024-10-26 03:26:05,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:26:05,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:26:05,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:26:05,286 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-10-26 03:26:05,287 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-10-26 03:26:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:26:05,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-26 03:26:05,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:26:06,589 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-10-26 03:26:06,655 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-10-26 03:26:06,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:06,724 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-10-26 03:26:07,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:07,238 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-10-26 03:26:07,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:07,323 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-10-26 03:26:07,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:07,347 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-10-26 03:26:07,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:07,366 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-10-26 03:26:07,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:07,388 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-10-26 03:26:07,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:07,404 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-10-26 03:26:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-26 03:26:07,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:26:07,463 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))) (= (select (select (store |c_#race| |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))) (= (select (select (store |c_#race| |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|)) (forall ((v_ArrVal_7871 (Array Int Int))) (= (select (select (store |c_#race| |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|)))) is different from false [2024-10-26 03:26:07,692 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)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_50|) (forall ((v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (= (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|)))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int)) (or (forall ((v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (= (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_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_50|))) (forall ((|v_t1_funThread2of2ForFork2_init_~p#1.base_50| Int)) (or (< |c_t1_funThread2of2ForFork2_init_#in~p#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_50|) (forall ((v_ArrVal_7871 (Array Int Int)) (v_ArrVal_7867 (Array Int Int))) (= (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|)))))) is different from false [2024-10-26 03:26:07,957 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 (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_50|) (= (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|))) (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_t1_funThread2of2ForFork2_#t~malloc16#1.base| |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 (< |c_t1_funThread2of2ForFork2_#t~malloc16#1.base| |v_t1_funThread2of2ForFork2_init_~p#1.base_50|) (= (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|))))) is different from false [2024-10-26 03:26:07,993 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-10-26 03:26:08,291 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-10-26 03:26:08,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:08,314 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-10-26 03:26:08,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:08,329 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-10-26 03:26:08,336 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-10-26 03:26:08,342 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-10-26 03:26:08,367 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-10-26 03:26:08,367 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-10-26 03:26:08,376 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-10-26 03:26:08,376 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-10-26 03:26:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 4 refuted. 2 times theorem prover too weak. 9 trivial. 2 not checked. [2024-10-26 03:26:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275569411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:26:09,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:26:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 42 [2024-10-26 03:26:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759013583] [2024-10-26 03:26:09,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:26:09,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-26 03:26:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:26:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-26 03:26:09,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1130, Unknown=42, NotChecked=370, Total=1722 [2024-10-26 03:26:09,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:09,268 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:26:09,268 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-10-26 03:26:09,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:09,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:09,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:09,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:09,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:26:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:26:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:26:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:26:17,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-26 03:26:17,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:26:17,605 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-10-26 03:26:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:26:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash -450936446, now seen corresponding path program 2 times [2024-10-26 03:26:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:26:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468968611] [2024-10-26 03:26:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:26:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:26:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:26:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-26 03:26:19,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:26:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468968611] [2024-10-26 03:26:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468968611] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:26:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030174308] [2024-10-26 03:26:19,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:26:19,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:26:19,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:26:19,212 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-10-26 03:26:19,213 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-10-26 03:26:20,207 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:26:20,207 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:26:20,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-26 03:26:20,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:26:21,623 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-10-26 03:26:21,704 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-10-26 03:26:21,786 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-10-26 03:26:21,889 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-10-26 03:26:21,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:21,989 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-10-26 03:26:22,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:22,117 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-10-26 03:26:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-26 03:26:22,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:26:22,463 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-10-26 03:26:22,494 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-10-26 03:26:22,530 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-10-26 03:26:22,569 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-10-26 03:26:22,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:22,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 1 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 66 [2024-10-26 03:26:22,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:22,607 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-10-26 03:26:22,614 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-10-26 03:26:22,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:22,807 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-10-26 03:26:22,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:22,866 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-10-26 03:26:22,876 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:22,907 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:26:22,907 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-10-26 03:26:22,923 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-10-26 03:26:22,937 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-10-26 03:26:22,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:22,999 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-10-26 03:26:23,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:23,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:26:23,035 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-10-26 03:26:23,049 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-10-26 03:26:23,057 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-10-26 03:26:23,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:23,098 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-10-26 03:26:23,104 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:23,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:26:23,132 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-10-26 03:26:23,147 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-10-26 03:26:23,160 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-10-26 03:26:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 11 trivial. 2 not checked. [2024-10-26 03:26:26,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030174308] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:26:26,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:26:26,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 48 [2024-10-26 03:26:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176048189] [2024-10-26 03:26:26,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:26:26,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-26 03:26:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:26:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-26 03:26:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1829, Unknown=4, NotChecked=356, Total=2352 [2024-10-26 03:26:26,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:26,687 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:26:26,688 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-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:26:26,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:26:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:26:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:26:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:26:35,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:26:35,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-26 03:26:35,484 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,SelfDestructingSolverStorable43 [2024-10-26 03:26:35,485 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-10-26 03:26:35,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:26:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash -563789626, now seen corresponding path program 1 times [2024-10-26 03:26:35,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:26:35,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624603629] [2024-10-26 03:26:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:26:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:26:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:26:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:26:36,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:26:36,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624603629] [2024-10-26 03:26:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624603629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:26:36,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390253567] [2024-10-26 03:26:36,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:26:36,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:26:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:26:36,309 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-10-26 03:26:36,310 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-10-26 03:26:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:26:36,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-26 03:26:36,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:26:37,397 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-10-26 03:26:37,459 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-10-26 03:26:37,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:37,524 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-10-26 03:26:37,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:37,607 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-10-26 03:26:37,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:37,836 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-10-26 03:26:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-26 03:26:37,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:26:37,886 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-10-26 03:26:38,134 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-10-26 03:26:38,155 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-10-26 03:26:38,177 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-10-26 03:26:38,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:38,199 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-10-26 03:26:38,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:38,205 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-10-26 03:26:38,214 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:26:38,214 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-10-26 03:26:38,220 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:26:38,220 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-10-26 03:26:38,227 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:26:38,227 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-10-26 03:26:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-26 03:26:38,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390253567] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:26:38,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:26:38,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-10-26 03:26:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899596277] [2024-10-26 03:26:38,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:26:38,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-26 03:26:38,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:26:38,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-26 03:26:38,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=710, Unknown=4, NotChecked=228, Total=1056 [2024-10-26 03:26:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:38,870 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:26:38,870 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-10-26 03:26:38,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:38,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:26:38,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:26:43,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:26:43,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-10-26 03:26:43,709 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,SelfDestructingSolverStorable44 [2024-10-26 03:26:43,709 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-10-26 03:26:43,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:26:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2137678278, now seen corresponding path program 1 times [2024-10-26 03:26:43,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:26:43,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323253462] [2024-10-26 03:26:43,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:26:43,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:26:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:26:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:26:45,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:26:45,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323253462] [2024-10-26 03:26:45,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323253462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:26:45,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340375025] [2024-10-26 03:26:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:26:45,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:26:45,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:26:45,686 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-10-26 03:26:45,687 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-10-26 03:26:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:26:46,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-26 03:26:46,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:26:47,496 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-10-26 03:26:47,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 23 treesize of output 22 [2024-10-26 03:26:47,681 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-10-26 03:26:47,788 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-10-26 03:26:48,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:48,147 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-10-26 03:26:48,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:48,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 45 treesize of output 34 [2024-10-26 03:26:48,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:48,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 45 treesize of output 34 [2024-10-26 03:26:48,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:48,274 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-10-26 03:26:48,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:48,587 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-10-26 03:26:48,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:48,617 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-10-26 03:26:48,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:48,661 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-10-26 03:26:48,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:48,702 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-10-26 03:26:49,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:49,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:49,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:49,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:26:49,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:49,422 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-10-26 03:26:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:26:49,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:26:53,987 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-10-26 03:26:55,698 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-10-26 03:26:55,781 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-10-26 03:26:55,873 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-10-26 03:26:55,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:55,907 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-10-26 03:26:55,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:55,923 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-10-26 03:26:55,934 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-10-26 03:26:56,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:56,070 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-10-26 03:26:56,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:56,112 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-10-26 03:26:56,117 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:56,134 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:26:56,135 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-10-26 03:26:56,145 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-10-26 03:26:56,153 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-10-26 03:26:56,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:26:56,222 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-10-26 03:26:56,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:26:56,245 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:26:56,245 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-10-26 03:26:56,256 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-10-26 03:26:56,264 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-10-26 03:26:56,301 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-26 03:26:56,301 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-10-26 03:26:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-10-26 03:26:57,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340375025] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:26:57,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:26:57,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2024-10-26 03:26:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344966746] [2024-10-26 03:26:57,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:26:57,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 03:26:57,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:26:57,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 03:26:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2065, Unknown=4, NotChecked=380, Total=2652 [2024-10-26 03:26:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:26:57,678 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:26:57,678 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-10-26 03:26:57,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:57,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:57,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:26:57,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:27:07,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:07,848 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-10-26 03:27:08,034 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,SelfDestructingSolverStorable45 [2024-10-26 03:27:08,034 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-10-26 03:27:08,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:27:08,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1484622955, now seen corresponding path program 1 times [2024-10-26 03:27:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:27:08,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049860811] [2024-10-26 03:27:08,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:27:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:27:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:27:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:27:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:27:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049860811] [2024-10-26 03:27:10,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049860811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:27:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327749390] [2024-10-26 03:27:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:27:10,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:27:10,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:27:10,978 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-10-26 03:27:10,979 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-10-26 03:27:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:27:11,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-26 03:27:11,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:27:11,540 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-10-26 03:27:11,988 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:27:11,989 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-10-26 03:27:12,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:12,204 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-10-26 03:27:12,366 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:27:12,366 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-10-26 03:27:12,778 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-10-26 03:27:12,851 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-10-26 03:27:12,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:12,934 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-10-26 03:27:13,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:13,028 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-10-26 03:27:13,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:13,279 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-10-26 03:27:13,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:13,313 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-10-26 03:27:13,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:13,337 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-10-26 03:27:13,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:13,368 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-10-26 03:27:13,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:13,605 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-10-26 03:27:13,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:13,632 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-10-26 03:27:13,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:13,674 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-10-26 03:27:13,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:13,701 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-10-26 03:27:13,866 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:27:13,866 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-10-26 03:27:14,256 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-10-26 03:27:14,279 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-10-26 03:27:14,302 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-10-26 03:27:14,325 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-10-26 03:27:14,411 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-10-26 03:27:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:27:14,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:27:14,455 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-10-26 03:27:14,606 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-10-26 03:27:14,639 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-10-26 03:27:14,682 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-10-26 03:27:16,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:16,652 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-10-26 03:27:16,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:16,670 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-10-26 03:27:16,680 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-10-26 03:27:16,686 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-10-26 03:27:16,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:16,752 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-10-26 03:27:16,757 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:27:16,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:16,767 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-10-26 03:27:16,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:16,805 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-10-26 03:27:16,810 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:27:16,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:16,818 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-10-26 03:27:16,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:16,862 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-10-26 03:27:16,868 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:27:16,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:16,877 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-10-26 03:27:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:27:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327749390] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:27:20,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:27:20,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 50 [2024-10-26 03:27:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485359041] [2024-10-26 03:27:20,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:27:20,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-26 03:27:20,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:27:20,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-26 03:27:20,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1969, Unknown=22, NotChecked=372, Total=2550 [2024-10-26 03:27:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:20,083 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:27:20,083 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-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:20,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:20,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:27:20,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:27:20,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:27:20,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:20,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:27:20,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:27:20,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:20,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:20,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:27:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:27:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:27:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:27:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:27:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:31,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-10-26 03:27:31,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:27:31,187 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-10-26 03:27:31,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:27:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1133528088, now seen corresponding path program 2 times [2024-10-26 03:27:31,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:27:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331219571] [2024-10-26 03:27:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:27:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:27:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:27:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:27:33,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:27:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331219571] [2024-10-26 03:27:33,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331219571] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:27:33,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633251753] [2024-10-26 03:27:33,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:27:33,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:27:33,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:27:33,172 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-10-26 03:27:33,173 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-10-26 03:27:34,221 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:27:34,221 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:27:34,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-26 03:27:34,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:27:35,520 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-10-26 03:27:35,599 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-10-26 03:27:35,693 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-10-26 03:27:35,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:35,973 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-10-26 03:27:36,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,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 36 treesize of output 27 [2024-10-26 03:27:36,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,032 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-10-26 03:27:36,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,063 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-10-26 03:27:36,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,315 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-10-26 03:27:36,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,344 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-10-26 03:27:36,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,373 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-10-26 03:27:36,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,402 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-10-26 03:27:36,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:27:36,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:36,993 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-10-26 03:27:37,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:37,077 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-10-26 03:27:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:27:37,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:27:40,188 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-10-26 03:27:43,449 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-10-26 03:27:43,509 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-10-26 03:27:43,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:43,536 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-10-26 03:27:43,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:43,552 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-10-26 03:27:43,563 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-10-26 03:27:43,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:43,687 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-10-26 03:27:43,712 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-10-26 03:27:43,713 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-10-26 03:27:43,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:27:43,731 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-10-26 03:27:43,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:27:43,757 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:27:43,757 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-10-26 03:27:43,767 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-10-26 03:27:43,776 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-10-26 03:27:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-10-26 03:27:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633251753] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:27:45,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:27:45,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2024-10-26 03:27:45,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532413710] [2024-10-26 03:27:45,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:27:45,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-26 03:27:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:27:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-26 03:27:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2157, Unknown=3, NotChecked=288, Total=2652 [2024-10-26 03:27:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:45,069 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:27:45,070 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-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:27:45,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:27:45,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:45,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:45,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:45,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:27:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:27:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:27:55,165 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-10-26 03:27:55,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:27:55,349 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-10-26 03:27:55,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:27:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -260897981, now seen corresponding path program 2 times [2024-10-26 03:27:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:27:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409532888] [2024-10-26 03:27:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:27:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:27:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:27:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:27:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:27:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409532888] [2024-10-26 03:27:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409532888] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:27:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459817455] [2024-10-26 03:27:58,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-26 03:27:58,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:27:58,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:27:58,455 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-10-26 03:27:58,455 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-10-26 03:27:59,562 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-26 03:27:59,562 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:27:59,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-26 03:27:59,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:27:59,582 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-10-26 03:27:59,976 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:27:59,976 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-10-26 03:28:00,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:00,256 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-10-26 03:28:00,442 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:28:00,442 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-10-26 03:28:01,050 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-10-26 03:28:01,128 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-10-26 03:28:01,220 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-10-26 03:28:01,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:01,456 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-10-26 03:28:01,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:01,491 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-10-26 03:28:01,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:01,510 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-10-26 03:28:01,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:01,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 36 treesize of output 27 [2024-10-26 03:28:01,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:01,749 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-10-26 03:28:01,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:01,778 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-10-26 03:28:01,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:01,804 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-10-26 03:28:01,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:28:01,830 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-10-26 03:28:01,989 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:28:01,990 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-10-26 03:28:02,448 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-10-26 03:28:02,471 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-10-26 03:28:02,584 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-10-26 03:28:02,696 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-10-26 03:28:02,831 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-10-26 03:28:02,974 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-10-26 03:28:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:28:11,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:28:13,484 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-10-26 03:28:13,649 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-10-26 03:28:13,804 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-10-26 03:28:13,957 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-10-26 03:28:21,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:21,473 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-10-26 03:28:21,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:21,482 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-10-26 03:28:21,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:21,560 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-10-26 03:28:21,570 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-10-26 03:28:21,576 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-10-26 03:28:21,593 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-10-26 03:28:21,608 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-10-26 03:28:21,688 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:28:21,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:21,712 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-10-26 03:28:21,717 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:28:21,721 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-10-26 03:28:21,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:28:21,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:28:21,751 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-10-26 03:28:21,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:28:21,757 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-10-26 03:28:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:28:25,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459817455] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:28:25,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:28:25,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 23] total 60 [2024-10-26 03:28:25,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989680535] [2024-10-26 03:28:25,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:28:25,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-10-26 03:28:25,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:28:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-10-26 03:28:25,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2962, Unknown=20, NotChecked=452, Total=3660 [2024-10-26 03:28:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:28:25,476 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:28:25,477 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-10-26 03:28:25,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:25,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:25,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:28:25,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:28:25,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:28:25,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:28:25,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:28:25,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:28:25,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:28:25,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:25,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:28:25,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:28:25,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:28:33,263 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-10-26 03:28:37,464 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-10-26 03:28:39,490 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-10-26 03:28:50,349 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-10-26 03:28:52,354 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-10-26 03:28:54,364 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-10-26 03:28:56,368 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-10-26 03:28:58,373 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-10-26 03:29:00,376 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-10-26 03:29:02,412 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-10-26 03:29:04,486 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-10-26 03:29:06,518 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-10-26 03:29:08,582 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-10-26 03:29:10,647 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-10-26 03:29:12,706 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-10-26 03:29:14,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-10-26 03:29:16,803 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-10-26 03:29:18,846 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-10-26 03:29:20,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-10-26 03:29:22,882 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-10-26 03:29:24,916 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-10-26 03:29:29,203 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-10-26 03:29:33,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-10-26 03:29:37,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-10-26 03:29:41,992 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-10-26 03:29:44,011 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-10-26 03:29:48,249 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-10-26 03:29:50,263 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-10-26 03:29:52,308 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-10-26 03:29:56,439 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-10-26 03:30:00,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-10-26 03:30:02,959 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-10-26 03:30:22,095 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-10-26 03:30:24,117 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-10-26 03:30:26,129 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-10-26 03:30:28,147 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-10-26 03:30:30,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-10-26 03:30:32,176 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-10-26 03:30:34,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-10-26 03:30:36,253 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-10-26 03:30:38,279 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-10-26 03:30:40,300 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-10-26 03:30:42,315 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-10-26 03:30:44,345 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-10-26 03:30:46,359 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-10-26 03:30:48,364 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-10-26 03:30:50,371 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-10-26 03:30:52,389 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-10-26 03:30:54,408 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-10-26 03:30:56,429 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-10-26 03:30:58,453 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-10-26 03:31:00,465 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-10-26 03:31:02,471 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-10-26 03:31:04,477 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-10-26 03:31:06,487 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-10-26 03:31:10,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-10-26 03:31:14,630 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-10-26 03:31:16,635 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-10-26 03:31:18,638 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-10-26 03:31:20,642 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-10-26 03:31:22,650 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-10-26 03:31:24,654 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-10-26 03:31:26,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-10-26 03:31:28,662 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-10-26 03:31:30,669 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-10-26 03:31:32,672 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-10-26 03:31:34,677 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-10-26 03:31:36,681 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-10-26 03:31:38,685 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-10-26 03:31:40,690 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-10-26 03:31:42,694 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-10-26 03:31:44,699 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-10-26 03:31:46,707 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-10-26 03:31:48,711 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-10-26 03:31:50,718 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-10-26 03:31:52,726 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-10-26 03:31:54,740 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-10-26 03:31:56,761 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-10-26 03:31:58,806 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-10-26 03:32:00,826 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-10-26 03:32:02,840 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-10-26 03:32:04,861 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-10-26 03:32:06,883 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-10-26 03:32:08,907 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-10-26 03:32:10,922 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-10-26 03:32:12,943 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-10-26 03:32:14,968 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-10-26 03:32:16,992 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-10-26 03:32:19,023 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-10-26 03:32:22,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-10-26 03:32:27,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-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:32:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:32:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:32:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:32:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:32:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:32:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:32:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:32:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:32:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:32:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-26 03:32:27,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2024-10-26 03:32:27,319 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,SelfDestructingSolverStorable48 [2024-10-26 03:32:27,320 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-10-26 03:32:27,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:32:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2005304518, now seen corresponding path program 3 times [2024-10-26 03:32:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:32:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274281398] [2024-10-26 03:32:27,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:32:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:32:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:32:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274281398] [2024-10-26 03:32:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274281398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:32:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215274324] [2024-10-26 03:32:28,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 03:32:28,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:28,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:32:28,992 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-10-26 03:32:28,993 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-10-26 03:32:31,128 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 03:32:31,128 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:32:31,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-26 03:32:31,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:32:32,744 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-10-26 03:32:32,830 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-10-26 03:32:33,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:33,199 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-10-26 03:32:33,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:33,220 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-10-26 03:32:33,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:33,238 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-10-26 03:32:33,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:33,256 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-10-26 03:32:33,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:33,416 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-10-26 03:32:33,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:33,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 23 treesize of output 16 [2024-10-26 03:32:33,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:33,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 23 treesize of output 16 [2024-10-26 03:32:33,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:32:33,483 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-10-26 03:32:33,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:33,734 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-10-26 03:32:33,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:33,754 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-10-26 03:32:33,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:33,776 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-10-26 03:32:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-26 03:32:33,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:32:34,961 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-10-26 03:32:35,331 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-10-26 03:32:35,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:35,349 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-10-26 03:32:35,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:35,364 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-10-26 03:32:35,373 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-10-26 03:32:35,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:35,548 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-10-26 03:32:35,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:32:35,570 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-10-26 03:32:35,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:32:35,586 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:32:35,587 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-10-26 03:32:35,596 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-10-26 03:32:35,623 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-26 03:32:35,623 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-10-26 03:32:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 22 not checked. [2024-10-26 03:32:37,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215274324] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:32:37,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:32:37,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 18] total 48 [2024-10-26 03:32:37,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842821813] [2024-10-26 03:32:37,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:32:37,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-26 03:32:37,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:32:37,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-26 03:32:37,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1974, Unknown=2, NotChecked=182, Total=2352 [2024-10-26 03:32:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:37,391 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:32:37,392 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-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:32:37,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:32:37,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:32:37,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-26 03:32:37,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:32:50,947 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-10-26 03:32:52,998 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-10-26 03:32:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:32:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:32:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-26 03:32:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:32:53,037 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-10-26 03:32:53,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-10-26 03:32:53,219 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-10-26 03:32:53,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-26 03:32:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash 809062549, now seen corresponding path program 3 times [2024-10-26 03:32:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-26 03:32:53,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522380459] [2024-10-26 03:32:53,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-26 03:32:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-26 03:32:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-26 03:32:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-26 03:32:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-26 03:32:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522380459] [2024-10-26 03:32:55,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522380459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-26 03:32:55,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20891350] [2024-10-26 03:32:55,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-26 03:32:55,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-26 03:32:55,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-26 03:32:55,910 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-10-26 03:32:55,910 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-10-26 03:33:00,263 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-26 03:33:00,263 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-26 03:33:00,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-26 03:33:00,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-26 03:33:00,289 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-10-26 03:33:00,710 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-26 03:33:00,710 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-10-26 03:33:01,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:01,029 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-10-26 03:33:01,248 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-26 03:33:01,249 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-10-26 03:33:02,076 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-10-26 03:33:02,162 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-10-26 03:33:02,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:02,420 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-10-26 03:33:02,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:02,453 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-10-26 03:33:02,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:02,478 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-10-26 03:33:02,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:02,504 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-10-26 03:33:02,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:02,715 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-10-26 03:33:02,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:02,741 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-10-26 03:33:02,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:02,757 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-10-26 03:33:02,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-26 03:33:02,784 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-10-26 03:33:02,947 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-26 03:33:02,948 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-10-26 03:33:03,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 27 treesize of output 20 [2024-10-26 03:33:03,459 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-10-26 03:33:03,579 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-10-26 03:33:03,706 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-10-26 03:33:03,857 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-10-26 03:33:04,016 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-10-26 03:33:04,164 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-10-26 03:33:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:33:08,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-26 03:33:11,711 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-10-26 03:33:11,880 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-10-26 03:33:12,058 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-10-26 03:33:12,285 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-10-26 03:33:17,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:17,013 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-10-26 03:33:17,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:17,026 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-10-26 03:33:17,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:17,113 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-10-26 03:33:17,122 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-10-26 03:33:17,129 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-10-26 03:33:17,148 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-10-26 03:33:17,168 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-10-26 03:33:17,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:33:17,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-26 03:33:17,245 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-10-26 03:33:17,249 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:33:17,252 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-10-26 03:33:17,264 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-26 03:33:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-26 03:33:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20891350] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-26 03:33:25,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-26 03:33:25,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 23] total 60 [2024-10-26 03:33:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786664711] [2024-10-26 03:33:25,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-26 03:33:25,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-10-26 03:33:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-26 03:33:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-10-26 03:33:25,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2953, Unknown=12, NotChecked=452, Total=3660 [2024-10-26 03:33:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:25,064 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-26 03:33:25,064 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-10-26 03:33:25,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:25,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:25,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:33:25,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:25,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:25,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:25,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-26 03:33:25,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-26 03:33:25,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-26 03:33:33,985 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-10-26 03:33:38,240 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-10-26 03:33:48,630 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-10-26 03:33:50,814 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-10-26 03:33:52,957 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-10-26 03:33:55,136 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-10-26 03:33:57,183 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-10-26 03:33:59,275 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-10-26 03:34:03,134 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-10-26 03:34:07,326 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-10-26 03:34:11,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-10-26 03:34:13,739 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-10-26 03:34:15,838 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-10-26 03:34:18,224 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-10-26 03:34:20,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-10-26 03:34:22,398 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-10-26 03:34:24,493 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-10-26 03:34:26,513 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-10-26 03:34:28,963 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-10-26 03:34:30,983 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-10-26 03:34:33,072 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-10-26 03:34:35,092 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-10-26 03:34:37,106 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-10-26 03:34:39,167 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-10-26 03:34:41,282 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-10-26 03:34:43,376 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-10-26 03:34:45,483 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-10-26 03:34:47,604 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-10-26 03:34:49,681 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-10-26 03:34:52,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-10-26 03:34:54,065 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-10-26 03:34:56,107 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-10-26 03:34:58,838 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-10-26 03:35:00,888 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-10-26 03:35:11,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-10-26 03:35:13,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-10-26 03:35:15,630 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-10-26 03:35:17,642 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-10-26 03:35:19,651 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-10-26 03:35:27,841 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-10-26 03:35:34,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-10-26 03:35:36,027 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-10-26 03:35:38,031 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-10-26 03:35:40,039 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-10-26 03:35:42,043 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-10-26 03:35:44,048 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