./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 20:18:20,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 20:18:20,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 20:18:20,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 20:18:20,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 20:18:20,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 20:18:20,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 20:18:20,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 20:18:20,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 20:18:20,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 20:18:20,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 20:18:20,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 20:18:20,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 20:18:20,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 20:18:20,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 20:18:20,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 20:18:20,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 20:18:20,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 20:18:20,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 20:18:20,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 20:18:20,540 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 20:18:20,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 20:18:20,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 20:18:20,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 20:18:20,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 20:18:20,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 20:18:20,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 20:18:20,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 20:18:20,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 20:18:20,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 20:18:20,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 20:18:20,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 20:18:20,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 20:18:20,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 20:18:20,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 20:18:20,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 20:18:20,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 20:18:20,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 20:18:20,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 20:18:20,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 20:18:20,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 20:18:20,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 20:18:20,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-04-18 20:18:20,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 20:18:20,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 20:18:20,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 20:18:20,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 20:18:20,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 20:18:20,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 20:18:20,584 INFO L138 SettingsManager]: * User list type=DISABLED [2022-04-18 20:18:20,584 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-04-18 20:18:20,584 INFO L138 SettingsManager]: * Explicit value domain=true [2022-04-18 20:18:20,585 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-04-18 20:18:20,585 INFO L138 SettingsManager]: * Octagon Domain=false [2022-04-18 20:18:20,585 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-04-18 20:18:20,586 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-04-18 20:18:20,586 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-04-18 20:18:20,586 INFO L138 SettingsManager]: * Interval Domain=false [2022-04-18 20:18:20,586 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-04-18 20:18:20,588 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-04-18 20:18:20,588 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-04-18 20:18:20,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 20:18:20,589 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 20:18:20,589 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 20:18:20,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 20:18:20,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 20:18:20,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 20:18:20,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 20:18:20,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 20:18:20,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 20:18:20,591 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 20:18:20,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 20:18:20,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 20:18:20,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 20:18:20,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 20:18:20,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 20:18:20,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 20:18:20,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:18:20,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 20:18:20,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 20:18:20,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 20:18:20,593 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-04-18 20:18:20,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 20:18:20,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 20:18:20,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-18 20:18:20,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-18 20:18:20,594 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/UTaipan-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/UTaipan-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 [2022-04-18 20:18:20,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 20:18:20,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 20:18:20,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 20:18:20,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 20:18:20,832 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 20:18:20,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2022-04-18 20:18:20,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3b85fa6d5/b439c34a67bc4271b5754cb2f6b621ac/FLAGbb4548031 [2022-04-18 20:18:21,242 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 20:18:21,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2022-04-18 20:18:21,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3b85fa6d5/b439c34a67bc4271b5754cb2f6b621ac/FLAGbb4548031 [2022-04-18 20:18:21,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/3b85fa6d5/b439c34a67bc4271b5754cb2f6b621ac [2022-04-18 20:18:21,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 20:18:21,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 20:18:21,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 20:18:21,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 20:18:21,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 20:18:21,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:18:21" (1/1) ... [2022-04-18 20:18:21,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a7fcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:21, skipping insertion in model container [2022-04-18 20:18:21,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 08:18:21" (1/1) ... [2022-04-18 20:18:21,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 20:18:21,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 20:18:21,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-04-18 20:18:21,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:18:21,996 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 20:18:22,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-04-18 20:18:22,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 20:18:22,049 INFO L208 MainTranslator]: Completed translation [2022-04-18 20:18:22,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22 WrapperNode [2022-04-18 20:18:22,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 20:18:22,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 20:18:22,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 20:18:22,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 20:18:22,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,109 INFO L137 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 341 [2022-04-18 20:18:22,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 20:18:22,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 20:18:22,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 20:18:22,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 20:18:22,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 20:18:22,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 20:18:22,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 20:18:22,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 20:18:22,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (1/1) ... [2022-04-18 20:18:22,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 20:18:22,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:18:22,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 20:18:22,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 20:18:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 20:18:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-18 20:18:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 20:18:22,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 20:18:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 20:18:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-18 20:18:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 20:18:22,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 20:18:22,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 20:18:22,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 20:18:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 20:18:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-18 20:18:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 20:18:22,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 20:18:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 20:18:22,278 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 20:18:22,388 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 20:18:22,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 20:18:23,027 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 20:18:23,039 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 20:18:23,040 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-04-18 20:18:23,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:18:23 BoogieIcfgContainer [2022-04-18 20:18:23,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 20:18:23,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 20:18:23,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 20:18:23,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 20:18:23,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 08:18:21" (1/3) ... [2022-04-18 20:18:23,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a865f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:18:23, skipping insertion in model container [2022-04-18 20:18:23,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 08:18:22" (2/3) ... [2022-04-18 20:18:23,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a865f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 08:18:23, skipping insertion in model container [2022-04-18 20:18:23,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 08:18:23" (3/3) ... [2022-04-18 20:18:23,050 INFO L111 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2022-04-18 20:18:23,054 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 20:18:23,054 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 20:18:23,054 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-04-18 20:18:23,055 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 20:18:23,170 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-04-18 20:18:23,205 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 20:18:23,210 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 [2022-04-18 20:18:23,210 INFO L341 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-04-18 20:18:23,229 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-04-18 20:18:23,238 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 516 places, 539 transitions, 1094 flow [2022-04-18 20:18:23,240 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 516 places, 539 transitions, 1094 flow [2022-04-18 20:18:23,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 516 places, 539 transitions, 1094 flow [2022-04-18 20:18:23,381 INFO L129 PetriNetUnfolder]: 30/537 cut-off events. [2022-04-18 20:18:23,381 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-04-18 20:18:23,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 537 events. 30/537 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 816 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 343. Up to 2 conditions per place. [2022-04-18 20:18:23,400 INFO L116 LiptonReduction]: Number of co-enabled transitions 6986 [2022-04-18 20:19:15,778 INFO L131 LiptonReduction]: Checked pairs total: 47990 [2022-04-18 20:19:15,778 INFO L133 LiptonReduction]: Total number of compositions: 679 [2022-04-18 20:19:15,786 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 123 places, 123 transitions, 262 flow [2022-04-18 20:19:15,957 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4961 states, 4803 states have (on average 2.936706225275869) internal successors, (14105), 4960 states have internal predecessors, (14105), 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) [2022-04-18 20:19:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 4961 states, 4803 states have (on average 2.936706225275869) internal successors, (14105), 4960 states have internal predecessors, (14105), 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) [2022-04-18 20:19:15,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-04-18 20:19:15,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:15,980 INFO L499 BasicCegarLoop]: trace histogram [1] [2022-04-18 20:19:15,981 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:15,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1951, now seen corresponding path program 1 times [2022-04-18 20:19:15,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:15,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581630839] [2022-04-18 20:19:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:19:16,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:16,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581630839] [2022-04-18 20:19:16,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581630839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:16,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:16,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-04-18 20:19:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671765877] [2022-04-18 20:19:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:16,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 20:19:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:16,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 20:19:16,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 20:19:16,138 INFO L87 Difference]: Start difference. First operand has 4961 states, 4803 states have (on average 2.936706225275869) internal successors, (14105), 4960 states have internal predecessors, (14105), 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) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-04-18 20:19:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:16,340 INFO L93 Difference]: Finished difference Result 3497 states and 9991 transitions. [2022-04-18 20:19:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 20:19:16,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) Word has length 1 [2022-04-18 20:19:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:16,376 INFO L225 Difference]: With dead ends: 3497 [2022-04-18 20:19:16,377 INFO L226 Difference]: Without dead ends: 3495 [2022-04-18 20:19:16,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 20:19:16,380 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:16,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-18 20:19:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2022-04-18 20:19:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2022-04-18 20:19:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 3468 states have (on average 2.8800461361014995) internal successors, (9988), 3494 states have internal predecessors, (9988), 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) [2022-04-18 20:19:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 9988 transitions. [2022-04-18 20:19:16,602 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 9988 transitions. Word has length 1 [2022-04-18 20:19:16,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:16,603 INFO L478 AbstractCegarLoop]: Abstraction has 3495 states and 9988 transitions. [2022-04-18 20:19:16,603 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-04-18 20:19:16,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 9988 transitions. [2022-04-18 20:19:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-18 20:19:16,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:16,605 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:16,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 20:19:16,606 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:16,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1195690971, now seen corresponding path program 1 times [2022-04-18 20:19:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:16,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742770742] [2022-04-18 20:19:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:16,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:16,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847435470] [2022-04-18 20:19:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:16,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:16,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:16,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-18 20:19:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:16,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-18 20:19:16,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:19:16,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:16,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:16,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742770742] [2022-04-18 20:19:16,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:16,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847435470] [2022-04-18 20:19:16,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847435470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:16,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:16,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-18 20:19:16,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537556525] [2022-04-18 20:19:16,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:16,817 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:19:16,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:16,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:19:16,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 20:19:16,818 INFO L87 Difference]: Start difference. First operand 3495 states and 9988 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-04-18 20:19:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:17,129 INFO L93 Difference]: Finished difference Result 5051 states and 13782 transitions. [2022-04-18 20:19:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:19:17,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2022-04-18 20:19:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:17,159 INFO L225 Difference]: With dead ends: 5051 [2022-04-18 20:19:17,159 INFO L226 Difference]: Without dead ends: 5051 [2022-04-18 20:19:17,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:19:17,162 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 229 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:17,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 192 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:19:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2022-04-18 20:19:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 3889. [2022-04-18 20:19:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3889 states, 3862 states have (on average 2.881149663386846) internal successors, (11127), 3888 states have internal predecessors, (11127), 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) [2022-04-18 20:19:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 11127 transitions. [2022-04-18 20:19:17,415 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 11127 transitions. Word has length 13 [2022-04-18 20:19:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:17,415 INFO L478 AbstractCegarLoop]: Abstraction has 3889 states and 11127 transitions. [2022-04-18 20:19:17,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-04-18 20:19:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 11127 transitions. [2022-04-18 20:19:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-18 20:19:17,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:17,417 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:17,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:17,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:17,618 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:17,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:17,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1753119979, now seen corresponding path program 1 times [2022-04-18 20:19:17,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:17,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786142477] [2022-04-18 20:19:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:17,631 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:17,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614931269] [2022-04-18 20:19:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:17,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:17,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:17,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-18 20:19:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:17,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-18 20:19:17,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:17,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:17,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:19:17,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:17,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 [2022-04-18 20:19:17,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:17,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:17,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:19:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:19:17,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:17,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:17,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786142477] [2022-04-18 20:19:17,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:17,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614931269] [2022-04-18 20:19:17,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614931269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:17,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:17,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:19:17,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053491999] [2022-04-18 20:19:17,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:17,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 20:19:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 20:19:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:19:17,989 INFO L87 Difference]: Start difference. First operand 3889 states and 11127 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-04-18 20:19:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:18,752 INFO L93 Difference]: Finished difference Result 6342 states and 17945 transitions. [2022-04-18 20:19:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:19:18,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 13 [2022-04-18 20:19:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:18,832 INFO L225 Difference]: With dead ends: 6342 [2022-04-18 20:19:18,832 INFO L226 Difference]: Without dead ends: 6342 [2022-04-18 20:19:18,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:19:18,843 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 158 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:18,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 59 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 20:19:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6342 states. [2022-04-18 20:19:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6342 to 5698. [2022-04-18 20:19:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5671 states have (on average 2.9324634103332747) internal successors, (16630), 5697 states have internal predecessors, (16630), 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) [2022-04-18 20:19:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 16630 transitions. [2022-04-18 20:19:19,085 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 16630 transitions. Word has length 13 [2022-04-18 20:19:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:19,086 INFO L478 AbstractCegarLoop]: Abstraction has 5698 states and 16630 transitions. [2022-04-18 20:19:19,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-04-18 20:19:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 16630 transitions. [2022-04-18 20:19:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-18 20:19:19,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:19,088 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:19,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-18 20:19:19,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:19,303 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:19,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1997219299, now seen corresponding path program 1 times [2022-04-18 20:19:19,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:19,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183918157] [2022-04-18 20:19:19,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:19,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:19,320 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:19,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646370687] [2022-04-18 20:19:19,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:19,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:19,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:19,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:19,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-18 20:19:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:19,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-18 20:19:19,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:19,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:19,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-04-18 20:19:19,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,602 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:19,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:19,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:19,655 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:19,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:19:19,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:19,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:19,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183918157] [2022-04-18 20:19:19,691 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:19,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646370687] [2022-04-18 20:19:19,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646370687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:19,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:19,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:19:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19976609] [2022-04-18 20:19:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:19,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-18 20:19:19,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:19,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-18 20:19:19,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-18 20:19:19,693 INFO L87 Difference]: Start difference. First operand 5698 states and 16630 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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) [2022-04-18 20:19:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:20,406 INFO L93 Difference]: Finished difference Result 12121 states and 35429 transitions. [2022-04-18 20:19:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:19:20,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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) Word has length 15 [2022-04-18 20:19:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:20,455 INFO L225 Difference]: With dead ends: 12121 [2022-04-18 20:19:20,455 INFO L226 Difference]: Without dead ends: 12121 [2022-04-18 20:19:20,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:19:20,456 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 296 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:20,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 83 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-18 20:19:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2022-04-18 20:19:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 7693. [2022-04-18 20:19:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7693 states, 7666 states have (on average 2.9744325593529872) internal successors, (22802), 7692 states have internal predecessors, (22802), 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) [2022-04-18 20:19:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7693 states to 7693 states and 22802 transitions. [2022-04-18 20:19:20,728 INFO L78 Accepts]: Start accepts. Automaton has 7693 states and 22802 transitions. Word has length 15 [2022-04-18 20:19:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:20,729 INFO L478 AbstractCegarLoop]: Abstraction has 7693 states and 22802 transitions. [2022-04-18 20:19:20,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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) [2022-04-18 20:19:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 7693 states and 22802 transitions. [2022-04-18 20:19:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-18 20:19:20,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:20,730 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:20,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-18 20:19:20,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:20,954 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1684437764, now seen corresponding path program 1 times [2022-04-18 20:19:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:20,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711650838] [2022-04-18 20:19:20,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:20,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:20,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774337715] [2022-04-18 20:19:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:20,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:20,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:20,967 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:20,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-18 20:19:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:21,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-18 20:19:21,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:19:21,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:21,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:21,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711650838] [2022-04-18 20:19:21,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:21,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774337715] [2022-04-18 20:19:21,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774337715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:21,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:21,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:19:21,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122919606] [2022-04-18 20:19:21,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:21,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:19:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:21,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:19:21,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 20:19:21,108 INFO L87 Difference]: Start difference. First operand 7693 states and 22802 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-04-18 20:19:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:21,383 INFO L93 Difference]: Finished difference Result 8560 states and 24995 transitions. [2022-04-18 20:19:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 20:19:21,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2022-04-18 20:19:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:21,417 INFO L225 Difference]: With dead ends: 8560 [2022-04-18 20:19:21,417 INFO L226 Difference]: Without dead ends: 8558 [2022-04-18 20:19:21,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:19:21,418 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 106 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:21,419 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 176 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:19:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2022-04-18 20:19:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8287. [2022-04-18 20:19:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8287 states, 8260 states have (on average 2.96319612590799) internal successors, (24476), 8286 states have internal predecessors, (24476), 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) [2022-04-18 20:19:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 24476 transitions. [2022-04-18 20:19:21,683 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 24476 transitions. Word has length 15 [2022-04-18 20:19:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:21,684 INFO L478 AbstractCegarLoop]: Abstraction has 8287 states and 24476 transitions. [2022-04-18 20:19:21,684 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-04-18 20:19:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 24476 transitions. [2022-04-18 20:19:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-18 20:19:21,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:21,686 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:21,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:21,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:21,907 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:21,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:21,908 INFO L85 PathProgramCache]: Analyzing trace with hash 864946163, now seen corresponding path program 1 times [2022-04-18 20:19:21,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:21,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063734585] [2022-04-18 20:19:21,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:21,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:21,921 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:21,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048984095] [2022-04-18 20:19:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:21,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:21,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:21,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:21,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-18 20:19:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:22,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-18 20:19:22,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:19:22,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:22,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:22,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063734585] [2022-04-18 20:19:22,163 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:22,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048984095] [2022-04-18 20:19:22,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048984095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:22,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:22,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:19:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687308784] [2022-04-18 20:19:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:22,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:19:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:22,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:19:22,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-18 20:19:22,166 INFO L87 Difference]: Start difference. First operand 8287 states and 24476 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-04-18 20:19:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:22,427 INFO L93 Difference]: Finished difference Result 11641 states and 34100 transitions. [2022-04-18 20:19:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:19:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 17 [2022-04-18 20:19:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:22,472 INFO L225 Difference]: With dead ends: 11641 [2022-04-18 20:19:22,473 INFO L226 Difference]: Without dead ends: 11633 [2022-04-18 20:19:22,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:19:22,474 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 182 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:22,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 233 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:19:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11633 states. [2022-04-18 20:19:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11633 to 9154. [2022-04-18 20:19:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9154 states, 9127 states have (on average 2.9810452503560865) internal successors, (27208), 9153 states have internal predecessors, (27208), 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) [2022-04-18 20:19:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 27208 transitions. [2022-04-18 20:19:22,741 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 27208 transitions. Word has length 17 [2022-04-18 20:19:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:22,742 INFO L478 AbstractCegarLoop]: Abstraction has 9154 states and 27208 transitions. [2022-04-18 20:19:22,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-04-18 20:19:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 27208 transitions. [2022-04-18 20:19:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 20:19:22,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:22,745 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:22,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:22,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:22,959 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:22,960 INFO L85 PathProgramCache]: Analyzing trace with hash 30599181, now seen corresponding path program 1 times [2022-04-18 20:19:22,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:22,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854794958] [2022-04-18 20:19:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:22,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:22,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220064067] [2022-04-18 20:19:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:22,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:22,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:22,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:23,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-18 20:19:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:23,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-18 20:19:23,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:23,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:23,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-04-18 20:19:23,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:23,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:23,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:23,345 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:23,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:19:23,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:19:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:19:23,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:23,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854794958] [2022-04-18 20:19:23,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:23,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220064067] [2022-04-18 20:19:23,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220064067] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-18 20:19:23,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 20:19:23,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2022-04-18 20:19:23,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606103373] [2022-04-18 20:19:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:23,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:19:23,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:23,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:19:23,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-04-18 20:19:23,475 INFO L87 Difference]: Start difference. First operand 9154 states and 27208 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-04-18 20:19:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:23,939 INFO L93 Difference]: Finished difference Result 11634 states and 34334 transitions. [2022-04-18 20:19:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:19:23,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 18 [2022-04-18 20:19:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:23,975 INFO L225 Difference]: With dead ends: 11634 [2022-04-18 20:19:23,976 INFO L226 Difference]: Without dead ends: 11634 [2022-04-18 20:19:23,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-04-18 20:19:23,977 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:23,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 41 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-18 20:19:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2022-04-18 20:19:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 9834. [2022-04-18 20:19:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9834 states, 9807 states have (on average 2.972366676863465) internal successors, (29150), 9833 states have internal predecessors, (29150), 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) [2022-04-18 20:19:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9834 states to 9834 states and 29150 transitions. [2022-04-18 20:19:24,228 INFO L78 Accepts]: Start accepts. Automaton has 9834 states and 29150 transitions. Word has length 18 [2022-04-18 20:19:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:24,228 INFO L478 AbstractCegarLoop]: Abstraction has 9834 states and 29150 transitions. [2022-04-18 20:19:24,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 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) [2022-04-18 20:19:24,229 INFO L276 IsEmpty]: Start isEmpty. Operand 9834 states and 29150 transitions. [2022-04-18 20:19:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 20:19:24,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:24,232 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:24,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:24,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:24,444 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash -164124292, now seen corresponding path program 1 times [2022-04-18 20:19:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:24,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501282622] [2022-04-18 20:19:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:24,462 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:24,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324614265] [2022-04-18 20:19:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:24,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:24,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:24,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:24,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-18 20:19:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:24,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-18 20:19:24,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:24,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:24,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-04-18 20:19:24,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:24,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:24,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:24,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:24,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:19:24,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:24,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501282622] [2022-04-18 20:19:24,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324614265] [2022-04-18 20:19:24,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324614265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:24,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:24,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:19:24,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783468646] [2022-04-18 20:19:24,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:24,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:19:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:24,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:19:24,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:19:24,831 INFO L87 Difference]: Start difference. First operand 9834 states and 29150 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) [2022-04-18 20:19:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:25,661 INFO L93 Difference]: Finished difference Result 15171 states and 44419 transitions. [2022-04-18 20:19:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:19:25,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) Word has length 21 [2022-04-18 20:19:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:25,706 INFO L225 Difference]: With dead ends: 15171 [2022-04-18 20:19:25,706 INFO L226 Difference]: Without dead ends: 15171 [2022-04-18 20:19:25,706 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-18 20:19:25,707 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 393 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:25,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 103 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 20:19:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15171 states. [2022-04-18 20:19:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15171 to 12466. [2022-04-18 20:19:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12466 states, 12439 states have (on average 2.9876999758823057) internal successors, (37164), 12465 states have internal predecessors, (37164), 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) [2022-04-18 20:19:26,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37164 transitions. [2022-04-18 20:19:26,042 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37164 transitions. Word has length 21 [2022-04-18 20:19:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:26,043 INFO L478 AbstractCegarLoop]: Abstraction has 12466 states and 37164 transitions. [2022-04-18 20:19:26,043 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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) [2022-04-18 20:19:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37164 transitions. [2022-04-18 20:19:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-18 20:19:26,046 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:26,047 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:26,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:26,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-18 20:19:26,268 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash 406329373, now seen corresponding path program 1 times [2022-04-18 20:19:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:26,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855855403] [2022-04-18 20:19:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:26,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:26,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:26,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978888093] [2022-04-18 20:19:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:26,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:26,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:26,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:26,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-18 20:19:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:26,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-18 20:19:26,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:26,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:26,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:19:26,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:26,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 [2022-04-18 20:19:26,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:26,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:26,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:19:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 20:19:26,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:26,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:26,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855855403] [2022-04-18 20:19:26,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:26,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978888093] [2022-04-18 20:19:26,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978888093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:26,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:26,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:19:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910127176] [2022-04-18 20:19:26,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:26,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-18 20:19:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-18 20:19:26,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:19:26,540 INFO L87 Difference]: Start difference. First operand 12466 states and 37164 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2022-04-18 20:19:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:26,985 INFO L93 Difference]: Finished difference Result 12564 states and 37342 transitions. [2022-04-18 20:19:26,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:19:26,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) Word has length 22 [2022-04-18 20:19:26,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:27,018 INFO L225 Difference]: With dead ends: 12564 [2022-04-18 20:19:27,018 INFO L226 Difference]: Without dead ends: 12386 [2022-04-18 20:19:27,018 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:19:27,019 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 105 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:27,019 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 57 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 20:19:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2022-04-18 20:19:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12365. [2022-04-18 20:19:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12365 states, 12339 states have (on average 2.9803873895777615) internal successors, (36775), 12364 states have internal predecessors, (36775), 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) [2022-04-18 20:19:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12365 states to 12365 states and 36775 transitions. [2022-04-18 20:19:27,351 INFO L78 Accepts]: Start accepts. Automaton has 12365 states and 36775 transitions. Word has length 22 [2022-04-18 20:19:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:27,352 INFO L478 AbstractCegarLoop]: Abstraction has 12365 states and 36775 transitions. [2022-04-18 20:19:27,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2022-04-18 20:19:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 12365 states and 36775 transitions. [2022-04-18 20:19:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-18 20:19:27,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:27,356 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:27,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:27,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-18 20:19:27,564 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:27,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1811248590, now seen corresponding path program 1 times [2022-04-18 20:19:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:27,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307104762] [2022-04-18 20:19:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:27,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261076529] [2022-04-18 20:19:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:27,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:27,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:27,578 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:27,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-18 20:19:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:27,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-18 20:19:27,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:27,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2022-04-18 20:19:27,768 INFO L356 Elim1Store]: treesize reduction 64, result has 20.0 percent of original size [2022-04-18 20:19:27,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 38 treesize of output 37 [2022-04-18 20:19:27,808 INFO L356 Elim1Store]: treesize reduction 156, result has 17.9 percent of original size [2022-04-18 20:19:27,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 57 [2022-04-18 20:19:27,865 INFO L356 Elim1Store]: treesize reduction 277, result has 15.5 percent of original size [2022-04-18 20:19:27,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 77 [2022-04-18 20:19:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:19:27,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:27,885 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:27,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307104762] [2022-04-18 20:19:27,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:27,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261076529] [2022-04-18 20:19:27,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261076529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:27,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:27,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:19:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149344032] [2022-04-18 20:19:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:27,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:19:27,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:27,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:19:27,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:19:27,888 INFO L87 Difference]: Start difference. First operand 12365 states and 36775 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-04-18 20:19:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:28,447 INFO L93 Difference]: Finished difference Result 13426 states and 39809 transitions. [2022-04-18 20:19:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:19:28,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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) Word has length 24 [2022-04-18 20:19:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:28,484 INFO L225 Difference]: With dead ends: 13426 [2022-04-18 20:19:28,484 INFO L226 Difference]: Without dead ends: 13426 [2022-04-18 20:19:28,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:19:28,484 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:28,485 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 48 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-18 20:19:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13426 states. [2022-04-18 20:19:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13426 to 12964. [2022-04-18 20:19:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12964 states, 12939 states have (on average 2.973722853388979) internal successors, (38477), 12963 states have internal predecessors, (38477), 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) [2022-04-18 20:19:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12964 states to 12964 states and 38477 transitions. [2022-04-18 20:19:28,794 INFO L78 Accepts]: Start accepts. Automaton has 12964 states and 38477 transitions. Word has length 24 [2022-04-18 20:19:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:28,794 INFO L478 AbstractCegarLoop]: Abstraction has 12964 states and 38477 transitions. [2022-04-18 20:19:28,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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) [2022-04-18 20:19:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 12964 states and 38477 transitions. [2022-04-18 20:19:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-18 20:19:28,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:28,799 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:28,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:29,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:29,002 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 647804516, now seen corresponding path program 1 times [2022-04-18 20:19:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:29,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057939452] [2022-04-18 20:19:29,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:29,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:29,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:29,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117357581] [2022-04-18 20:19:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:29,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:29,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:29,019 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:29,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-18 20:19:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:29,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-18 20:19:29,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:29,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:29,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-04-18 20:19:29,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 30 [2022-04-18 20:19:29,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:29,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:29,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:29,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:29,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:19:29,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:29,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057939452] [2022-04-18 20:19:29,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:29,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117357581] [2022-04-18 20:19:29,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117357581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:29,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:29,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 20:19:29,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126877457] [2022-04-18 20:19:29,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:29,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 20:19:29,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:29,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 20:19:29,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:19:29,520 INFO L87 Difference]: Start difference. First operand 12964 states and 38477 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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) [2022-04-18 20:19:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:30,394 INFO L93 Difference]: Finished difference Result 16689 states and 48753 transitions. [2022-04-18 20:19:30,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 20:19:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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) Word has length 25 [2022-04-18 20:19:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:30,505 INFO L225 Difference]: With dead ends: 16689 [2022-04-18 20:19:30,505 INFO L226 Difference]: Without dead ends: 16689 [2022-04-18 20:19:30,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-04-18 20:19:30,505 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 223 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:30,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 137 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 20:19:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16689 states. [2022-04-18 20:19:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16689 to 13428. [2022-04-18 20:19:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13428 states, 13403 states have (on average 2.9770200701335523) internal successors, (39901), 13427 states have internal predecessors, (39901), 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) [2022-04-18 20:19:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13428 states to 13428 states and 39901 transitions. [2022-04-18 20:19:30,741 INFO L78 Accepts]: Start accepts. Automaton has 13428 states and 39901 transitions. Word has length 25 [2022-04-18 20:19:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:30,742 INFO L478 AbstractCegarLoop]: Abstraction has 13428 states and 39901 transitions. [2022-04-18 20:19:30,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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) [2022-04-18 20:19:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 13428 states and 39901 transitions. [2022-04-18 20:19:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-18 20:19:30,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:30,747 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:30,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:30,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-18 20:19:30,959 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash -103908359, now seen corresponding path program 1 times [2022-04-18 20:19:30,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:30,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952789946] [2022-04-18 20:19:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:30,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:30,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:30,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1074038885] [2022-04-18 20:19:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:30,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:30,974 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:30,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-18 20:19:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:31,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-18 20:19:31,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:31,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:31,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:19:31,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:19:31,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:19:31,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:31,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:19:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:19:31,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:31,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:31,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952789946] [2022-04-18 20:19:31,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:31,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074038885] [2022-04-18 20:19:31,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074038885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:31,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:31,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-18 20:19:31,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168016958] [2022-04-18 20:19:31,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:31,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-18 20:19:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:31,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-18 20:19:31,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-18 20:19:31,372 INFO L87 Difference]: Start difference. First operand 13428 states and 39901 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) [2022-04-18 20:19:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:32,128 INFO L93 Difference]: Finished difference Result 16791 states and 49002 transitions. [2022-04-18 20:19:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-18 20:19:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) Word has length 25 [2022-04-18 20:19:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:32,163 INFO L225 Difference]: With dead ends: 16791 [2022-04-18 20:19:32,163 INFO L226 Difference]: Without dead ends: 16767 [2022-04-18 20:19:32,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-18 20:19:32,164 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 147 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:32,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 110 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 20:19:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16767 states. [2022-04-18 20:19:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16767 to 12828. [2022-04-18 20:19:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12828 states, 12803 states have (on average 2.9685230024213074) internal successors, (38006), 12827 states have internal predecessors, (38006), 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) [2022-04-18 20:19:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12828 states to 12828 states and 38006 transitions. [2022-04-18 20:19:32,399 INFO L78 Accepts]: Start accepts. Automaton has 12828 states and 38006 transitions. Word has length 25 [2022-04-18 20:19:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:32,399 INFO L478 AbstractCegarLoop]: Abstraction has 12828 states and 38006 transitions. [2022-04-18 20:19:32,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) [2022-04-18 20:19:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 12828 states and 38006 transitions. [2022-04-18 20:19:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-18 20:19:32,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:32,404 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:32,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:32,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-18 20:19:32,628 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1848923411, now seen corresponding path program 1 times [2022-04-18 20:19:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:32,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579375030] [2022-04-18 20:19:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:32,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:32,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:32,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91074989] [2022-04-18 20:19:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:32,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:32,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:32,645 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:32,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-18 20:19:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:32,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 20:19:32,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:19:32,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:19:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:19:32,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:32,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579375030] [2022-04-18 20:19:32,990 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:32,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91074989] [2022-04-18 20:19:32,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91074989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:19:32,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2113161845] [2022-04-18 20:19:32,997 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:19:32,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:19:32,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-18 20:19:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399282953] [2022-04-18 20:19:32,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:19:33,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:19:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:33,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:19:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:19:33,000 INFO L87 Difference]: Start difference. First operand 12828 states and 38006 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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) [2022-04-18 20:19:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:33,608 INFO L93 Difference]: Finished difference Result 22207 states and 64542 transitions. [2022-04-18 20:19:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-18 20:19:33,609 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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) Word has length 28 [2022-04-18 20:19:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:33,654 INFO L225 Difference]: With dead ends: 22207 [2022-04-18 20:19:33,654 INFO L226 Difference]: Without dead ends: 21167 [2022-04-18 20:19:33,655 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-04-18 20:19:33,655 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 306 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:33,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 561 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-18 20:19:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21167 states. [2022-04-18 20:19:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21167 to 19081. [2022-04-18 20:19:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19081 states, 19056 states have (on average 3.008028967254408) internal successors, (57321), 19080 states have internal predecessors, (57321), 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) [2022-04-18 20:19:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19081 states to 19081 states and 57321 transitions. [2022-04-18 20:19:34,010 INFO L78 Accepts]: Start accepts. Automaton has 19081 states and 57321 transitions. Word has length 28 [2022-04-18 20:19:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:34,010 INFO L478 AbstractCegarLoop]: Abstraction has 19081 states and 57321 transitions. [2022-04-18 20:19:34,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 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) [2022-04-18 20:19:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19081 states and 57321 transitions. [2022-04-18 20:19:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-18 20:19:34,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:34,017 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:34,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-18 20:19:34,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-18 20:19:34,222 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1270178891, now seen corresponding path program 2 times [2022-04-18 20:19:34,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:34,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169694971] [2022-04-18 20:19:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:34,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:34,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:34,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [720936336] [2022-04-18 20:19:34,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:19:34,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:34,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:34,241 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:34,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-18 20:19:34,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:19:34,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:19:34,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-18 20:19:34,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:34,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:34,439 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:19:34,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 28 treesize of output 27 [2022-04-18 20:19:34,467 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:19:34,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-04-18 20:19:34,510 INFO L356 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-04-18 20:19:34,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-04-18 20:19:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-18 20:19:34,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:34,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:34,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169694971] [2022-04-18 20:19:34,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:34,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720936336] [2022-04-18 20:19:34,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720936336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:34,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:34,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:19:34,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655096562] [2022-04-18 20:19:34,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:34,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:19:34,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:34,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:19:34,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:19:34,544 INFO L87 Difference]: Start difference. First operand 19081 states and 57321 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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) [2022-04-18 20:19:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:35,150 INFO L93 Difference]: Finished difference Result 21419 states and 64260 transitions. [2022-04-18 20:19:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:19:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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) Word has length 30 [2022-04-18 20:19:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:35,202 INFO L225 Difference]: With dead ends: 21419 [2022-04-18 20:19:35,203 INFO L226 Difference]: Without dead ends: 21419 [2022-04-18 20:19:35,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:19:35,203 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 76 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:35,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 58 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-18 20:19:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21419 states. [2022-04-18 20:19:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21419 to 19921. [2022-04-18 20:19:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19921 states, 19900 states have (on average 3.006030150753769) internal successors, (59820), 19920 states have internal predecessors, (59820), 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) [2022-04-18 20:19:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19921 states to 19921 states and 59820 transitions. [2022-04-18 20:19:35,733 INFO L78 Accepts]: Start accepts. Automaton has 19921 states and 59820 transitions. Word has length 30 [2022-04-18 20:19:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:35,733 INFO L478 AbstractCegarLoop]: Abstraction has 19921 states and 59820 transitions. [2022-04-18 20:19:35,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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) [2022-04-18 20:19:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 19921 states and 59820 transitions. [2022-04-18 20:19:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-18 20:19:35,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:35,739 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:35,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:35,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-18 20:19:35,939 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1486191525, now seen corresponding path program 1 times [2022-04-18 20:19:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:35,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983512584] [2022-04-18 20:19:35,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:35,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:36,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:36,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846689180] [2022-04-18 20:19:36,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:36,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:36,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:36,108 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:36,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-18 20:19:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:36,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-18 20:19:36,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:36,352 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-04-18 20:19:36,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-04-18 20:19:36,393 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:19:36,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:36,425 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:19:36,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:36,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-18 20:19:36,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 27 [2022-04-18 20:19:36,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 30 [2022-04-18 20:19:36,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:36,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:36,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:36,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:36,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:19:36,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:19:36,849 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_1713) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_1713) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4) 1)) |c_thread1Thread1of1ForFork0_#t~nondet3|))) is different from false [2022-04-18 20:19:36,875 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1713 (Array Int Int))) (= (let ((.cse0 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4) 1))) (select (select (store (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse0 |c_thread1Thread1of1ForFork0_#t~nondet3|)) c_~B~0.base v_ArrVal_1713) c_~A~0.base) .cse0)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_1713 (Array Int Int))) (= (let ((.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse1 1) |c_thread1Thread1of1ForFork0_#t~nondet3|)) c_~B~0.base v_ArrVal_1713) c_~A~0.base) (+ c_~A~0.offset .cse1))) |c_thread1Thread1of1ForFork0_#t~nondet3|))) is different from false [2022-04-18 20:19:36,905 INFO L356 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-04-18 20:19:36,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 40 [2022-04-18 20:19:36,913 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 20:19:36,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 22 [2022-04-18 20:19:36,923 INFO L356 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-04-18 20:19:36,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 1 [2022-04-18 20:19:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:19:37,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:37,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983512584] [2022-04-18 20:19:37,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:37,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846689180] [2022-04-18 20:19:37,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846689180] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-18 20:19:37,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 20:19:37,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2022-04-18 20:19:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137568439] [2022-04-18 20:19:37,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:37,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:19:37,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:37,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:19:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=275, Unknown=2, NotChecked=70, Total=420 [2022-04-18 20:19:37,057 INFO L87 Difference]: Start difference. First operand 19921 states and 59820 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) [2022-04-18 20:19:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:37,866 INFO L93 Difference]: Finished difference Result 29268 states and 87258 transitions. [2022-04-18 20:19:37,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 20:19:37,867 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) Word has length 30 [2022-04-18 20:19:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:37,950 INFO L225 Difference]: With dead ends: 29268 [2022-04-18 20:19:37,950 INFO L226 Difference]: Without dead ends: 29268 [2022-04-18 20:19:37,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=413, Unknown=6, NotChecked=86, Total=600 [2022-04-18 20:19:37,951 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 254 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:37,952 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 183 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 380 Invalid, 0 Unknown, 365 Unchecked, 0.4s Time] [2022-04-18 20:19:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29268 states. [2022-04-18 20:19:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29268 to 20025. [2022-04-18 20:19:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20025 states, 20004 states have (on average 3.0056988602279544) internal successors, (60126), 20024 states have internal predecessors, (60126), 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) [2022-04-18 20:19:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20025 states to 20025 states and 60126 transitions. [2022-04-18 20:19:38,456 INFO L78 Accepts]: Start accepts. Automaton has 20025 states and 60126 transitions. Word has length 30 [2022-04-18 20:19:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:38,457 INFO L478 AbstractCegarLoop]: Abstraction has 20025 states and 60126 transitions. [2022-04-18 20:19:38,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) [2022-04-18 20:19:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20025 states and 60126 transitions. [2022-04-18 20:19:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-18 20:19:38,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:38,462 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:38,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:38,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-18 20:19:38,663 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:38,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1485240135, now seen corresponding path program 2 times [2022-04-18 20:19:38,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:38,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981010006] [2022-04-18 20:19:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:38,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:38,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413214029] [2022-04-18 20:19:38,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:19:38,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:38,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:38,679 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:38,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-18 20:19:38,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:19:38,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:19:38,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-18 20:19:38,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:38,894 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-04-18 20:19:38,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-04-18 20:19:38,939 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:19:38,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:38,965 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:19:38,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:39,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-18 20:19:39,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 27 [2022-04-18 20:19:39,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:39,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:39,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:39,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-04-18 20:19:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 20:19:39,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:39,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981010006] [2022-04-18 20:19:39,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413214029] [2022-04-18 20:19:39,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413214029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:39,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:39,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-18 20:19:39,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543089305] [2022-04-18 20:19:39,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:39,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-18 20:19:39,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:39,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-18 20:19:39,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-18 20:19:39,317 INFO L87 Difference]: Start difference. First operand 20025 states and 60126 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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) [2022-04-18 20:19:41,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:41,131 INFO L93 Difference]: Finished difference Result 41694 states and 124015 transitions. [2022-04-18 20:19:41,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-18 20:19:41,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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) Word has length 30 [2022-04-18 20:19:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:41,277 INFO L225 Difference]: With dead ends: 41694 [2022-04-18 20:19:41,277 INFO L226 Difference]: Without dead ends: 41694 [2022-04-18 20:19:41,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2022-04-18 20:19:41,278 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 555 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:41,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [555 Valid, 119 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-18 20:19:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41694 states. [2022-04-18 20:19:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41694 to 21269. [2022-04-18 20:19:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21269 states, 21248 states have (on average 3.0103539156626504) internal successors, (63964), 21268 states have internal predecessors, (63964), 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) [2022-04-18 20:19:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 63964 transitions. [2022-04-18 20:19:41,994 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 63964 transitions. Word has length 30 [2022-04-18 20:19:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:41,995 INFO L478 AbstractCegarLoop]: Abstraction has 21269 states and 63964 transitions. [2022-04-18 20:19:41,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 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) [2022-04-18 20:19:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 63964 transitions. [2022-04-18 20:19:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-18 20:19:42,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:42,003 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:42,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:42,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-18 20:19:42,219 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:42,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1803891765, now seen corresponding path program 1 times [2022-04-18 20:19:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:42,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509215993] [2022-04-18 20:19:42,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:42,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:42,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:42,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646770119] [2022-04-18 20:19:42,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:42,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:42,239 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:42,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-18 20:19:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:42,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-18 20:19:42,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:42,475 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-04-18 20:19:42,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-04-18 20:19:42,499 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-04-18 20:19:42,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:42,533 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-04-18 20:19:42,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-04-18 20:19:42,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-18 20:19:42,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 27 [2022-04-18 20:19:42,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:42,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:42,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:42,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-04-18 20:19:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:19:42,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:19:43,006 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2123 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_2123) c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2123 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_2123) c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2123 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~A~0.base v_ArrVal_2123) c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (forall ((v_ArrVal_2123 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_2123) c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset 1)) 0))) is different from false [2022-04-18 20:19:43,092 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2123 (Array Int Int))) (= (let ((.cse0 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (+ .cse0 3 c_~B~0.offset))) (select (select (store (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) (+ .cse0 2 c_~B~0.offset) 0) .cse1 0)) c_~A~0.base v_ArrVal_2123) c_~B~0.base) .cse1))) 0)) (forall ((v_ArrVal_2123 (Array Int Int))) (= (let ((.cse2 (* c_thread2Thread1of1ForFork1_~i~1 4))) (select (select (store (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) (+ .cse2 2 c_~B~0.offset) 0) (+ .cse2 3 c_~B~0.offset) 0)) c_~A~0.base v_ArrVal_2123) c_~B~0.base) (+ .cse2 c_~B~0.offset))) 0)) (forall ((v_ArrVal_2123 (Array Int Int))) (= (let ((.cse3 (* c_thread2Thread1of1ForFork1_~i~1 4))) (select (select (store (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0)) c_~A~0.base v_ArrVal_2123) c_~B~0.base) (+ .cse3 c_~B~0.offset 1))) 0)) (forall ((v_ArrVal_2123 (Array Int Int))) (= (let ((.cse5 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse4 (+ .cse5 2 c_~B~0.offset))) (select (select (store (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse4 0) (+ .cse5 3 c_~B~0.offset) 0)) c_~A~0.base v_ArrVal_2123) c_~B~0.base) .cse4))) 0))) is different from false [2022-04-18 20:19:43,113 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2123 (Array Int Int))) (= (let ((.cse0 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (+ .cse0 3 c_~B~0.offset))) (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) (+ .cse0 c_~B~0.offset 1) 0) (+ .cse0 2 c_~B~0.offset) 0) .cse1 0)) c_~A~0.base v_ArrVal_2123) c_~B~0.base) .cse1))) 0)) (forall ((v_ArrVal_2123 (Array Int Int))) (= (let ((.cse2 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse3 (+ .cse2 2 c_~B~0.offset))) (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) (+ .cse2 c_~B~0.offset 1) 0) .cse3 0) (+ .cse2 3 c_~B~0.offset) 0)) c_~A~0.base v_ArrVal_2123) c_~B~0.base) .cse3))) 0)) (forall ((v_ArrVal_2123 (Array Int Int))) (= (let ((.cse4 (* c_thread2Thread1of1ForFork1_~i~1 4))) (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)) c_~A~0.base v_ArrVal_2123) c_~B~0.base) (+ .cse4 c_~B~0.offset))) 0)) (forall ((v_ArrVal_2123 (Array Int Int))) (= (let ((.cse6 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse5 (+ .cse6 c_~B~0.offset 1))) (select (select (store (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse5 0) (+ .cse6 2 c_~B~0.offset) 0) (+ .cse6 3 c_~B~0.offset) 0)) c_~A~0.base v_ArrVal_2123) c_~B~0.base) .cse5))) 0))) is different from false [2022-04-18 20:19:43,164 INFO L356 Elim1Store]: treesize reduction 293, result has 15.1 percent of original size [2022-04-18 20:19:43,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 67 [2022-04-18 20:19:43,169 INFO L356 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-04-18 20:19:43,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 83 treesize of output 39 [2022-04-18 20:19:43,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 [2022-04-18 20:19:43,192 INFO L356 Elim1Store]: treesize reduction 344, result has 0.3 percent of original size [2022-04-18 20:19:43,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-04-18 20:19:43,208 INFO L356 Elim1Store]: treesize reduction 344, result has 0.3 percent of original size [2022-04-18 20:19:43,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-04-18 20:19:43,222 INFO L356 Elim1Store]: treesize reduction 344, result has 0.3 percent of original size [2022-04-18 20:19:43,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 1 [2022-04-18 20:19:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:19:43,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:43,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509215993] [2022-04-18 20:19:43,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:43,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646770119] [2022-04-18 20:19:43,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646770119] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-18 20:19:43,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 20:19:43,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2022-04-18 20:19:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910627874] [2022-04-18 20:19:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:43,349 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:19:43,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:19:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=232, Unknown=5, NotChecked=102, Total=420 [2022-04-18 20:19:43,350 INFO L87 Difference]: Start difference. First operand 21269 states and 63964 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) [2022-04-18 20:19:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:43,802 INFO L93 Difference]: Finished difference Result 25074 states and 75082 transitions. [2022-04-18 20:19:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-18 20:19:43,804 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) Word has length 30 [2022-04-18 20:19:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:43,967 INFO L225 Difference]: With dead ends: 25074 [2022-04-18 20:19:43,967 INFO L226 Difference]: Without dead ends: 25074 [2022-04-18 20:19:43,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=329, Unknown=5, NotChecked=120, Total=552 [2022-04-18 20:19:43,968 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 101 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 613 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:43,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 193 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 613 Unchecked, 0.3s Time] [2022-04-18 20:19:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25074 states. [2022-04-18 20:19:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25074 to 22200. [2022-04-18 20:19:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22200 states, 22179 states have (on average 3.029622615988097) internal successors, (67194), 22199 states have internal predecessors, (67194), 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) [2022-04-18 20:19:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22200 states to 22200 states and 67194 transitions. [2022-04-18 20:19:44,520 INFO L78 Accepts]: Start accepts. Automaton has 22200 states and 67194 transitions. Word has length 30 [2022-04-18 20:19:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:44,521 INFO L478 AbstractCegarLoop]: Abstraction has 22200 states and 67194 transitions. [2022-04-18 20:19:44,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) [2022-04-18 20:19:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 22200 states and 67194 transitions. [2022-04-18 20:19:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-18 20:19:44,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:44,529 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:44,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:44,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-18 20:19:44,740 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1803926175, now seen corresponding path program 2 times [2022-04-18 20:19:44,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:44,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964478325] [2022-04-18 20:19:44,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:44,756 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:44,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919508954] [2022-04-18 20:19:44,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:19:44,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:44,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:44,758 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:44,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-18 20:19:44,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:19:44,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:19:44,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-18 20:19:44,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:44,988 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-04-18 20:19:44,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-04-18 20:19:45,015 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:19:45,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:45,030 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:19:45,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:45,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-18 20:19:45,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 27 [2022-04-18 20:19:45,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:45,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-04-18 20:19:45,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:45,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:45,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 20:19:45,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:45,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:45,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964478325] [2022-04-18 20:19:45,337 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:45,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919508954] [2022-04-18 20:19:45,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919508954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:45,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:45,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-18 20:19:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454070696] [2022-04-18 20:19:45,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:45,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-18 20:19:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:45,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-18 20:19:45,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-18 20:19:45,338 INFO L87 Difference]: Start difference. First operand 22200 states and 67194 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) [2022-04-18 20:19:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:46,386 INFO L93 Difference]: Finished difference Result 41636 states and 126242 transitions. [2022-04-18 20:19:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-18 20:19:46,387 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) Word has length 30 [2022-04-18 20:19:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:46,505 INFO L225 Difference]: With dead ends: 41636 [2022-04-18 20:19:46,505 INFO L226 Difference]: Without dead ends: 41636 [2022-04-18 20:19:46,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2022-04-18 20:19:46,505 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 358 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:46,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 78 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-18 20:19:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41636 states. [2022-04-18 20:19:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41636 to 36203. [2022-04-18 20:19:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36203 states, 36182 states have (on average 3.0924492841744513) internal successors, (111891), 36202 states have internal predecessors, (111891), 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) [2022-04-18 20:19:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36203 states to 36203 states and 111891 transitions. [2022-04-18 20:19:47,459 INFO L78 Accepts]: Start accepts. Automaton has 36203 states and 111891 transitions. Word has length 30 [2022-04-18 20:19:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:47,460 INFO L478 AbstractCegarLoop]: Abstraction has 36203 states and 111891 transitions. [2022-04-18 20:19:47,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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) [2022-04-18 20:19:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 36203 states and 111891 transitions. [2022-04-18 20:19:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-18 20:19:47,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:47,468 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:47,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-18 20:19:47,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-18 20:19:47,669 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:47,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1629397405, now seen corresponding path program 1 times [2022-04-18 20:19:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:47,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955899112] [2022-04-18 20:19:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:47,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:47,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:47,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048923362] [2022-04-18 20:19:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:47,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:47,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:47,685 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:47,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-18 20:19:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:47,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-18 20:19:47,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:47,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:47,945 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:19:47,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 28 treesize of output 27 [2022-04-18 20:19:47,976 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:19:47,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-04-18 20:19:48,021 INFO L356 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-04-18 20:19:48,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-04-18 20:19:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:19:48,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:48,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:48,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955899112] [2022-04-18 20:19:48,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:48,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048923362] [2022-04-18 20:19:48,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048923362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:48,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:48,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:19:48,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196164365] [2022-04-18 20:19:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:48,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:19:48,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:48,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:19:48,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:19:48,050 INFO L87 Difference]: Start difference. First operand 36203 states and 111891 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2022-04-18 20:19:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:48,839 INFO L93 Difference]: Finished difference Result 38535 states and 118872 transitions. [2022-04-18 20:19:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 20:19:48,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) Word has length 30 [2022-04-18 20:19:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:48,976 INFO L225 Difference]: With dead ends: 38535 [2022-04-18 20:19:48,977 INFO L226 Difference]: Without dead ends: 38515 [2022-04-18 20:19:48,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:19:48,977 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:48,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 46 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-18 20:19:49,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38515 states. [2022-04-18 20:19:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38515 to 38515. [2022-04-18 20:19:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38515 states, 38494 states have (on average 3.086532966176547) internal successors, (118813), 38514 states have internal predecessors, (118813), 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) [2022-04-18 20:19:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38515 states to 38515 states and 118813 transitions. [2022-04-18 20:19:49,885 INFO L78 Accepts]: Start accepts. Automaton has 38515 states and 118813 transitions. Word has length 30 [2022-04-18 20:19:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:49,885 INFO L478 AbstractCegarLoop]: Abstraction has 38515 states and 118813 transitions. [2022-04-18 20:19:49,886 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2022-04-18 20:19:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 38515 states and 118813 transitions. [2022-04-18 20:19:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-18 20:19:49,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:49,897 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:49,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:50,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:50,098 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 223066037, now seen corresponding path program 1 times [2022-04-18 20:19:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:50,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008258575] [2022-04-18 20:19:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:50,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:50,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639298795] [2022-04-18 20:19:50,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:50,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:50,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:50,308 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:50,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-18 20:19:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:50,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-18 20:19:50,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:50,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:50,559 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-04-18 20:19:50,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 24 [2022-04-18 20:19:50,598 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:19:50,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:50,627 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:19:50,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:50,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-18 20:19:50,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:50,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 27 [2022-04-18 20:19:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:50,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 30 [2022-04-18 20:19:50,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 30 [2022-04-18 20:19:50,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:50,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:50,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:50,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:50,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:51,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:51,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:51,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:51,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:51,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:51,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:51,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:19:51,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:19:51,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:19:51,134 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2696 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2696) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2696 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2696) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4) 1)) |c_thread1Thread1of1ForFork0_#t~nondet3|))) is different from false [2022-04-18 20:19:51,147 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2696 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2695) c_~B~0.base v_ArrVal_2696) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4) 1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2696 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2695) c_~B~0.base v_ArrVal_2696) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) |c_thread1Thread1of1ForFork0_#t~nondet3|))) is different from false [2022-04-18 20:19:51,162 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2696 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (= |c_thread1Thread1of1ForFork0_#t~nondet3| (let ((.cse0 (* c_thread1Thread1of1ForFork0_~i~0 4))) (select (select (store (store (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) |c_thread1Thread1of1ForFork0_#t~nondet3|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2695) c_~B~0.base v_ArrVal_2696) c_~A~0.base) (+ c_~A~0.offset .cse0))))) (forall ((v_ArrVal_2696 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (= (let ((.cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4) 1))) (select (select (store (store (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 |c_thread1Thread1of1ForFork0_#t~nondet3|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2695) c_~B~0.base v_ArrVal_2696) c_~A~0.base) .cse1)) |c_thread1Thread1of1ForFork0_#t~nondet3|))) is different from false [2022-04-18 20:19:51,183 INFO L356 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-04-18 20:19:51,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 44 [2022-04-18 20:19:51,189 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 20:19:51,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 203 treesize of output 132 [2022-04-18 20:19:51,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 120 treesize of output 106 [2022-04-18 20:19:51,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 106 treesize of output 78 [2022-04-18 20:19:51,234 INFO L356 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-04-18 20:19:51,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 1 [2022-04-18 20:19:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:19:51,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:51,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008258575] [2022-04-18 20:19:51,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:51,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639298795] [2022-04-18 20:19:51,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639298795] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-18 20:19:51,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 20:19:51,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 21 [2022-04-18 20:19:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779241416] [2022-04-18 20:19:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:51,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-18 20:19:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-18 20:19:51,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=309, Unknown=3, NotChecked=114, Total=506 [2022-04-18 20:19:51,526 INFO L87 Difference]: Start difference. First operand 38515 states and 118813 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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) [2022-04-18 20:19:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:52,375 INFO L93 Difference]: Finished difference Result 58832 states and 179955 transitions. [2022-04-18 20:19:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-18 20:19:52,376 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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) Word has length 32 [2022-04-18 20:19:52,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:52,580 INFO L225 Difference]: With dead ends: 58832 [2022-04-18 20:19:52,580 INFO L226 Difference]: Without dead ends: 58832 [2022-04-18 20:19:52,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=12, NotChecked=150, Total=812 [2022-04-18 20:19:52,581 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 149 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:52,581 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 163 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 0 Unknown, 716 Unchecked, 0.2s Time] [2022-04-18 20:19:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58832 states. [2022-04-18 20:19:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58832 to 38542. [2022-04-18 20:19:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38542 states, 38521 states have (on average 3.0864723138028607) internal successors, (118894), 38541 states have internal predecessors, (118894), 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) [2022-04-18 20:19:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38542 states to 38542 states and 118894 transitions. [2022-04-18 20:19:54,011 INFO L78 Accepts]: Start accepts. Automaton has 38542 states and 118894 transitions. Word has length 32 [2022-04-18 20:19:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:54,012 INFO L478 AbstractCegarLoop]: Abstraction has 38542 states and 118894 transitions. [2022-04-18 20:19:54,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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) [2022-04-18 20:19:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 38542 states and 118894 transitions. [2022-04-18 20:19:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-18 20:19:54,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:54,021 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:54,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:54,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:54,222 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash 222114647, now seen corresponding path program 2 times [2022-04-18 20:19:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:54,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512631771] [2022-04-18 20:19:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:54,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:54,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35963867] [2022-04-18 20:19:54,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:19:54,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:54,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:54,244 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:54,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-18 20:19:54,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:19:54,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:19:54,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-18 20:19:54,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:54,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:54,546 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-04-18 20:19:54,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 24 [2022-04-18 20:19:54,601 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-04-18 20:19:54,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:54,629 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 20:19:54,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:19:54,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-18 20:19:54,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:54,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 27 [2022-04-18 20:19:54,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:54,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 30 [2022-04-18 20:19:54,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:55,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:55,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:55,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 42 [2022-04-18 20:19:55,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:55,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:55,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:55,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:55,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:55,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:19:55,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 57 [2022-04-18 20:19:55,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-04-18 20:19:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 20:19:55,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:19:55,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:55,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512631771] [2022-04-18 20:19:55,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:55,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35963867] [2022-04-18 20:19:55,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35963867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:19:55,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:19:55,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-18 20:19:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439567474] [2022-04-18 20:19:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:55,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-18 20:19:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:55,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-18 20:19:55,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-18 20:19:55,146 INFO L87 Difference]: Start difference. First operand 38542 states and 118894 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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) [2022-04-18 20:19:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:19:57,354 INFO L93 Difference]: Finished difference Result 71804 states and 220109 transitions. [2022-04-18 20:19:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-18 20:19:57,356 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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) Word has length 32 [2022-04-18 20:19:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:19:57,575 INFO L225 Difference]: With dead ends: 71804 [2022-04-18 20:19:57,575 INFO L226 Difference]: Without dead ends: 71804 [2022-04-18 20:19:57,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2022-04-18 20:19:57,576 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 424 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:19:57,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 142 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-18 20:19:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71804 states. [2022-04-18 20:19:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71804 to 36605. [2022-04-18 20:19:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36605 states, 36584 states have (on average 3.0837797944456593) internal successors, (112817), 36604 states have internal predecessors, (112817), 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) [2022-04-18 20:19:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36605 states to 36605 states and 112817 transitions. [2022-04-18 20:19:59,035 INFO L78 Accepts]: Start accepts. Automaton has 36605 states and 112817 transitions. Word has length 32 [2022-04-18 20:19:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:19:59,036 INFO L478 AbstractCegarLoop]: Abstraction has 36605 states and 112817 transitions. [2022-04-18 20:19:59,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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) [2022-04-18 20:19:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36605 states and 112817 transitions. [2022-04-18 20:19:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-18 20:19:59,048 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:19:59,048 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:19:59,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-18 20:19:59,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:59,262 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:19:59,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:19:59,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2104769801, now seen corresponding path program 1 times [2022-04-18 20:19:59,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:19:59,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570726957] [2022-04-18 20:19:59,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:59,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:19:59,278 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:19:59,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050880218] [2022-04-18 20:19:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:19:59,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:19:59,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:19:59,279 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:19:59,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-18 20:19:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:19:59,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-18 20:19:59,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:19:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:19:59,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:19:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:19:59,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:19:59,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570726957] [2022-04-18 20:19:59,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:19:59,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050880218] [2022-04-18 20:19:59,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050880218] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-18 20:19:59,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 20:19:59,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-04-18 20:19:59,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295514419] [2022-04-18 20:19:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:19:59,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:19:59,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:19:59,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:19:59,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:19:59,680 INFO L87 Difference]: Start difference. First operand 36605 states and 112817 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-04-18 20:20:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:20:00,075 INFO L93 Difference]: Finished difference Result 36522 states and 111683 transitions. [2022-04-18 20:20:00,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 20:20:00,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) Word has length 32 [2022-04-18 20:20:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:20:00,190 INFO L225 Difference]: With dead ends: 36522 [2022-04-18 20:20:00,190 INFO L226 Difference]: Without dead ends: 36522 [2022-04-18 20:20:00,191 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-18 20:20:00,191 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 121 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:20:00,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 74 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-18 20:20:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36522 states. [2022-04-18 20:20:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36522 to 36520. [2022-04-18 20:20:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36520 states, 36498 states have (on average 3.059921091566661) internal successors, (111681), 36519 states have internal predecessors, (111681), 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) [2022-04-18 20:20:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36520 states to 36520 states and 111681 transitions. [2022-04-18 20:20:01,203 INFO L78 Accepts]: Start accepts. Automaton has 36520 states and 111681 transitions. Word has length 32 [2022-04-18 20:20:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:20:01,204 INFO L478 AbstractCegarLoop]: Abstraction has 36520 states and 111681 transitions. [2022-04-18 20:20:01,204 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-04-18 20:20:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 36520 states and 111681 transitions. [2022-04-18 20:20:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-18 20:20:01,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:20:01,211 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:20:01,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-18 20:20:01,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-18 20:20:01,411 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:20:01,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:20:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1646181630, now seen corresponding path program 1 times [2022-04-18 20:20:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:20:01,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387287480] [2022-04-18 20:20:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:20:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:20:01,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:20:01,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486196890] [2022-04-18 20:20:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:20:01,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:20:01,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:20:01,426 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:20:01,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-18 20:20:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:20:01,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-18 20:20:01,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:20:01,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:20:01,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:01,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:20:01,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:01,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:20:02,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:20:02,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:20:02,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:20:02,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:20:02,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:20:02,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:20:02,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:20:02,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:20:02,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:20:02,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:20:02,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:20:02,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:20:02,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:20:02,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:02,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:20:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:20:02,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:20:02,802 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3281 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)))) (forall ((v_ArrVal_3281 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3281 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (forall ((v_ArrVal_3281 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:20:02,846 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:20:02,943 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:20:03,017 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:20:03,043 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse0 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0))) is different from false [2022-04-18 20:20:03,069 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse1 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_3276 (Array Int Int)) (v_ArrVal_3280 (Array Int Int)) (v_ArrVal_3281 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) .cse2 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3276) c_~F~0.base v_ArrVal_3280) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3281) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2)) 0))) is different from false [2022-04-18 20:20:03,122 INFO L356 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-04-18 20:20:03,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 57 [2022-04-18 20:20:03,130 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-04-18 20:20:03,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1132 treesize of output 1062 [2022-04-18 20:20:03,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 982 treesize of output 918 [2022-04-18 20:20:03,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 918 treesize of output 790 [2022-04-18 20:20:03,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 411 treesize of output 379 [2022-04-18 20:20:04,200 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:20:04,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-04-18 20:20:04,226 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:20:04,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 39 treesize of output 1 [2022-04-18 20:20:04,241 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:20:04,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-04-18 20:20:04,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:20:04,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-04-18 20:20:04,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:20:04,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:20:04,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 36 [2022-04-18 20:20:04,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-04-18 20:20:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:20:04,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:20:04,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387287480] [2022-04-18 20:20:04,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:20:04,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486196890] [2022-04-18 20:20:04,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486196890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:20:04,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [515664960] [2022-04-18 20:20:04,884 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:20:04,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:20:04,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-04-18 20:20:04,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719406835] [2022-04-18 20:20:04,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:20:04,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-18 20:20:04,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:20:04,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-18 20:20:04,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=606, Unknown=14, NotChecked=330, Total=1056 [2022-04-18 20:20:04,886 INFO L87 Difference]: Start difference. First operand 36520 states and 111681 transitions. Second operand has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 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) [2022-04-18 20:20:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:20:09,326 INFO L93 Difference]: Finished difference Result 59261 states and 175614 transitions. [2022-04-18 20:20:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-18 20:20:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 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) Word has length 32 [2022-04-18 20:20:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:20:09,504 INFO L225 Difference]: With dead ends: 59261 [2022-04-18 20:20:09,504 INFO L226 Difference]: Without dead ends: 59261 [2022-04-18 20:20:09,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 6 IntricatePredicates, 8 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=615, Invalid=2047, Unknown=14, NotChecked=630, Total=3306 [2022-04-18 20:20:09,505 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 701 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1830 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-18 20:20:09,505 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [701 Valid, 269 Invalid, 4124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2123 Invalid, 0 Unknown, 1830 Unchecked, 1.9s Time] [2022-04-18 20:20:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59261 states. [2022-04-18 20:20:10,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59261 to 41451. [2022-04-18 20:20:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41451 states, 41429 states have (on average 3.061116609138526) internal successors, (126819), 41450 states have internal predecessors, (126819), 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) [2022-04-18 20:20:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41451 states to 41451 states and 126819 transitions. [2022-04-18 20:20:10,605 INFO L78 Accepts]: Start accepts. Automaton has 41451 states and 126819 transitions. Word has length 32 [2022-04-18 20:20:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:20:10,606 INFO L478 AbstractCegarLoop]: Abstraction has 41451 states and 126819 transitions. [2022-04-18 20:20:10,606 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 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) [2022-04-18 20:20:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 41451 states and 126819 transitions. [2022-04-18 20:20:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-18 20:20:10,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:20:10,615 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:20:10,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-18 20:20:10,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:20:10,816 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:20:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:20:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash 625276412, now seen corresponding path program 2 times [2022-04-18 20:20:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:20:10,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027458489] [2022-04-18 20:20:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:20:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:20:10,838 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:20:10,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1445513575] [2022-04-18 20:20:10,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:20:10,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:20:10,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:20:10,840 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:20:10,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-18 20:20:11,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:20:11,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:20:11,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-18 20:20:11,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:20:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:20:11,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:20:11,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:20:11,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027458489] [2022-04-18 20:20:11,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:20:11,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445513575] [2022-04-18 20:20:11,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445513575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:20:11,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:20:11,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:20:11,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832976917] [2022-04-18 20:20:11,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:20:11,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:20:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:20:11,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:20:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:20:11,616 INFO L87 Difference]: Start difference. First operand 41451 states and 126819 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-04-18 20:20:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:20:11,970 INFO L93 Difference]: Finished difference Result 42830 states and 130149 transitions. [2022-04-18 20:20:11,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:20:11,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) Word has length 32 [2022-04-18 20:20:11,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:20:12,086 INFO L225 Difference]: With dead ends: 42830 [2022-04-18 20:20:12,086 INFO L226 Difference]: Without dead ends: 42815 [2022-04-18 20:20:12,086 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-18 20:20:12,087 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 90 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:20:12,087 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 213 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 150 Invalid, 0 Unknown, 67 Unchecked, 0.2s Time] [2022-04-18 20:20:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42815 states. [2022-04-18 20:20:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42815 to 42739. [2022-04-18 20:20:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42739 states, 42715 states have (on average 3.04375512115182) internal successors, (130014), 42738 states have internal predecessors, (130014), 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) [2022-04-18 20:20:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42739 states to 42739 states and 130014 transitions. [2022-04-18 20:20:13,398 INFO L78 Accepts]: Start accepts. Automaton has 42739 states and 130014 transitions. Word has length 32 [2022-04-18 20:20:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:20:13,398 INFO L478 AbstractCegarLoop]: Abstraction has 42739 states and 130014 transitions. [2022-04-18 20:20:13,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-04-18 20:20:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 42739 states and 130014 transitions. [2022-04-18 20:20:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-18 20:20:13,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:20:13,411 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:20:13,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-18 20:20:13,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:20:13,612 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:20:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:20:13,612 INFO L85 PathProgramCache]: Analyzing trace with hash 652722654, now seen corresponding path program 3 times [2022-04-18 20:20:13,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:20:13,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321314891] [2022-04-18 20:20:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:20:13,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:20:13,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:20:13,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711400061] [2022-04-18 20:20:13,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:20:13,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:20:13,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:20:13,912 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:20:13,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-18 20:20:19,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:20:19,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:20:19,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-18 20:20:19,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:20:19,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:20:20,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:20:20,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:20:20,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:20:20,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-04-18 20:20:20,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:20:20,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:20:20,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:20:20,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 20:20:20,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-04-18 20:20:20,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2022-04-18 20:20:20,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:20:20,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 59 [2022-04-18 20:20:20,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,832 INFO L356 Elim1Store]: treesize reduction 396, result has 16.3 percent of original size [2022-04-18 20:20:20,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 97 treesize of output 117 [2022-04-18 20:20:20,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:20,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,057 INFO L356 Elim1Store]: treesize reduction 663, result has 12.3 percent of original size [2022-04-18 20:20:21,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 13 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 114 treesize of output 137 [2022-04-18 20:20:21,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:21,414 INFO L356 Elim1Store]: treesize reduction 800, result has 24.7 percent of original size [2022-04-18 20:20:21,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 13 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 131 treesize of output 309 [2022-04-18 20:20:22,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:22,266 INFO L356 Elim1Store]: treesize reduction 952, result has 10.4 percent of original size [2022-04-18 20:20:22,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 13 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 283 treesize of output 309 [2022-04-18 20:20:23,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:23,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:20:23,655 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-18 20:20:23,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 66 [2022-04-18 20:20:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:20:23,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:20:23,811 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:20:24,541 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse0 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse1 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse0 .cse1) 0) (+ ~F~0.offset .cse0 .cse1 1) 0) (+ ~F~0.offset 2 .cse0 .cse1) 0) (+ ~F~0.offset .cse0 3 .cse1) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse2 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse3 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse2 .cse3) 0) (+ ~F~0.offset .cse2 .cse3 1) 0) (+ ~F~0.offset 2 .cse2 .cse3) 0) (+ ~F~0.offset .cse2 3 .cse3) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse4 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse5 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse4 .cse5) 0) (+ ~F~0.offset .cse4 .cse5 1) 0) (+ ~F~0.offset 2 .cse4 .cse5) 0) (+ ~F~0.offset .cse4 3 .cse5) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse6 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse7 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse6 .cse7) 0) (+ ~F~0.offset .cse6 .cse7 1) 0) (+ ~F~0.offset 2 .cse6 .cse7) 0) (+ ~F~0.offset .cse6 3 .cse7) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:20:31,023 WARN L232 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:20:44,727 WARN L232 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:21:09,993 WARN L232 SmtUtils]: Spent 19.91s on a formula simplification. DAG size of input: 69 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 20:21:29,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3621 Int) (v_ArrVal_3619 Int)) (let ((.cse23 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse2 (+ .cse23 c_~B~0.offset)) (.cse21 (+ .cse23 c_~B~0.offset 1)) (.cse1 (+ .cse23 2 c_~B~0.offset))) (let ((.cse0 (select (let ((.cse22 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse2 v_ArrVal_3617) .cse21 v_ArrVal_3619) .cse1 v_ArrVal_3621)))) (store .cse22 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse3 (let ((.cse7 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse6 (let ((.cse8 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) (+ .cse7 c_~B~0.offset) v_ArrVal_3617) (+ .cse7 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse7 2 c_~B~0.offset) v_ArrVal_3621)))) (store .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse6 c_~B~0.base (store (select .cse6 c_~B~0.base) (+ .cse7 3 c_~B~0.offset) 0)))))) (store .cse3 ~F~0.base (let ((.cse4 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse5 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse3 ~F~0.base) (+ ~F~0.offset .cse4 .cse5) 0) (+ ~F~0.offset .cse4 .cse5 1) 0) (+ ~F~0.offset 2 .cse4 .cse5) 0) (+ ~F~0.offset .cse4 3 .cse5) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= 0 (select (select (store (let ((.cse9 (let ((.cse13 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse12 (let ((.cse14 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) (+ .cse13 c_~B~0.offset) v_ArrVal_3617) (+ .cse13 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse13 2 c_~B~0.offset) v_ArrVal_3621)))) (store .cse14 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse12 c_~B~0.base (store (select .cse12 c_~B~0.base) (+ .cse13 3 c_~B~0.offset) 0)))))) (store .cse9 ~F~0.base (let ((.cse10 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse11 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse9 ~F~0.base) (+ ~F~0.offset .cse10 .cse11) 0) (+ ~F~0.offset .cse10 .cse11 1) 0) (+ ~F~0.offset 2 .cse10 .cse11) 0) (+ ~F~0.offset .cse10 3 .cse11) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= 0 (select (select (store (let ((.cse15 (let ((.cse19 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse18 (let ((.cse20 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) (+ .cse19 c_~B~0.offset) v_ArrVal_3617) (+ .cse19 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse19 2 c_~B~0.offset) v_ArrVal_3621)))) (store .cse20 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse18 c_~B~0.base (store (select .cse18 c_~B~0.base) (+ .cse19 3 c_~B~0.offset) 0)))))) (store .cse15 ~F~0.base (let ((.cse16 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse17 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse15 ~F~0.base) (+ ~F~0.offset .cse16 .cse17) 0) (+ ~F~0.offset .cse16 .cse17 1) 0) (+ ~F~0.offset 2 .cse16 .cse17) 0) (+ ~F~0.offset .cse16 3 .cse17) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (not (= (select .cse0 .cse21) 0))))))) is different from false [2022-04-18 20:21:30,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3621 Int) (v_ArrVal_3619 Int)) (let ((.cse28 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse23 (+ .cse28 c_~B~0.offset)) (.cse24 (+ .cse28 c_~B~0.offset 1)) (.cse25 (+ .cse28 2 c_~B~0.offset))) (let ((.cse22 (select (let ((.cse26 (let ((.cse27 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse27 c_~B~0.base (store (store (store (select .cse27 c_~B~0.base) .cse23 v_ArrVal_3617) .cse24 v_ArrVal_3619) .cse25 v_ArrVal_3621))))) (store .cse26 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base))) (or (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse0 (let ((.cse4 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse6 c_~B~0.base (store (store (store (select .cse6 c_~B~0.base) (+ .cse4 c_~B~0.offset) v_ArrVal_3617) (+ .cse4 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse4 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse3 c_~B~0.base (store (select .cse3 c_~B~0.base) (+ .cse4 3 c_~B~0.offset) 0)))))) (store .cse0 ~F~0.base (let ((.cse1 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse2 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse0 ~F~0.base) (+ ~F~0.offset .cse1 .cse2) 0) (+ ~F~0.offset .cse1 .cse2 1) 0) (+ ~F~0.offset 2 .cse1 .cse2) 0) (+ ~F~0.offset .cse1 3 .cse2) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse7 (let ((.cse11 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse13 c_~B~0.base (store (store (store (select .cse13 c_~B~0.base) (+ .cse11 c_~B~0.offset) v_ArrVal_3617) (+ .cse11 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse11 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse12 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse10 c_~B~0.base (store (select .cse10 c_~B~0.base) (+ .cse11 3 c_~B~0.offset) 0)))))) (store .cse7 ~F~0.base (let ((.cse8 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse9 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse7 ~F~0.base) (+ ~F~0.offset .cse8 .cse9) 0) (+ ~F~0.offset .cse8 .cse9 1) 0) (+ ~F~0.offset 2 .cse8 .cse9) 0) (+ ~F~0.offset .cse8 3 .cse9) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (let ((.cse21 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (let ((.cse14 (let ((.cse18 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse21 0)))) (store .cse20 c_~B~0.base (store (store (store (select .cse20 c_~B~0.base) (+ .cse18 c_~B~0.offset) v_ArrVal_3617) (+ .cse18 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse18 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse19 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse17 c_~B~0.base (store (select .cse17 c_~B~0.base) (+ .cse18 3 c_~B~0.offset) 0)))))) (store .cse14 ~F~0.base (let ((.cse15 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse16 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse14 ~F~0.base) (+ ~F~0.offset .cse15 .cse16) 0) (+ ~F~0.offset .cse15 .cse16 1) 0) (+ ~F~0.offset 2 .cse15 .cse16) 0) (+ ~F~0.offset .cse15 3 .cse16) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse21)) 0))) (not (= (select .cse22 .cse23) 0)) (not (= 0 (select .cse22 .cse24))) (not (= (select .cse22 .cse25) 0))))))) is different from false [2022-04-18 20:21:31,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3617 Int) (v_ArrVal_3621 Int) (v_ArrVal_3619 Int)) (let ((.cse29 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (+ .cse29 c_~B~0.offset)) (.cse3 (+ .cse29 c_~B~0.offset 1)) (.cse2 (+ .cse29 2 c_~B~0.offset))) (let ((.cse0 (select (let ((.cse27 (let ((.cse28 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse28 c_~B~0.base (store (store (store (select .cse28 c_~B~0.base) .cse1 v_ArrVal_3617) .cse3 v_ArrVal_3619) .cse2 v_ArrVal_3621))))) (store .cse27 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (not (= (select .cse0 .cse3) 0)) (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (let ((.cse4 (let ((.cse8 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse11 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse10 c_~B~0.base (store (store (store (select .cse10 c_~B~0.base) (+ .cse8 c_~B~0.offset) v_ArrVal_3617) (+ .cse8 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse8 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse9 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse7 c_~B~0.base (store (select .cse7 c_~B~0.base) (+ .cse8 3 c_~B~0.offset) 0)))))) (store .cse4 ~F~0.base (let ((.cse5 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse6 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse4 ~F~0.base) (+ ~F~0.offset .cse5 .cse6) 0) (+ ~F~0.offset .cse5 .cse6 1) 0) (+ ~F~0.offset 2 .cse5 .cse6) 0) (+ ~F~0.offset .cse5 3 .cse6) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse11)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse12 (let ((.cse16 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse18 c_~B~0.base (store (store (store (select .cse18 c_~B~0.base) (+ .cse16 c_~B~0.offset) v_ArrVal_3617) (+ .cse16 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse16 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse17 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse15 c_~B~0.base (store (select .cse15 c_~B~0.base) (+ .cse16 3 c_~B~0.offset) 0)))))) (store .cse12 ~F~0.base (let ((.cse13 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse14 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse12 ~F~0.base) (+ ~F~0.offset .cse13 .cse14) 0) (+ ~F~0.offset .cse13 .cse14 1) 0) (+ ~F~0.offset 2 .cse13 .cse14) 0) (+ ~F~0.offset .cse13 3 .cse14) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (let ((.cse26 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (let ((.cse19 (let ((.cse23 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse22 (let ((.cse24 (let ((.cse25 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) .cse26 0)))) (store .cse25 c_~B~0.base (store (store (store (select .cse25 c_~B~0.base) (+ .cse23 c_~B~0.offset) v_ArrVal_3617) (+ .cse23 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse23 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse24 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse22 c_~B~0.base (store (select .cse22 c_~B~0.base) (+ .cse23 3 c_~B~0.offset) 0)))))) (store .cse19 ~F~0.base (let ((.cse20 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse21 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse19 ~F~0.base) (+ ~F~0.offset .cse20 .cse21) 0) (+ ~F~0.offset .cse20 .cse21 1) 0) (+ ~F~0.offset 2 .cse20 .cse21) 0) (+ ~F~0.offset .cse20 3 .cse21) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse26)) 0)))))))) is different from false [2022-04-18 20:21:40,249 WARN L232 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 906 DAG size of output: 195 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-18 20:21:40,250 INFO L356 Elim1Store]: treesize reduction 21825, result has 2.8 percent of original size [2022-04-18 20:21:40,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 36 case distinctions, treesize of input 3770 treesize of output 2654 [2022-04-18 20:21:40,583 INFO L356 Elim1Store]: treesize reduction 176, result has 12.4 percent of original size [2022-04-18 20:21:40,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 366 treesize of output 360 [2022-04-18 20:21:40,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 43 [2022-04-18 20:21:40,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:21:40,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 15546 treesize of output 15582 [2022-04-18 20:21:41,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 275 treesize of output 259 [2022-04-18 20:21:41,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 259 treesize of output 255 [2022-04-18 20:21:45,477 INFO L356 Elim1Store]: treesize reduction 165, result has 0.6 percent of original size [2022-04-18 20:21:45,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 17 [2022-04-18 20:21:46,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:46,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:46,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:46,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:46,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:46,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:46,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 267 treesize of output 226 [2022-04-18 20:21:47,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:47,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:47,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:47,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:47,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:47,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:47,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-04-18 20:21:48,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-04-18 20:21:48,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:48,709 INFO L356 Elim1Store]: treesize reduction 228, result has 0.4 percent of original size [2022-04-18 20:21:48,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 94 treesize of output 53 [2022-04-18 20:21:49,569 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-04-18 20:21:50,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:50,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:50,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:50,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:50,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:50,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:50,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 521 treesize of output 493 [2022-04-18 20:21:52,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:52,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:21:52,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 377 treesize of output 480 [2022-04-18 20:21:54,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:54,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:54,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:54,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:54,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:54,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:54,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-04-18 20:21:55,143 INFO L356 Elim1Store]: treesize reduction 165, result has 0.6 percent of original size [2022-04-18 20:21:55,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 17 [2022-04-18 20:21:55,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:55,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:55,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:55,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:55,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:55,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:21:55,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2022-04-18 20:21:55,621 INFO L356 Elim1Store]: treesize reduction 189, result has 52.8 percent of original size [2022-04-18 20:21:55,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 256 treesize of output 391 [2022-04-18 20:21:55,905 INFO L356 Elim1Store]: treesize reduction 165, result has 0.6 percent of original size [2022-04-18 20:21:55,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 17 [2022-04-18 20:21:57,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3609 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3609) c_~B~0.base) c_~B~0.offset)))) is different from false [2022-04-18 20:21:57,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3608 (Array Int Int)) (v_ArrVal_3609 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3608) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3609) c_~B~0.base) c_~B~0.offset)))) is different from false [2022-04-18 20:21:57,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:21:57,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2022-04-18 20:21:57,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:21:57,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 68 [2022-04-18 20:21:57,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 50 [2022-04-18 20:21:57,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-04-18 20:21:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-04-18 20:21:58,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:21:58,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321314891] [2022-04-18 20:21:58,638 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:21:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711400061] [2022-04-18 20:21:58,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711400061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:21:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [966749894] [2022-04-18 20:21:58,639 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:21:58,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:21:58,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 42 [2022-04-18 20:21:58,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612991639] [2022-04-18 20:21:58,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:21:58,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-18 20:21:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:21:58,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-18 20:21:58,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1126, Unknown=22, NotChecked=532, Total=1892 [2022-04-18 20:21:58,642 INFO L87 Difference]: Start difference. First operand 42739 states and 130014 transitions. Second operand has 44 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 43 states have internal predecessors, (64), 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) [2022-04-18 20:22:03,010 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~B~0.base 1)) (.cse31 (+ (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset) 1))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (< .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_3617 Int) (v_ArrVal_3621 Int) (v_ArrVal_3619 Int)) (let ((.cse30 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse2 (+ .cse30 c_~B~0.offset)) (.cse4 (+ .cse30 c_~B~0.offset 1)) (.cse3 (+ .cse30 2 c_~B~0.offset))) (let ((.cse1 (select (let ((.cse28 (let ((.cse29 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse29 c_~B~0.base (store (store (store (select .cse29 c_~B~0.base) .cse2 v_ArrVal_3617) .cse4 v_ArrVal_3619) .cse3 v_ArrVal_3621))))) (store .cse28 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base))) (or (not (= (select .cse1 .cse2) 0)) (not (= (select .cse1 .cse3) 0)) (not (= (select .cse1 .cse4) 0)) (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (let ((.cse12 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (let ((.cse5 (let ((.cse9 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse12 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse11 c_~B~0.base (store (store (store (select .cse11 c_~B~0.base) (+ .cse9 c_~B~0.offset) v_ArrVal_3617) (+ .cse9 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse9 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse10 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse8 c_~B~0.base (store (select .cse8 c_~B~0.base) (+ .cse9 3 c_~B~0.offset) 0)))))) (store .cse5 ~F~0.base (let ((.cse6 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse7 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse5 ~F~0.base) (+ ~F~0.offset .cse6 .cse7) 0) (+ ~F~0.offset .cse6 .cse7 1) 0) (+ ~F~0.offset 2 .cse6 .cse7) 0) (+ ~F~0.offset .cse6 3 .cse7) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse12)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse13 (let ((.cse17 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse16 (let ((.cse18 (let ((.cse19 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse19 c_~B~0.base (store (store (store (select .cse19 c_~B~0.base) (+ .cse17 c_~B~0.offset) v_ArrVal_3617) (+ .cse17 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse17 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse18 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse16 c_~B~0.base (store (select .cse16 c_~B~0.base) (+ .cse17 3 c_~B~0.offset) 0)))))) (store .cse13 ~F~0.base (let ((.cse14 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse15 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse13 ~F~0.base) (+ ~F~0.offset .cse14 .cse15) 0) (+ ~F~0.offset .cse14 .cse15 1) 0) (+ ~F~0.offset 2 .cse14 .cse15) 0) (+ ~F~0.offset .cse14 3 .cse15) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (let ((.cse27 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (let ((.cse20 (let ((.cse24 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse23 (let ((.cse25 (let ((.cse26 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) .cse27 0)))) (store .cse26 c_~B~0.base (store (store (store (select .cse26 c_~B~0.base) (+ .cse24 c_~B~0.offset) v_ArrVal_3617) (+ .cse24 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse24 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse25 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse25 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse23 c_~B~0.base (store (select .cse23 c_~B~0.base) (+ .cse24 3 c_~B~0.offset) 0)))))) (store .cse20 ~F~0.base (let ((.cse21 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse22 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse20 ~F~0.base) (+ ~F~0.offset .cse21 .cse22) 0) (+ ~F~0.offset .cse21 .cse22 1) 0) (+ ~F~0.offset 2 .cse21 .cse22) 0) (+ ~F~0.offset .cse21 3 .cse22) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse27)) 0)))))))) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (= c_~B~0.offset 0) (< .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= c_thread2Thread1of1ForFork1_~i~1 0) (< .cse31 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (< .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-04-18 20:22:05,202 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_3617 Int) (v_ArrVal_3621 Int) (v_ArrVal_3619 Int)) (let ((.cse28 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse23 (+ .cse28 c_~B~0.offset)) (.cse24 (+ .cse28 c_~B~0.offset 1)) (.cse25 (+ .cse28 2 c_~B~0.offset))) (let ((.cse22 (select (let ((.cse26 (let ((.cse27 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse27 c_~B~0.base (store (store (store (select .cse27 c_~B~0.base) .cse23 v_ArrVal_3617) .cse24 v_ArrVal_3619) .cse25 v_ArrVal_3621))))) (store .cse26 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base))) (or (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse0 (let ((.cse4 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse3 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse6 c_~B~0.base (store (store (store (select .cse6 c_~B~0.base) (+ .cse4 c_~B~0.offset) v_ArrVal_3617) (+ .cse4 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse4 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse3 c_~B~0.base (store (select .cse3 c_~B~0.base) (+ .cse4 3 c_~B~0.offset) 0)))))) (store .cse0 ~F~0.base (let ((.cse1 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse2 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse0 ~F~0.base) (+ ~F~0.offset .cse1 .cse2) 0) (+ ~F~0.offset .cse1 .cse2 1) 0) (+ ~F~0.offset 2 .cse1 .cse2) 0) (+ ~F~0.offset .cse1 3 .cse2) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse7 (let ((.cse11 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse13 c_~B~0.base (store (store (store (select .cse13 c_~B~0.base) (+ .cse11 c_~B~0.offset) v_ArrVal_3617) (+ .cse11 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse11 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse12 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse10 c_~B~0.base (store (select .cse10 c_~B~0.base) (+ .cse11 3 c_~B~0.offset) 0)))))) (store .cse7 ~F~0.base (let ((.cse8 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse9 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse7 ~F~0.base) (+ ~F~0.offset .cse8 .cse9) 0) (+ ~F~0.offset .cse8 .cse9 1) 0) (+ ~F~0.offset 2 .cse8 .cse9) 0) (+ ~F~0.offset .cse8 3 .cse9) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (let ((.cse21 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (let ((.cse14 (let ((.cse18 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse17 (let ((.cse19 (let ((.cse20 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse21 0)))) (store .cse20 c_~B~0.base (store (store (store (select .cse20 c_~B~0.base) (+ .cse18 c_~B~0.offset) v_ArrVal_3617) (+ .cse18 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse18 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse19 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse17 c_~B~0.base (store (select .cse17 c_~B~0.base) (+ .cse18 3 c_~B~0.offset) 0)))))) (store .cse14 ~F~0.base (let ((.cse15 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse16 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse14 ~F~0.base) (+ ~F~0.offset .cse15 .cse16) 0) (+ ~F~0.offset .cse15 .cse16 1) 0) (+ ~F~0.offset 2 .cse15 .cse16) 0) (+ ~F~0.offset .cse15 3 .cse16) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse21)) 0))) (not (= (select .cse22 .cse23) 0)) (not (= 0 (select .cse22 .cse24))) (not (= (select .cse22 .cse25) 0))))))) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (= c_~B~0.offset 0) (< (+ c_~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse29 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select .cse29 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:22:09,113 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_3617 Int) (v_ArrVal_3621 Int) (v_ArrVal_3619 Int)) (let ((.cse23 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse2 (+ .cse23 c_~B~0.offset)) (.cse21 (+ .cse23 c_~B~0.offset 1)) (.cse1 (+ .cse23 2 c_~B~0.offset))) (let ((.cse0 (select (let ((.cse22 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse2 v_ArrVal_3617) .cse21 v_ArrVal_3619) .cse1 v_ArrVal_3621)))) (store .cse22 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse3 (let ((.cse7 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse6 (let ((.cse8 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) (+ .cse7 c_~B~0.offset) v_ArrVal_3617) (+ .cse7 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse7 2 c_~B~0.offset) v_ArrVal_3621)))) (store .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse6 c_~B~0.base (store (select .cse6 c_~B~0.base) (+ .cse7 3 c_~B~0.offset) 0)))))) (store .cse3 ~F~0.base (let ((.cse4 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse5 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse3 ~F~0.base) (+ ~F~0.offset .cse4 .cse5) 0) (+ ~F~0.offset .cse4 .cse5 1) 0) (+ ~F~0.offset 2 .cse4 .cse5) 0) (+ ~F~0.offset .cse4 3 .cse5) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= 0 (select (select (store (let ((.cse9 (let ((.cse13 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse12 (let ((.cse14 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) (+ .cse13 c_~B~0.offset) v_ArrVal_3617) (+ .cse13 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse13 2 c_~B~0.offset) v_ArrVal_3621)))) (store .cse14 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse12 c_~B~0.base (store (select .cse12 c_~B~0.base) (+ .cse13 3 c_~B~0.offset) 0)))))) (store .cse9 ~F~0.base (let ((.cse10 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse11 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse9 ~F~0.base) (+ ~F~0.offset .cse10 .cse11) 0) (+ ~F~0.offset .cse10 .cse11 1) 0) (+ ~F~0.offset 2 .cse10 .cse11) 0) (+ ~F~0.offset .cse10 3 .cse11) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= 0 (select (select (store (let ((.cse15 (let ((.cse19 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse18 (let ((.cse20 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) (+ .cse19 c_~B~0.offset) v_ArrVal_3617) (+ .cse19 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse19 2 c_~B~0.offset) v_ArrVal_3621)))) (store .cse20 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse18 c_~B~0.base (store (select .cse18 c_~B~0.base) (+ .cse19 3 c_~B~0.offset) 0)))))) (store .cse15 ~F~0.base (let ((.cse16 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse17 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse15 ~F~0.base) (+ ~F~0.offset .cse16 .cse17) 0) (+ ~F~0.offset .cse16 .cse17 1) 0) (+ ~F~0.offset 2 .cse16 .cse17) 0) (+ ~F~0.offset .cse16 3 .cse17) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) (not (= (select .cse0 .cse21) 0))))))) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (= c_~B~0.offset 0) (< (+ c_~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse24 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse24 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select .cse24 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:22:12,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse0 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse1 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse0 .cse1) 0) (+ ~F~0.offset .cse0 .cse1 1) 0) (+ ~F~0.offset 2 .cse0 .cse1) 0) (+ ~F~0.offset .cse0 3 .cse1) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse2 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse3 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse2 .cse3) 0) (+ ~F~0.offset .cse2 .cse3 1) 0) (+ ~F~0.offset 2 .cse2 .cse3) 0) (+ ~F~0.offset .cse2 3 .cse3) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (= (select (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset)) 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse4 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse5 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse4 .cse5) 0) (+ ~F~0.offset .cse4 .cse5 1) 0) (+ ~F~0.offset 2 .cse4 .cse5) 0) (+ ~F~0.offset .cse4 3 .cse5) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0) (= c_~B~0.offset 0) (< (+ c_~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse7 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse8 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse7 .cse8) 0) (+ ~F~0.offset .cse7 .cse8 1) 0) (+ ~F~0.offset 2 .cse7 .cse8) 0) (+ ~F~0.offset .cse7 3 .cse8) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (exists ((~B~0.base Int)) (let ((.cse9 (select |c_#race| ~B~0.base)) (.cse10 (* c_thread2Thread1of1ForFork1_~i~1 4))) (and (= (select .cse9 (+ .cse10 2)) 0) (= (select .cse9 (+ .cse10 1)) 0) (= (select .cse9 (+ .cse10 3)) 0) (< (+ ~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse9 .cse10) 0)))))) is different from false [2022-04-18 20:22:14,475 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse0 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse1 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse0 .cse1) 0) (+ ~F~0.offset .cse0 .cse1 1) 0) (+ ~F~0.offset 2 .cse0 .cse1) 0) (+ ~F~0.offset .cse0 3 .cse1) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse2 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse3 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse2 .cse3) 0) (+ ~F~0.offset .cse2 .cse3 1) 0) (+ ~F~0.offset 2 .cse2 .cse3) 0) (+ ~F~0.offset .cse2 3 .cse3) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (= (select (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset)) 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse4 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse5 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse4 .cse5) 0) (+ ~F~0.offset .cse4 .cse5 1) 0) (+ ~F~0.offset 2 .cse4 .cse5) 0) (+ ~F~0.offset .cse4 3 .cse5) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0) (= c_~B~0.offset 0) (< (+ c_~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse7 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse8 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse7 .cse8) 0) (+ ~F~0.offset .cse7 .cse8 1) 0) (+ ~F~0.offset 2 .cse7 .cse8) 0) (+ ~F~0.offset .cse7 3 .cse8) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:22:17,086 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse0 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse1 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse0 .cse1) 0) (+ ~F~0.offset .cse0 .cse1 1) 0) (+ ~F~0.offset 2 .cse0 .cse1) 0) (+ ~F~0.offset .cse0 3 .cse1) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse2 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse3 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse2 .cse3) 0) (+ ~F~0.offset .cse2 .cse3 1) 0) (+ ~F~0.offset 2 .cse2 .cse3) 0) (+ ~F~0.offset .cse2 3 .cse3) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse4 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse5 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse4 .cse5) 0) (+ ~F~0.offset .cse4 .cse5 1) 0) (+ ~F~0.offset 2 .cse4 .cse5) 0) (+ ~F~0.offset .cse4 3 .cse5) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse7 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse8 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse7 .cse8) 0) (+ ~F~0.offset .cse7 .cse8 1) 0) (+ ~F~0.offset 2 .cse7 .cse8) 0) (+ ~F~0.offset .cse7 3 .cse8) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (exists ((~B~0.base Int)) (let ((.cse9 (select |c_#race| ~B~0.base)) (.cse10 (* c_thread2Thread1of1ForFork1_~i~1 4))) (and (= (select .cse9 (+ .cse10 2)) 0) (= (select .cse9 (+ .cse10 1)) 0) (= (select .cse9 (+ .cse10 3)) 0) (< (+ ~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse9 .cse10) 0)))))) is different from false [2022-04-18 20:22:21,701 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~B~0.base 1)) (.cse7 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset) 1))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse0 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse1 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse0 .cse1) 0) (+ ~F~0.offset .cse0 .cse1 1) 0) (+ ~F~0.offset 2 .cse0 .cse1) 0) (+ ~F~0.offset .cse0 3 .cse1) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse2 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse3 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse2 .cse3) 0) (+ ~F~0.offset .cse2 .cse3 1) 0) (+ ~F~0.offset 2 .cse2 .cse3) 0) (+ ~F~0.offset .cse2 3 .cse3) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset)) 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse5 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse6 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse5 .cse6) 0) (+ ~F~0.offset .cse5 .cse6 1) 0) (+ ~F~0.offset 2 .cse5 .cse6) 0) (+ ~F~0.offset .cse5 3 .cse6) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0) (= c_~B~0.offset 0) (< .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (< .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse9 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse10 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse9 .cse10) 0) (+ ~F~0.offset .cse9 .cse10 1) 0) (+ ~F~0.offset 2 .cse9 .cse10) 0) (+ ~F~0.offset .cse9 3 .cse10) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (= (select .cse7 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (exists ((~B~0.base Int)) (let ((.cse11 (select |c_#race| ~B~0.base)) (.cse12 (* c_thread2Thread1of1ForFork1_~i~1 4))) (and (= (select .cse11 (+ .cse12 2)) 0) (= (select .cse11 (+ .cse12 1)) 0) (= (select .cse11 (+ .cse12 3)) 0) (< (+ ~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse11 .cse12) 0)))) (< .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-04-18 20:22:23,791 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~B~0.base 1)) (.cse7 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse8 (+ (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset) 1))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse0 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse1 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse0 .cse1) 0) (+ ~F~0.offset .cse0 .cse1 1) 0) (+ ~F~0.offset 2 .cse0 .cse1) 0) (+ ~F~0.offset .cse0 3 .cse1) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse2 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse3 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse2 .cse3) 0) (+ ~F~0.offset .cse2 .cse3 1) 0) (+ ~F~0.offset 2 .cse2 .cse3) 0) (+ ~F~0.offset .cse2 3 .cse3) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (< .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset)) 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse5 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse6 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse5 .cse6) 0) (+ ~F~0.offset .cse5 .cse6 1) 0) (+ ~F~0.offset 2 .cse5 .cse6) 0) (+ ~F~0.offset .cse5 3 .cse6) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0) (= c_~B~0.offset 0) (< .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse7 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (< .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse9 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse10 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse9 .cse10) 0) (+ ~F~0.offset .cse9 .cse10 1) 0) (+ ~F~0.offset 2 .cse9 .cse10) 0) (+ ~F~0.offset .cse9 3 .cse10) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (= (select .cse7 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (< .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-04-18 20:22:26,054 WARN L833 $PredicateComparison]: unable to prove that (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_3617 Int) (v_ArrVal_3621 Int) (v_ArrVal_3619 Int)) (let ((.cse29 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (+ .cse29 c_~B~0.offset)) (.cse3 (+ .cse29 c_~B~0.offset 1)) (.cse2 (+ .cse29 2 c_~B~0.offset))) (let ((.cse0 (select (let ((.cse27 (let ((.cse28 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse28 c_~B~0.base (store (store (store (select .cse28 c_~B~0.base) .cse1 v_ArrVal_3617) .cse3 v_ArrVal_3619) .cse2 v_ArrVal_3621))))) (store .cse27 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select .cse0 .cse2) 0)) (not (= (select .cse0 .cse3) 0)) (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (let ((.cse4 (let ((.cse8 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse11 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse10 c_~B~0.base (store (store (store (select .cse10 c_~B~0.base) (+ .cse8 c_~B~0.offset) v_ArrVal_3617) (+ .cse8 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse8 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse9 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse7 c_~B~0.base (store (select .cse7 c_~B~0.base) (+ .cse8 3 c_~B~0.offset) 0)))))) (store .cse4 ~F~0.base (let ((.cse5 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse6 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse4 ~F~0.base) (+ ~F~0.offset .cse5 .cse6) 0) (+ ~F~0.offset .cse5 .cse6 1) 0) (+ ~F~0.offset 2 .cse5 .cse6) 0) (+ ~F~0.offset .cse5 3 .cse6) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse11)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse12 (let ((.cse16 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)))) (store .cse18 c_~B~0.base (store (store (store (select .cse18 c_~B~0.base) (+ .cse16 c_~B~0.offset) v_ArrVal_3617) (+ .cse16 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse16 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse17 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse15 c_~B~0.base (store (select .cse15 c_~B~0.base) (+ .cse16 3 c_~B~0.offset) 0)))))) (store .cse12 ~F~0.base (let ((.cse13 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse14 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse12 ~F~0.base) (+ ~F~0.offset .cse13 .cse14) 0) (+ ~F~0.offset .cse13 .cse14 1) 0) (+ ~F~0.offset 2 .cse13 .cse14) 0) (+ ~F~0.offset .cse13 3 .cse14) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (let ((.cse26 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (let ((.cse19 (let ((.cse23 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse22 (let ((.cse24 (let ((.cse25 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) .cse26 0)))) (store .cse25 c_~B~0.base (store (store (store (select .cse25 c_~B~0.base) (+ .cse23 c_~B~0.offset) v_ArrVal_3617) (+ .cse23 c_~B~0.offset 1) v_ArrVal_3619) (+ .cse23 2 c_~B~0.offset) v_ArrVal_3621))))) (store .cse24 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse22 c_~B~0.base (store (select .cse22 c_~B~0.base) (+ .cse23 3 c_~B~0.offset) 0)))))) (store .cse19 ~F~0.base (let ((.cse20 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse21 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse19 ~F~0.base) (+ ~F~0.offset .cse20 .cse21) 0) (+ ~F~0.offset .cse20 .cse21 1) 0) (+ ~F~0.offset 2 .cse20 .cse21) 0) (+ ~F~0.offset .cse20 3 .cse21) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse26)) 0)))))))) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (= c_~B~0.offset 0) (< (+ c_~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)) is different from false [2022-04-18 20:22:28,175 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (let ((.cse1 (select |c_#race| c_~F~0.base)) (.cse2 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse3 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (or (not (= (select .cse1 (+ .cse2 .cse3 c_~F~0.offset)) 0)) (and (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (store (select |c_#race| c_~F~0.base) (+ 3 (* c_thread2Thread1of1ForFork1_~j~0 4) (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4) c_~F~0.offset) 0)) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (store (select |c_#race| c_~F~0.base) (+ 3 (* c_thread2Thread1of1ForFork1_~j~0 4) (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4) c_~F~0.offset) 0)) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (store (select |c_#race| c_~F~0.base) (+ 3 (* c_thread2Thread1of1ForFork1_~j~0 4) (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4) c_~F~0.offset) 0)) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (store (select |c_#race| c_~F~0.base) (+ 3 (* c_thread2Thread1of1ForFork1_~j~0 4) (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4) c_~F~0.offset) 0)) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) (not (= (select .cse1 (+ 2 .cse2 .cse3 c_~F~0.offset)) 0)) (not (= 0 (select .cse1 (+ .cse2 .cse3 c_~F~0.offset 1)))))))) is different from false [2022-04-18 20:22:41,434 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#race| c_~B~0.base)) (.cse32 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse0 (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) (.cse17 (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) (.cse18 (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) (.cse2 (not (= (select .cse31 (+ .cse32 2 c_~B~0.offset)) 0))) (.cse3 (not (= (select .cse31 (+ .cse32 c_~B~0.offset 1)) 0))) (.cse16 (not (= (select .cse31 (+ .cse32 c_~B~0.offset)) 0))) (.cse22 (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0) (= c_~B~0.offset 0) (< (+ c_~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse2 .cse3 (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0)))) (store .cse4 ~F~0.base (let ((.cse5 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse6 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse4 ~F~0.base) (+ ~F~0.offset .cse5 .cse6) 0) (+ ~F~0.offset .cse5 .cse6 1) 0) (+ ~F~0.offset 2 .cse5 .cse6) 0) (+ ~F~0.offset .cse5 3 .cse6) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse7 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0)))) (store .cse7 ~F~0.base (let ((.cse8 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse9 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse7 ~F~0.base) (+ ~F~0.offset .cse8 .cse9) 0) (+ ~F~0.offset .cse8 .cse9 1) 0) (+ ~F~0.offset 2 .cse8 .cse9) 0) (+ ~F~0.offset .cse8 3 .cse9) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse10 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0)))) (store .cse10 ~F~0.base (let ((.cse11 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse12 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse10 ~F~0.base) (+ ~F~0.offset .cse11 .cse12) 0) (+ ~F~0.offset .cse11 .cse12 1) 0) (+ ~F~0.offset 2 .cse11 .cse12) 0) (+ ~F~0.offset .cse11 3 .cse12) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse13 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0)))) (store .cse13 ~F~0.base (let ((.cse14 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse15 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse13 ~F~0.base) (+ ~F~0.offset .cse14 .cse15) 0) (+ ~F~0.offset .cse14 .cse15 1) 0) (+ ~F~0.offset 2 .cse14 .cse15) 0) (+ ~F~0.offset .cse14 3 .cse15) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) .cse16) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) .cse17 .cse18 (let ((.cse19 (select |c_#race| c_~F~0.base)) (.cse20 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse21 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (or (not (= (select .cse19 (+ .cse20 .cse21 c_~F~0.offset)) 0)) (and .cse0 .cse17 .cse18 .cse22) (not (= (select .cse19 (+ 2 .cse20 .cse21 c_~F~0.offset)) 0)) (not (= 0 (select .cse19 (+ .cse20 .cse21 c_~F~0.offset 1)))))) (or .cse2 .cse3 (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse23 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse24 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse23 .cse24) 0) (+ ~F~0.offset .cse23 .cse24 1) 0) (+ ~F~0.offset 2 .cse23 .cse24) 0) (+ ~F~0.offset .cse23 3 .cse24) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse25 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse26 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse25 .cse26) 0) (+ ~F~0.offset .cse25 .cse26 1) 0) (+ ~F~0.offset 2 .cse25 .cse26) 0) (+ ~F~0.offset .cse25 3 .cse26) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse27 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse28 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse27 .cse28) 0) (+ ~F~0.offset .cse27 .cse28 1) 0) (+ ~F~0.offset 2 .cse27 .cse28) 0) (+ ~F~0.offset .cse27 3 .cse28) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse29 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse30 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse29 .cse30) 0) (+ ~F~0.offset .cse29 .cse30 1) 0) (+ ~F~0.offset 2 .cse29 .cse30) 0) (+ ~F~0.offset .cse29 3 .cse30) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) .cse16) .cse22))) is different from false [2022-04-18 20:22:52,722 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse0 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse1 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse0 .cse1) 0) (+ ~F~0.offset .cse0 .cse1 1) 0) (+ ~F~0.offset 2 .cse0 .cse1) 0) (+ ~F~0.offset .cse0 3 .cse1) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse2 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse3 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse2 .cse3) 0) (+ ~F~0.offset .cse2 .cse3 1) 0) (+ ~F~0.offset 2 .cse2 .cse3) 0) (+ ~F~0.offset .cse2 3 .cse3) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset)) 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse4 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse5 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse4 .cse5) 0) (+ ~F~0.offset .cse4 .cse5 1) 0) (+ ~F~0.offset 2 .cse4 .cse5) 0) (+ ~F~0.offset .cse4 3 .cse5) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0) (= c_~B~0.offset 0) (< (+ c_~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse7 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse8 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse7 .cse8) 0) (+ ~F~0.offset .cse7 .cse8 1) 0) (+ ~F~0.offset 2 .cse7 .cse8) 0) (+ ~F~0.offset .cse7 3 .cse8) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (exists ((~B~0.base Int)) (let ((.cse9 (select |c_#race| ~B~0.base)) (.cse10 (* c_thread2Thread1of1ForFork1_~i~1 4))) (and (= (select .cse9 (+ .cse10 2)) 0) (= (select .cse9 (+ .cse10 1)) 0) (= (select .cse9 (+ .cse10 3)) 0) (< (+ ~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse9 .cse10) 0)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-04-18 20:22:54,818 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (and (< (+ |c_thread2Thread1of1ForFork1_#t~mem6.base| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse0 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse1 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse0 .cse1) 0) (+ ~F~0.offset .cse0 .cse1 1) 0) (+ ~F~0.offset 2 .cse0 .cse1) 0) (+ ~F~0.offset .cse0 3 .cse1) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse2 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse3 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse2 .cse3) 0) (+ ~F~0.offset .cse2 .cse3 1) 0) (+ ~F~0.offset 2 .cse2 .cse3) 0) (+ ~F~0.offset .cse2 3 .cse3) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset)) 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse4 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse5 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse4 .cse5) 0) (+ ~F~0.offset .cse4 .cse5 1) 0) (+ ~F~0.offset 2 .cse4 .cse5) 0) (+ ~F~0.offset .cse4 3 .cse5) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0) (= c_~B~0.offset 0) (< (+ c_~B~0.base 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= c_thread2Thread1of1ForFork1_~i~1 0) (= (select .cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse7 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse8 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse7 .cse8) 0) (+ ~F~0.offset .cse7 .cse8 1) 0) (+ ~F~0.offset 2 .cse7 .cse8) 0) (+ ~F~0.offset .cse7 3 .cse8) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (= (select .cse6 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-04-18 20:22:57,672 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse76 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse42 (+ .cse76 c_~B~0.offset)) (.cse43 (+ .cse76 c_~B~0.offset 1)) (.cse75 (select |c_#race| c_~B~0.base)) (.cse44 (+ .cse76 2 c_~B~0.offset)) (.cse26 (select |c_#race| c_~F~0.base)) (.cse27 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse28 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (let ((.cse0 (not (= (select .cse26 (+ .cse27 .cse28 c_~F~0.offset)) 0))) (.cse9 (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) (.cse11 (not (= (select .cse75 .cse44) 0))) (.cse12 (not (= (select .cse75 .cse43) 0))) (.cse25 (not (= (select .cse75 .cse42) 0)))) (and (or .cse0 (and (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (let ((.cse1 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse2 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (store (store (store (select |c_#race| c_~F~0.base) (+ .cse1 .cse2 c_~F~0.offset 1) 0) (+ 2 .cse1 .cse2 c_~F~0.offset) 0) (+ 3 .cse1 .cse2 c_~F~0.offset) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (let ((.cse3 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse4 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (store (store (store (select |c_#race| c_~F~0.base) (+ .cse3 .cse4 c_~F~0.offset 1) 0) (+ 2 .cse3 .cse4 c_~F~0.offset) 0) (+ 3 .cse3 .cse4 c_~F~0.offset) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~F~0.base (let ((.cse5 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse6 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (store (store (store (select |c_#race| c_~F~0.base) (+ .cse5 .cse6 c_~F~0.offset 1) 0) (+ 2 .cse5 .cse6 c_~F~0.offset) 0) (+ 3 .cse5 .cse6 c_~F~0.offset) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)))) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (let ((.cse7 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse8 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (store (store (store (select |c_#race| c_~F~0.base) (+ .cse7 .cse8 c_~F~0.offset 1) 0) (+ 2 .cse7 .cse8 c_~F~0.offset) 0) (+ 3 .cse7 .cse8 c_~F~0.offset) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select .cse9 .cse10) 0) (or .cse11 .cse12 (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse13 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0)))) (store .cse13 ~F~0.base (let ((.cse14 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse15 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse13 ~F~0.base) (+ ~F~0.offset .cse14 .cse15) 0) (+ ~F~0.offset .cse14 .cse15 1) 0) (+ ~F~0.offset 2 .cse14 .cse15) 0) (+ ~F~0.offset .cse14 3 .cse15) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse16 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0)))) (store .cse16 ~F~0.base (let ((.cse17 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse18 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse16 ~F~0.base) (+ ~F~0.offset .cse17 .cse18) 0) (+ ~F~0.offset .cse17 .cse18 1) 0) (+ ~F~0.offset 2 .cse17 .cse18) 0) (+ ~F~0.offset .cse17 3 .cse18) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse19 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0)))) (store .cse19 ~F~0.base (let ((.cse20 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse21 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse19 ~F~0.base) (+ ~F~0.offset .cse20 .cse21) 0) (+ ~F~0.offset .cse20 .cse21 1) 0) (+ ~F~0.offset 2 .cse20 .cse21) 0) (+ ~F~0.offset .cse20 3 .cse21) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse22 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0)))) (store .cse22 ~F~0.base (let ((.cse23 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse24 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse22 ~F~0.base) (+ ~F~0.offset .cse23 .cse24) 0) (+ ~F~0.offset .cse23 .cse24 1) 0) (+ ~F~0.offset 2 .cse23 .cse24) 0) (+ ~F~0.offset .cse23 3 .cse24) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) .cse25) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0) (= (select .cse9 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select .cse9 |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_thread2Thread1of1ForFork1_#t~mem6.base|)) (or .cse0 (and (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) (not (= (select .cse26 (+ 2 .cse27 .cse28 c_~F~0.offset)) 0)) (not (= 0 (select .cse26 (+ .cse27 .cse28 c_~F~0.offset 1))))) (let ((.cse41 (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store .cse9 .cse10 0)) c_~B~0.base))) (or (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse29 (let ((.cse32 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)))) (store .cse32 c_~B~0.base (store (select .cse32 c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0))))) (store .cse29 ~F~0.base (let ((.cse30 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse31 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse29 ~F~0.base) (+ ~F~0.offset .cse30 .cse31) 0) (+ ~F~0.offset .cse30 .cse31 1) 0) (+ ~F~0.offset 2 .cse30 .cse31) 0) (+ ~F~0.offset .cse30 3 .cse31) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse33 (let ((.cse36 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)))) (store .cse36 c_~B~0.base (store (select .cse36 c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0))))) (store .cse33 ~F~0.base (let ((.cse34 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse35 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse33 ~F~0.base) (+ ~F~0.offset .cse34 .cse35) 0) (+ ~F~0.offset .cse34 .cse35 1) 0) (+ ~F~0.offset 2 .cse34 .cse35) 0) (+ ~F~0.offset .cse34 3 .cse35) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse37 (let ((.cse40 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)))) (store .cse40 c_~B~0.base (store (select .cse40 c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) 3 c_~B~0.offset) 0))))) (store .cse37 ~F~0.base (let ((.cse38 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse39 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse37 ~F~0.base) (+ ~F~0.offset .cse38 .cse39) 0) (+ ~F~0.offset .cse38 .cse39 1) 0) (+ ~F~0.offset 2 .cse38 .cse39) 0) (+ ~F~0.offset .cse38 3 .cse39) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) (not (= (select .cse41 .cse42) 0)) (not (= (select .cse41 .cse43) 0)) (not (= (select .cse41 .cse44) 0)))) (or .cse11 .cse12 (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse45 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse46 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse45 .cse46) 0) (+ ~F~0.offset .cse45 .cse46 1) 0) (+ ~F~0.offset 2 .cse45 .cse46) 0) (+ ~F~0.offset .cse45 3 .cse46) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse47 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse48 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse47 .cse48) 0) (+ ~F~0.offset .cse47 .cse48 1) 0) (+ ~F~0.offset 2 .cse47 .cse48) 0) (+ ~F~0.offset .cse47 3 .cse48) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse49 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse50 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse49 .cse50) 0) (+ ~F~0.offset .cse49 .cse50 1) 0) (+ ~F~0.offset 2 .cse49 .cse50) 0) (+ ~F~0.offset .cse49 3 .cse50) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (store |c_#race| ~F~0.base (let ((.cse51 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse52 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select |c_#race| ~F~0.base) (+ ~F~0.offset .cse51 .cse52) 0) (+ ~F~0.offset .cse51 .cse52 1) 0) (+ ~F~0.offset 2 .cse51 .cse52) 0) (+ ~F~0.offset .cse51 3 .cse52) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) .cse25) (forall ((v_ArrVal_3621 Int)) (let ((.cse54 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse55 (+ .cse54 2 c_~B~0.offset))) (let ((.cse53 (select (let ((.cse74 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse55 v_ArrVal_3621)))) (store .cse74 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse74 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base))) (or (not (= (select .cse53 (+ .cse54 c_~B~0.offset 1)) 0)) (not (= (select .cse53 .cse55) 0)) (and (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse56 (let ((.cse60 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse59 (let ((.cse61 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse60 2 c_~B~0.offset) v_ArrVal_3621)))) (store .cse61 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse61 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse59 c_~B~0.base (store (select .cse59 c_~B~0.base) (+ .cse60 3 c_~B~0.offset) 0)))))) (store .cse56 ~F~0.base (let ((.cse57 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse58 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse56 ~F~0.base) (+ ~F~0.offset .cse57 .cse58) 0) (+ ~F~0.offset .cse57 .cse58 1) 0) (+ ~F~0.offset 2 .cse57 .cse58) 0) (+ ~F~0.offset .cse57 3 .cse58) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse62 (let ((.cse66 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse65 (let ((.cse67 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse66 2 c_~B~0.offset) v_ArrVal_3621)))) (store .cse67 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse67 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse65 c_~B~0.base (store (select .cse65 c_~B~0.base) (+ .cse66 3 c_~B~0.offset) 0)))))) (store .cse62 ~F~0.base (let ((.cse63 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse64 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse62 ~F~0.base) (+ ~F~0.offset .cse63 .cse64) 0) (+ ~F~0.offset .cse63 .cse64 1) 0) (+ ~F~0.offset 2 .cse63 .cse64) 0) (+ ~F~0.offset .cse63 3 .cse64) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((~M~0 Int) (v_ArrVal_3634 (Array Int Int)) (~F~0.base Int) (~F~0.offset Int) (thread2Thread1of1ForFork1_~j~0 Int)) (= (select (select (store (let ((.cse68 (let ((.cse72 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse71 (let ((.cse73 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) (+ .cse72 2 c_~B~0.offset) v_ArrVal_3621)))) (store .cse73 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse73 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))))) (store .cse71 c_~B~0.base (store (select .cse71 c_~B~0.base) (+ .cse72 3 c_~B~0.offset) 0)))))) (store .cse68 ~F~0.base (let ((.cse69 (* thread2Thread1of1ForFork1_~j~0 4)) (.cse70 (* (* c_thread2Thread1of1ForFork1_~i~1 ~M~0) 4))) (store (store (store (store (select .cse68 ~F~0.base) (+ ~F~0.offset .cse69 .cse70) 0) (+ ~F~0.offset .cse69 .cse70 1) 0) (+ ~F~0.offset 2 .cse69 .cse70) 0) (+ ~F~0.offset .cse69 3 .cse70) 0)))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) (not (= (select .cse53 (+ .cse54 c_~B~0.offset)) 0))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from true [2022-04-18 20:23:02,603 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (let ((.cse0 (select |c_#race| c_~F~0.base)) (.cse1 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse2 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (or (not (= (select .cse0 (+ .cse1 .cse2 c_~F~0.offset)) 0)) (not (= 0 (select .cse0 (+ .cse1 .cse2 c_~F~0.offset 1)))) (and (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (let ((.cse3 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse4 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (store (store (select |c_#race| c_~F~0.base) (+ 2 .cse3 .cse4 c_~F~0.offset) 0) (+ 3 .cse3 .cse4 c_~F~0.offset) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (let ((.cse5 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse6 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (store (store (select |c_#race| c_~F~0.base) (+ 2 .cse5 .cse6 c_~F~0.offset) 0) (+ 3 .cse5 .cse6 c_~F~0.offset) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (let ((.cse7 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse8 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (store (store (select |c_#race| c_~F~0.base) (+ 2 .cse7 .cse8 c_~F~0.offset) 0) (+ 3 .cse7 .cse8 c_~F~0.offset) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base (let ((.cse9 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse10 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (store (store (select |c_#race| c_~F~0.base) (+ 2 .cse9 .cse10 c_~F~0.offset) 0) (+ 3 .cse9 .cse10 c_~F~0.offset) 0))) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3634 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3634) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:23:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:03,013 INFO L93 Difference]: Finished difference Result 105091 states and 305093 transitions. [2022-04-18 20:23:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-04-18 20:23:03,014 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 43 states have internal predecessors, (64), 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) Word has length 32 [2022-04-18 20:23:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:03,395 INFO L225 Difference]: With dead ends: 105091 [2022-04-18 20:23:03,395 INFO L226 Difference]: Without dead ends: 105088 [2022-04-18 20:23:03,397 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 51 SyntacticMatches, 15 SemanticMatches, 99 ConstructedPredicates, 22 IntricatePredicates, 1 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 128.5s TimeCoverageRelationStatistics Valid=1070, Invalid=5077, Unknown=103, NotChecked=3850, Total=10100 [2022-04-18 20:23:03,397 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 887 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 3389 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 20607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 3389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16954 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:03,397 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [887 Valid, 676 Invalid, 20607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 3389 Invalid, 0 Unknown, 16954 Unchecked, 3.9s Time] [2022-04-18 20:23:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105088 states. [2022-04-18 20:23:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105088 to 48298. [2022-04-18 20:23:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48298 states, 48274 states have (on average 3.053154907403571) internal successors, (147388), 48297 states have internal predecessors, (147388), 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) [2022-04-18 20:23:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48298 states to 48298 states and 147388 transitions. [2022-04-18 20:23:05,061 INFO L78 Accepts]: Start accepts. Automaton has 48298 states and 147388 transitions. Word has length 32 [2022-04-18 20:23:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:05,061 INFO L478 AbstractCegarLoop]: Abstraction has 48298 states and 147388 transitions. [2022-04-18 20:23:05,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 43 states have internal predecessors, (64), 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) [2022-04-18 20:23:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 48298 states and 147388 transitions. [2022-04-18 20:23:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-18 20:23:05,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:05,075 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:05,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-18 20:23:05,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-18 20:23:05,276 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:23:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash -109699456, now seen corresponding path program 4 times [2022-04-18 20:23:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:05,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725579063] [2022-04-18 20:23:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:05,290 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:23:05,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664830857] [2022-04-18 20:23:05,290 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:23:05,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:05,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:05,292 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:23:05,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-18 20:23:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:05,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-18 20:23:05,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:05,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:05,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:05,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:23:06,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:06,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:23:06,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:23:06,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:06,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:06,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:23:06,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:06,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:07,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:07,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:07,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:23:07,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:23:07,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:07,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:07,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:07,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:07,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:07,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:07,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:23:07,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:23:07,823 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3817 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3817 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3817 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3817 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-04-18 20:23:07,862 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:23:07,939 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:23:07,961 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:23:07,985 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse0 0)) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0))) is different from false [2022-04-18 20:23:08,010 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#race| c_~B~0.base v_ArrVal_3807))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= 0 (select (select (store (store (store (let ((.cse1 (store |c_#race| c_~B~0.base v_ArrVal_3807))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)))) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (let ((.cse2 (store |c_#race| c_~B~0.base v_ArrVal_3807))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse4 (store |c_#race| c_~B~0.base v_ArrVal_3807))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse5 0))) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5)) 0))) is different from false [2022-04-18 20:23:08,077 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_3807))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_3807))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse3 0))) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (store (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5 0)) c_~B~0.base v_ArrVal_3807))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5)) 0)) (forall ((v_ArrVal_3816 (Array Int Int)) (v_ArrVal_3817 (Array Int Int)) (v_ArrVal_3807 (Array Int Int)) (v_ArrVal_3812 (Array Int Int))) (= (select (select (store (store (store (let ((.cse6 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_3807))) (store .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_3812) c_~F~0.base v_ArrVal_3816) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3817) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:23:08,099 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-04-18 20:23:08,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 58 [2022-04-18 20:23:08,107 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-18 20:23:08,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 832 treesize of output 798 [2022-04-18 20:23:08,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 758 treesize of output 662 [2022-04-18 20:23:08,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 662 treesize of output 638 [2022-04-18 20:23:08,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 638 treesize of output 590 [2022-04-18 20:23:08,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 210 treesize of output 202 [2022-04-18 20:23:08,749 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:08,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 63 treesize of output 1 [2022-04-18 20:23:08,758 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:08,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 65 treesize of output 1 [2022-04-18 20:23:08,766 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:08,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 65 treesize of output 1 [2022-04-18 20:23:09,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:09,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-04-18 20:23:09,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:23:09,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:09,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 36 [2022-04-18 20:23:09,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-04-18 20:23:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-18 20:23:09,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725579063] [2022-04-18 20:23:09,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:23:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664830857] [2022-04-18 20:23:09,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664830857] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:23:09,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1048033308] [2022-04-18 20:23:09,818 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:23:09,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:23:09,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 32 [2022-04-18 20:23:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237814221] [2022-04-18 20:23:09,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:23:09,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-18 20:23:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:09,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-18 20:23:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=606, Unknown=17, NotChecked=392, Total=1122 [2022-04-18 20:23:09,820 INFO L87 Difference]: Start difference. First operand 48298 states and 147388 transitions. Second operand has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 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) [2022-04-18 20:23:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:16,033 INFO L93 Difference]: Finished difference Result 69172 states and 204328 transitions. [2022-04-18 20:23:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-18 20:23:16,035 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 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) Word has length 32 [2022-04-18 20:23:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:16,223 INFO L225 Difference]: With dead ends: 69172 [2022-04-18 20:23:16,223 INFO L226 Difference]: Without dead ends: 69172 [2022-04-18 20:23:16,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=418, Invalid=1755, Unknown=17, NotChecked=672, Total=2862 [2022-04-18 20:23:16,224 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 1027 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 4712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2270 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:16,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1027 Valid, 267 Invalid, 4712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 2136 Invalid, 0 Unknown, 2270 Unchecked, 3.3s Time] [2022-04-18 20:23:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69172 states. [2022-04-18 20:23:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69172 to 49601. [2022-04-18 20:23:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49601 states, 49577 states have (on average 3.051818383524618) internal successors, (151300), 49600 states have internal predecessors, (151300), 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) [2022-04-18 20:23:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49601 states to 49601 states and 151300 transitions. [2022-04-18 20:23:17,602 INFO L78 Accepts]: Start accepts. Automaton has 49601 states and 151300 transitions. Word has length 32 [2022-04-18 20:23:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:17,603 INFO L478 AbstractCegarLoop]: Abstraction has 49601 states and 151300 transitions. [2022-04-18 20:23:17,603 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 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) [2022-04-18 20:23:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 49601 states and 151300 transitions. [2022-04-18 20:23:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-18 20:23:17,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:17,614 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:17,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-18 20:23:17,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,26 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:17,815 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:23:17,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1800741362, now seen corresponding path program 5 times [2022-04-18 20:23:17,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:17,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541835208] [2022-04-18 20:23:17,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:17,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:17,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:23:17,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1837530073] [2022-04-18 20:23:17,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:23:17,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:17,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:17,831 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:23:17,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-18 20:23:18,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-04-18 20:23:18,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:23:18,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-18 20:23:18,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:23:18,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 20:23:18,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:18,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541835208] [2022-04-18 20:23:18,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:23:18,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837530073] [2022-04-18 20:23:18,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837530073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 20:23:18,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 20:23:18,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 20:23:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485063294] [2022-04-18 20:23:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:18,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 20:23:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:18,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 20:23:18,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-18 20:23:18,519 INFO L87 Difference]: Start difference. First operand 49601 states and 151300 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-04-18 20:23:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:19,024 INFO L93 Difference]: Finished difference Result 48857 states and 148998 transitions. [2022-04-18 20:23:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-18 20:23:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) Word has length 32 [2022-04-18 20:23:19,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:19,148 INFO L225 Difference]: With dead ends: 48857 [2022-04-18 20:23:19,149 INFO L226 Difference]: Without dead ends: 48857 [2022-04-18 20:23:19,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-18 20:23:19,149 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 61 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:19,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 235 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 56 Unchecked, 0.3s Time] [2022-04-18 20:23:19,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48857 states. [2022-04-18 20:23:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48857 to 48793. [2022-04-18 20:23:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48793 states, 48769 states have (on average 3.053620127540036) internal successors, (148922), 48792 states have internal predecessors, (148922), 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) [2022-04-18 20:23:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48793 states to 48793 states and 148922 transitions. [2022-04-18 20:23:20,221 INFO L78 Accepts]: Start accepts. Automaton has 48793 states and 148922 transitions. Word has length 32 [2022-04-18 20:23:20,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:20,221 INFO L478 AbstractCegarLoop]: Abstraction has 48793 states and 148922 transitions. [2022-04-18 20:23:20,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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) [2022-04-18 20:23:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 48793 states and 148922 transitions. [2022-04-18 20:23:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-18 20:23:20,233 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:20,233 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:20,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-18 20:23:20,433 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,27 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:20,433 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:23:20,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1648213133, now seen corresponding path program 1 times [2022-04-18 20:23:20,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:20,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766735458] [2022-04-18 20:23:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:20,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:20,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:23:20,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [131811618] [2022-04-18 20:23:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:20,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:20,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:20,449 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:23:20,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-18 20:23:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:20,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-18 20:23:20,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:23:20,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:23:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 20:23:20,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766735458] [2022-04-18 20:23:20,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:23:20,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131811618] [2022-04-18 20:23:20,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131811618] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-18 20:23:20,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 20:23:20,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-04-18 20:23:20,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224920830] [2022-04-18 20:23:20,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 20:23:20,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 20:23:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:20,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 20:23:20,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-18 20:23:20,851 INFO L87 Difference]: Start difference. First operand 48793 states and 148922 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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) [2022-04-18 20:23:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:21,426 INFO L93 Difference]: Finished difference Result 48991 states and 148770 transitions. [2022-04-18 20:23:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-18 20:23:21,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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) Word has length 33 [2022-04-18 20:23:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:21,548 INFO L225 Difference]: With dead ends: 48991 [2022-04-18 20:23:21,548 INFO L226 Difference]: Without dead ends: 48991 [2022-04-18 20:23:21,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-18 20:23:21,549 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 111 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:21,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 128 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-18 20:23:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48991 states. [2022-04-18 20:23:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48991 to 48233. [2022-04-18 20:23:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48233 states, 48209 states have (on average 3.05488601713373) internal successors, (147273), 48232 states have internal predecessors, (147273), 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) [2022-04-18 20:23:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48233 states to 48233 states and 147273 transitions. [2022-04-18 20:23:22,589 INFO L78 Accepts]: Start accepts. Automaton has 48233 states and 147273 transitions. Word has length 33 [2022-04-18 20:23:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:22,589 INFO L478 AbstractCegarLoop]: Abstraction has 48233 states and 147273 transitions. [2022-04-18 20:23:22,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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) [2022-04-18 20:23:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 48233 states and 147273 transitions. [2022-04-18 20:23:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:23:22,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:22,600 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:22,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-18 20:23:22,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-18 20:23:22,801 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:23:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash -895979768, now seen corresponding path program 1 times [2022-04-18 20:23:22,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:22,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280024438] [2022-04-18 20:23:22,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:22,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:23:22,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006224151] [2022-04-18 20:23:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:22,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:22,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:22,818 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:23:22,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-18 20:23:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:23,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-18 20:23:23,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:23,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:23,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:23,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:23:23,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:23,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:23:23,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:23:23,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:23,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:23,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:23:23,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:23,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:23,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:23,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:23,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:23,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:23,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:23,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:23,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:23,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:23:24,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:23:24,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:23:24,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:24,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:24,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:24,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:24,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:24,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:23:24,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:23:24,638 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4390 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)))) (forall ((v_ArrVal_4390 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4390 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4390 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:23:24,681 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:23:24,748 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-04-18 20:23:24,801 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| c_~B~0.base v_ArrVal_4383))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store (let ((.cse1 (store |c_#race| c_~B~0.base v_ArrVal_4383))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (let ((.cse2 (store |c_#race| c_~B~0.base v_ArrVal_4383))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| c_~B~0.base v_ArrVal_4383))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:23:24,825 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_4383))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_4383))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4 0)) c_~B~0.base v_ArrVal_4383))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_4383))) (store .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:23:24,844 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int)) (v_ArrVal_4380 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store |c_#race| c_~B~0.base v_ArrVal_4380))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0))) c_~B~0.base v_ArrVal_4383))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int)) (v_ArrVal_4380 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store (let ((.cse4 (store |c_#race| c_~B~0.base v_ArrVal_4380))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4383))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int)) (v_ArrVal_4380 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store (let ((.cse6 (store |c_#race| c_~B~0.base v_ArrVal_4380))) (store .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4383))) (store .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int)) (v_ArrVal_4380 (Array Int Int))) (= (let ((.cse8 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (let ((.cse7 (store (let ((.cse9 (store |c_#race| c_~B~0.base v_ArrVal_4380))) (store .cse9 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4383))) (store .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse8 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse8)) 0))) is different from false [2022-04-18 20:23:25,177 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int)) (v_ArrVal_4380 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (let ((.cse0 (store (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_4380))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0))) c_~B~0.base v_ArrVal_4383))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int)) (v_ArrVal_4380 (Array Int Int))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (let ((.cse3 (store (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5 0)) c_~B~0.base v_ArrVal_4380))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4383))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5)) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int)) (v_ArrVal_4380 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store (let ((.cse7 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_4380))) (store .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4383))) (store .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4383 (Array Int Int)) (v_ArrVal_4389 (Array Int Int)) (v_ArrVal_4390 (Array Int Int)) (v_ArrVal_4380 (Array Int Int))) (= (let ((.cse9 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (let ((.cse8 (store (let ((.cse10 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_4380))) (store .cse10 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4383))) (store .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse9 0))) c_~F~0.base v_ArrVal_4389) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4390) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse9)) 0))) is different from false [2022-04-18 20:23:25,213 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-04-18 20:23:25,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 113 treesize of output 80 [2022-04-18 20:23:25,220 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-18 20:23:25,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 492 treesize of output 474 [2022-04-18 20:23:25,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 450 treesize of output 442 [2022-04-18 20:23:25,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 442 treesize of output 410 [2022-04-18 20:23:25,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 410 treesize of output 394 [2022-04-18 20:23:25,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 206 treesize of output 202 [2022-04-18 20:23:25,370 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:25,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 115 treesize of output 1 [2022-04-18 20:23:25,375 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:25,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 115 treesize of output 1 [2022-04-18 20:23:25,381 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:25,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 115 treesize of output 1 [2022-04-18 20:23:25,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:25,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-04-18 20:23:25,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:23:25,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:25,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 37 [2022-04-18 20:23:25,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-04-18 20:23:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:23:26,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:26,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280024438] [2022-04-18 20:23:26,038 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:23:26,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006224151] [2022-04-18 20:23:26,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006224151] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:23:26,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [175845701] [2022-04-18 20:23:26,038 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:23:26,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:23:26,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 32 [2022-04-18 20:23:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641902718] [2022-04-18 20:23:26,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:23:26,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-18 20:23:26,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:26,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-18 20:23:26,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=616, Unknown=11, NotChecked=392, Total=1122 [2022-04-18 20:23:26,041 INFO L87 Difference]: Start difference. First operand 48233 states and 147273 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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) [2022-04-18 20:23:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:32,298 INFO L93 Difference]: Finished difference Result 71103 states and 210992 transitions. [2022-04-18 20:23:32,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-18 20:23:32,300 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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) Word has length 34 [2022-04-18 20:23:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:32,489 INFO L225 Difference]: With dead ends: 71103 [2022-04-18 20:23:32,489 INFO L226 Difference]: Without dead ends: 71103 [2022-04-18 20:23:32,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=485, Invalid=1788, Unknown=11, NotChecked=686, Total=2970 [2022-04-18 20:23:32,490 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 746 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 5760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2813 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:32,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [746 Valid, 256 Invalid, 5760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2676 Invalid, 0 Unknown, 2813 Unchecked, 3.5s Time] [2022-04-18 20:23:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71103 states. [2022-04-18 20:23:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71103 to 48633. [2022-04-18 20:23:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48633 states, 48609 states have (on average 3.0608735007920345) internal successors, (148786), 48632 states have internal predecessors, (148786), 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) [2022-04-18 20:23:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48633 states to 48633 states and 148786 transitions. [2022-04-18 20:23:33,563 INFO L78 Accepts]: Start accepts. Automaton has 48633 states and 148786 transitions. Word has length 34 [2022-04-18 20:23:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:33,563 INFO L478 AbstractCegarLoop]: Abstraction has 48633 states and 148786 transitions. [2022-04-18 20:23:33,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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) [2022-04-18 20:23:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 48633 states and 148786 transitions. [2022-04-18 20:23:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:23:33,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:33,575 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:33,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-18 20:23:33,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-18 20:23:33,776 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:23:33,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash -73546540, now seen corresponding path program 2 times [2022-04-18 20:23:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:33,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538019318] [2022-04-18 20:23:33,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:33,790 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:23:33,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208611926] [2022-04-18 20:23:33,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:23:33,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:33,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:33,791 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:23:33,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-18 20:23:34,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 20:23:34,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:23:34,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-18 20:23:34,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:34,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:34,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:34,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:23:34,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:34,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:23:34,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:23:35,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:35,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:23:35,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:35,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:35,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:35,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:23:35,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:23:35,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:23:35,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:23:35,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:23:35,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:23:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:23:35,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:35,690 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:35,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:23:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:23:35,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:23:35,856 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4615 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4615 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4615 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-04-18 20:23:35,880 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:23:35,936 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:23:35,951 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:23:35,965 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int)) (v_ArrVal_4607 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (let ((.cse0 (store |c_#race| c_~B~0.base v_ArrVal_4607))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0))) c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int)) (v_ArrVal_4607 (Array Int Int))) (= (select (select (store (store (store (let ((.cse2 (store |c_#race| c_~B~0.base v_ArrVal_4607))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int)) (v_ArrVal_4607 (Array Int Int))) (= (select (select (store (store (store (let ((.cse3 (store |c_#race| c_~B~0.base v_ArrVal_4607))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:23:36,000 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int)) (v_ArrVal_4607 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_4607))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int)) (v_ArrVal_4607 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_4607))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0))) c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_4610 (Array Int Int)) (v_ArrVal_4614 (Array Int Int)) (v_ArrVal_4615 (Array Int Int)) (v_ArrVal_4607 (Array Int Int))) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (store (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4 0)) c_~B~0.base v_ArrVal_4607))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0))) c_~B~0.base v_ArrVal_4610) c_~F~0.base v_ArrVal_4614) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4615) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4)) 0))) is different from false [2022-04-18 20:23:36,018 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-04-18 20:23:36,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 51 [2022-04-18 20:23:36,024 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-18 20:23:36,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 372 treesize of output 354 [2022-04-18 20:23:36,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 330 treesize of output 306 [2022-04-18 20:23:36,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 306 treesize of output 294 [2022-04-18 20:23:36,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 294 treesize of output 288 [2022-04-18 20:23:36,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 98 [2022-04-18 20:23:36,521 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:36,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 60 treesize of output 1 [2022-04-18 20:23:36,541 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:36,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 60 treesize of output 1 [2022-04-18 20:23:37,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:37,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-04-18 20:23:37,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:23:37,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:37,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 36 [2022-04-18 20:23:37,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-04-18 20:23:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:23:37,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:37,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538019318] [2022-04-18 20:23:37,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:23:37,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208611926] [2022-04-18 20:23:37,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208611926] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:23:37,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2027785898] [2022-04-18 20:23:37,493 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:23:37,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:23:37,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 32 [2022-04-18 20:23:37,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571812285] [2022-04-18 20:23:37,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:23:37,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-18 20:23:37,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:37,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-18 20:23:37,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=652, Unknown=22, NotChecked=342, Total=1122 [2022-04-18 20:23:37,495 INFO L87 Difference]: Start difference. First operand 48633 states and 148786 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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) [2022-04-18 20:23:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:44,328 INFO L93 Difference]: Finished difference Result 66687 states and 197685 transitions. [2022-04-18 20:23:44,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-18 20:23:44,331 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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) Word has length 34 [2022-04-18 20:23:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:44,486 INFO L225 Difference]: With dead ends: 66687 [2022-04-18 20:23:44,487 INFO L226 Difference]: Without dead ends: 66687 [2022-04-18 20:23:44,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=504, Invalid=1850, Unknown=22, NotChecked=594, Total=2970 [2022-04-18 20:23:44,488 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 837 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 2688 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 6798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 2688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3803 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:44,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [837 Valid, 268 Invalid, 6798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 2688 Invalid, 0 Unknown, 3803 Unchecked, 3.7s Time] [2022-04-18 20:23:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66687 states. [2022-04-18 20:23:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66687 to 50567. [2022-04-18 20:23:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50567 states, 50543 states have (on average 3.058999267950062) internal successors, (154611), 50566 states have internal predecessors, (154611), 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) [2022-04-18 20:23:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50567 states to 50567 states and 154611 transitions. [2022-04-18 20:23:45,566 INFO L78 Accepts]: Start accepts. Automaton has 50567 states and 154611 transitions. Word has length 34 [2022-04-18 20:23:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:45,566 INFO L478 AbstractCegarLoop]: Abstraction has 50567 states and 154611 transitions. [2022-04-18 20:23:45,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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) [2022-04-18 20:23:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 50567 states and 154611 transitions. [2022-04-18 20:23:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:23:45,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:45,581 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:45,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-18 20:23:45,791 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:45,791 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:23:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1613509718, now seen corresponding path program 3 times [2022-04-18 20:23:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:45,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624926098] [2022-04-18 20:23:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:45,806 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:23:45,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946461141] [2022-04-18 20:23:45,806 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:23:45,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:45,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:45,807 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:23:45,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-18 20:23:46,293 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:23:46,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:23:46,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-18 20:23:46,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:46,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:46,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:46,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-04-18 20:23:46,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:46,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-04-18 20:23:47,128 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-18 20:23:47,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 12 [2022-04-18 20:23:47,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:47,289 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-04-18 20:23:47,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-04-18 20:23:47,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:47,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:47,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:47,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:47,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:47,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:47,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:47,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 23 [2022-04-18 20:23:47,600 INFO L356 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-04-18 20:23:47,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-04-18 20:23:47,771 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-04-18 20:23:47,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-04-18 20:23:47,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:47,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:47,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:47,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:47,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:47,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:47,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:47,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:48,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:48,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:23:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:23:48,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:23:48,422 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4844 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4844 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4844 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4844 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-04-18 20:23:48,459 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-04-18 20:23:48,511 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|)))) is different from false [2022-04-18 20:23:48,553 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse1 0)) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:23:48,574 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int)) (v_ArrVal_4835 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (let ((.cse0 (store |c_#race| c_~B~0.base v_ArrVal_4835))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse1 0))) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int)) (v_ArrVal_4835 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| c_~B~0.base v_ArrVal_4835))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int)) (v_ArrVal_4835 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| c_~B~0.base v_ArrVal_4835))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int)) (v_ArrVal_4835 (Array Int Int))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (let ((.cse4 (store |c_#race| c_~B~0.base v_ArrVal_4835))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5)) 0))) is different from false [2022-04-18 20:23:48,638 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int)) (v_ArrVal_4835 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_4835))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int)) (v_ArrVal_4835 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_4835))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse2 0))) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int)) (v_ArrVal_4835 (Array Int Int))) (= 0 (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4 0)) c_~B~0.base v_ArrVal_4835))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4)))) (forall ((v_ArrVal_4843 (Array Int Int)) (v_ArrVal_4844 (Array Int Int)) (v_ArrVal_4835 (Array Int Int))) (= (let ((.cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0)) c_~B~0.base v_ArrVal_4835))) (store .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse6 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~F~0.base v_ArrVal_4843) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4844) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse6)) 0))) is different from false [2022-04-18 20:23:48,666 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-04-18 20:23:48,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 55 [2022-04-18 20:23:48,680 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-18 20:23:48,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 188 treesize of output 178 [2022-04-18 20:23:48,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 134 [2022-04-18 20:23:48,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 122 [2022-04-18 20:23:48,780 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-04-18 20:23:48,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 53 [2022-04-18 20:23:48,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:23:48,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:23:48,785 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-04-18 20:23:48,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2022-04-18 20:23:48,792 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:48,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 62 treesize of output 1 [2022-04-18 20:23:48,799 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-04-18 20:23:48,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 62 treesize of output 1 [2022-04-18 20:23:49,811 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:49,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 30 treesize of output 31 [2022-04-18 20:23:49,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:23:49,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:49,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 44 [2022-04-18 20:23:49,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 18 [2022-04-18 20:23:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:23:50,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:50,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624926098] [2022-04-18 20:23:50,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:23:50,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946461141] [2022-04-18 20:23:50,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946461141] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:23:50,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [127639442] [2022-04-18 20:23:50,624 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:23:50,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:23:50,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2022-04-18 20:23:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098051943] [2022-04-18 20:23:50,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:23:50,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-18 20:23:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-18 20:23:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=725, Unknown=7, NotChecked=354, Total=1190 [2022-04-18 20:23:50,627 INFO L87 Difference]: Start difference. First operand 50567 states and 154611 transitions. Second operand has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 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) [2022-04-18 20:23:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:23:53,415 INFO L93 Difference]: Finished difference Result 55465 states and 166970 transitions. [2022-04-18 20:23:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-18 20:23:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 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) Word has length 34 [2022-04-18 20:23:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:23:53,562 INFO L225 Difference]: With dead ends: 55465 [2022-04-18 20:23:53,562 INFO L226 Difference]: Without dead ends: 55465 [2022-04-18 20:23:53,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=162, Invalid=1045, Unknown=7, NotChecked=426, Total=1640 [2022-04-18 20:23:53,563 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 98 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1640 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-18 20:23:53,563 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 242 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1360 Invalid, 0 Unknown, 1640 Unchecked, 1.6s Time] [2022-04-18 20:23:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55465 states. [2022-04-18 20:23:54,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55465 to 51751. [2022-04-18 20:23:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51751 states, 51727 states have (on average 3.0706787557755137) internal successors, (158837), 51750 states have internal predecessors, (158837), 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) [2022-04-18 20:23:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51751 states to 51751 states and 158837 transitions. [2022-04-18 20:23:54,822 INFO L78 Accepts]: Start accepts. Automaton has 51751 states and 158837 transitions. Word has length 34 [2022-04-18 20:23:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:23:54,822 INFO L478 AbstractCegarLoop]: Abstraction has 51751 states and 158837 transitions. [2022-04-18 20:23:54,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 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) [2022-04-18 20:23:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 51751 states and 158837 transitions. [2022-04-18 20:23:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:23:54,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:23:54,839 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:23:54,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-18 20:23:55,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-18 20:23:55,064 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:23:55,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:23:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1748892241, now seen corresponding path program 1 times [2022-04-18 20:23:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:23:55,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025952779] [2022-04-18 20:23:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:23:55,079 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:23:55,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2119106606] [2022-04-18 20:23:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:23:55,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:23:55,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:23:55,081 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:23:55,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-18 20:23:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:23:55,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-18 20:23:55,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:23:55,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:55,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:55,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:23:55,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:55,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:23:56,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:23:56,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:23:56,181 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:23:56,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 28 treesize of output 27 [2022-04-18 20:23:56,248 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:23:56,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-04-18 20:23:56,330 INFO L356 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-04-18 20:23:56,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-04-18 20:23:56,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:23:56,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-04-18 20:23:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:23:56,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:23:56,476 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5063 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| (* c_thread2Thread1of1ForFork1_~j~0 4) 1)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| (* c_thread2Thread1of1ForFork1_~j~0 4))) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 (* c_thread2Thread1of1ForFork1_~j~0 4))) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 (* c_thread2Thread1of1ForFork1_~j~0 4))) |c_thread2Thread1of1ForFork1_#t~nondet8|))) is different from false [2022-04-18 20:23:56,495 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse0 (* c_thread2Thread1of1ForFork1_~j~0 4))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse0) |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse0))) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse1 (* c_thread2Thread1of1ForFork1_~j~0 4))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse1) |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse1))) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse2 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 (* c_thread2Thread1of1ForFork1_~j~0 4)))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse2 |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse2)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse3 (* c_thread2Thread1of1ForFork1_~j~0 4))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse3) |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse3 1))) |c_thread2Thread1of1ForFork1_#t~nondet8|))) is different from false [2022-04-18 20:23:56,513 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse1 (* c_thread2Thread1of1ForFork1_~j~0 4))) (let ((.cse0 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse1))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse0 |c_thread2Thread1of1ForFork1_#t~nondet8|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse1) |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse0))) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse2 (* c_thread2Thread1of1ForFork1_~j~0 4))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse2) |c_thread2Thread1of1ForFork1_#t~nondet8|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse2) |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse2 1))) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse3 (* c_thread2Thread1of1ForFork1_~j~0 4))) (let ((.cse4 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse3))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse3) |c_thread2Thread1of1ForFork1_#t~nondet8|) .cse4 |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse4))) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse5 (* c_thread2Thread1of1ForFork1_~j~0 4))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse5) |c_thread2Thread1of1ForFork1_#t~nondet8|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse5) |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse5))) |c_thread2Thread1of1ForFork1_#t~nondet8|))) is different from false [2022-04-18 20:23:56,530 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5063 (Array Int Int))) (= |c_thread2Thread1of1ForFork1_#t~nondet8| (let ((.cse1 (* c_thread2Thread1of1ForFork1_~j~0 4))) (let ((.cse0 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse1 1))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse0 |c_thread2Thread1of1ForFork1_#t~nondet8|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse1) |c_thread2Thread1of1ForFork1_#t~nondet8|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse1) |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse0))))) (forall ((v_ArrVal_5063 (Array Int Int))) (= |c_thread2Thread1of1ForFork1_#t~nondet8| (let ((.cse2 (* c_thread2Thread1of1ForFork1_~j~0 4))) (let ((.cse3 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse2))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse2 1) |c_thread2Thread1of1ForFork1_#t~nondet8|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse2) |c_thread2Thread1of1ForFork1_#t~nondet8|) .cse3 |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse3))))) (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse4 (* c_thread2Thread1of1ForFork1_~j~0 4))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse4 1) |c_thread2Thread1of1ForFork1_#t~nondet8|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse4) |c_thread2Thread1of1ForFork1_#t~nondet8|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse4) |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse4))) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5063 (Array Int Int))) (= (let ((.cse5 (* c_thread2Thread1of1ForFork1_~j~0 4))) (let ((.cse6 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse5))) (select (select (store (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse5 1) |c_thread2Thread1of1ForFork1_#t~nondet8|) .cse6 |c_thread2Thread1of1ForFork1_#t~nondet8|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse5) |c_thread2Thread1of1ForFork1_#t~nondet8|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5063) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse6))) |c_thread2Thread1of1ForFork1_#t~nondet8|))) is different from false [2022-04-18 20:23:56,577 INFO L356 Elim1Store]: treesize reduction 293, result has 15.1 percent of original size [2022-04-18 20:23:56,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 67 [2022-04-18 20:23:56,582 INFO L356 Elim1Store]: treesize reduction 105, result has 0.9 percent of original size [2022-04-18 20:23:56,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 115 treesize of output 35 [2022-04-18 20:23:56,596 INFO L356 Elim1Store]: treesize reduction 344, result has 0.3 percent of original size [2022-04-18 20:23:56,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-04-18 20:23:56,610 INFO L356 Elim1Store]: treesize reduction 344, result has 0.3 percent of original size [2022-04-18 20:23:56,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-04-18 20:23:56,628 INFO L356 Elim1Store]: treesize reduction 344, result has 0.3 percent of original size [2022-04-18 20:23:56,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 1 [2022-04-18 20:23:56,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5054 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5054) c_~B~0.base) c_~B~0.offset)))) is different from false [2022-04-18 20:23:56,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5054 (Array Int Int)) (v_ArrVal_5053 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5053) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5054) c_~B~0.base) c_~B~0.offset)))) is different from false [2022-04-18 20:23:56,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:56,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2022-04-18 20:23:56,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:23:56,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 68 [2022-04-18 20:23:56,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 48 [2022-04-18 20:23:56,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 46 [2022-04-18 20:23:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-04-18 20:23:57,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:23:57,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025952779] [2022-04-18 20:23:57,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:23:57,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119106606] [2022-04-18 20:23:57,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119106606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:23:57,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [538841162] [2022-04-18 20:23:57,098 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:23:57,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:23:57,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2022-04-18 20:23:57,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915512547] [2022-04-18 20:23:57,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:23:57,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-18 20:23:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:23:57,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-18 20:23:57,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=322, Unknown=6, NotChecked=246, Total=650 [2022-04-18 20:23:57,100 INFO L87 Difference]: Start difference. First operand 51751 states and 158837 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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) [2022-04-18 20:24:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:24:00,496 INFO L93 Difference]: Finished difference Result 71941 states and 216652 transitions. [2022-04-18 20:24:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-18 20:24:00,498 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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) Word has length 34 [2022-04-18 20:24:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:24:00,691 INFO L225 Difference]: With dead ends: 71941 [2022-04-18 20:24:00,691 INFO L226 Difference]: Without dead ends: 71941 [2022-04-18 20:24:00,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=151, Invalid=623, Unknown=6, NotChecked=342, Total=1122 [2022-04-18 20:24:00,691 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 699 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 4165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2239 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-18 20:24:00,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [699 Valid, 373 Invalid, 4165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1862 Invalid, 0 Unknown, 2239 Unchecked, 2.2s Time] [2022-04-18 20:24:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71941 states. [2022-04-18 20:24:01,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71941 to 55222. [2022-04-18 20:24:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55222 states, 55198 states have (on average 3.0711438820247112) internal successors, (169521), 55221 states have internal predecessors, (169521), 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) [2022-04-18 20:24:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55222 states to 55222 states and 169521 transitions. [2022-04-18 20:24:01,983 INFO L78 Accepts]: Start accepts. Automaton has 55222 states and 169521 transitions. Word has length 34 [2022-04-18 20:24:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:24:01,983 INFO L478 AbstractCegarLoop]: Abstraction has 55222 states and 169521 transitions. [2022-04-18 20:24:01,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 25 states have internal predecessors, (67), 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) [2022-04-18 20:24:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 55222 states and 169521 transitions. [2022-04-18 20:24:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:24:01,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:24:01,999 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:24:02,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-18 20:24:02,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-18 20:24:02,200 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:24:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:24:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1742492911, now seen corresponding path program 2 times [2022-04-18 20:24:02,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:24:02,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362972437] [2022-04-18 20:24:02,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:24:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:24:02,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:24:02,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456251027] [2022-04-18 20:24:02,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:24:02,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:02,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:24:02,528 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:24:02,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-18 20:24:02,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 20:24:02,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:24:02,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-18 20:24:02,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:24:02,957 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-04-18 20:24:02,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 12 treesize of output 16 [2022-04-18 20:24:03,034 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-04-18 20:24:03,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 17 treesize of output 22 [2022-04-18 20:24:03,081 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-04-18 20:24:03,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-04-18 20:24:03,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 20:24:03,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-04-18 20:24:03,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-04-18 20:24:03,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-04-18 20:24:03,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:24:03,522 INFO L356 Elim1Store]: treesize reduction 39, result has 22.0 percent of original size [2022-04-18 20:24:03,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 28 treesize of output 27 [2022-04-18 20:24:03,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:03,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 30 [2022-04-18 20:24:03,631 INFO L356 Elim1Store]: treesize reduction 96, result has 20.0 percent of original size [2022-04-18 20:24:03,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2022-04-18 20:24:03,701 INFO L356 Elim1Store]: treesize reduction 172, result has 17.3 percent of original size [2022-04-18 20:24:03,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2022-04-18 20:24:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:24:03,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:24:03,789 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5283 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5283) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| (* c_thread2Thread1of1ForFork1_~j~0 4) 1)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_5283 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5283) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| (* c_thread2Thread1of1ForFork1_~j~0 4))) |c_thread2Thread1of1ForFork1_#t~nondet8|))) is different from false [2022-04-18 20:24:03,884 INFO L356 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2022-04-18 20:24:03,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 40 [2022-04-18 20:24:03,888 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-04-18 20:24:03,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 22 [2022-04-18 20:24:03,894 INFO L356 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2022-04-18 20:24:03,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 1 [2022-04-18 20:24:04,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5278 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5278) c_~B~0.base) c_~B~0.offset)))) is different from false [2022-04-18 20:24:04,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5277 (Array Int Int)) (v_ArrVal_5278 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5277) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5278) c_~B~0.base) c_~B~0.offset)))) is different from false [2022-04-18 20:24:04,071 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:24:04,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2022-04-18 20:24:04,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:24:04,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 134 treesize of output 130 [2022-04-18 20:24:04,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 110 [2022-04-18 20:24:04,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 102 [2022-04-18 20:24:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-04-18 20:24:04,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:24:04,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362972437] [2022-04-18 20:24:04,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:24:04,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456251027] [2022-04-18 20:24:04,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456251027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:24:04,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1015465121] [2022-04-18 20:24:04,518 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:24:04,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:24:04,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-04-18 20:24:04,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908790037] [2022-04-18 20:24:04,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:24:04,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-18 20:24:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:24:04,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-18 20:24:04,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=12, NotChecked=120, Total=552 [2022-04-18 20:24:04,520 INFO L87 Difference]: Start difference. First operand 55222 states and 169521 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 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) [2022-04-18 20:24:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:24:07,488 INFO L93 Difference]: Finished difference Result 69004 states and 207697 transitions. [2022-04-18 20:24:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-18 20:24:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 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) Word has length 34 [2022-04-18 20:24:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:24:07,658 INFO L225 Difference]: With dead ends: 69004 [2022-04-18 20:24:07,658 INFO L226 Difference]: Without dead ends: 69004 [2022-04-18 20:24:07,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=153, Invalid=716, Unknown=13, NotChecked=174, Total=1056 [2022-04-18 20:24:07,659 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 483 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 2987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1161 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:24:07,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 359 Invalid, 2987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1792 Invalid, 0 Unknown, 1161 Unchecked, 2.1s Time] [2022-04-18 20:24:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69004 states. [2022-04-18 20:24:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69004 to 55645. [2022-04-18 20:24:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55645 states, 55621 states have (on average 3.0714478344510168) internal successors, (170837), 55644 states have internal predecessors, (170837), 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) [2022-04-18 20:24:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55645 states to 55645 states and 170837 transitions. [2022-04-18 20:24:09,178 INFO L78 Accepts]: Start accepts. Automaton has 55645 states and 170837 transitions. Word has length 34 [2022-04-18 20:24:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:24:09,178 INFO L478 AbstractCegarLoop]: Abstraction has 55645 states and 170837 transitions. [2022-04-18 20:24:09,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 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) [2022-04-18 20:24:09,179 INFO L276 IsEmpty]: Start isEmpty. Operand 55645 states and 170837 transitions. [2022-04-18 20:24:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:24:09,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:24:09,193 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:24:09,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-18 20:24:09,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:09,394 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:24:09,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:24:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1650168724, now seen corresponding path program 4 times [2022-04-18 20:24:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:24:09,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111267371] [2022-04-18 20:24:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:24:09,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:24:09,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:24:09,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247303010] [2022-04-18 20:24:09,411 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:24:09,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:09,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:24:09,412 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:24:09,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-18 20:24:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:24:09,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-18 20:24:09,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:24:10,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:24:10,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:10,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:24:10,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:10,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:24:10,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:24:10,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:10,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:24:10,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:10,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:10,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:10,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:24:11,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:24:11,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:24:11,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:11,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:11,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:11,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:11,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:11,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:11,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:11,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:11,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:11,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:24:11,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:24:12,030 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5514 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5514 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5514 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5514 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))))) is different from false [2022-04-18 20:24:12,065 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5513) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5513) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)))) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5513) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5513) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:24:12,132 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:24:12,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_185| Int)) (or (and (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_185| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))))) is different from false [2022-04-18 20:24:12,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_185| Int)) (or (and (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_185| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))))) is different from false [2022-04-18 20:24:12,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_185| Int)) (or (and (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse0 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_185| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))))) is different from false [2022-04-18 20:24:12,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_185| Int)) (or (and (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) .cse1 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_5514 (Array Int Int)) (v_ArrVal_5513 (Array Int Int)) (v_ArrVal_5509 (Array Int Int))) (= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse2 0)) c_~B~0.base v_ArrVal_5509) c_~F~0.base v_ArrVal_5513) |v_thread2Thread1of1ForFork1_#t~mem6.base_185| v_ArrVal_5514) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2))))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_185| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))))) is different from false [2022-04-18 20:24:12,832 INFO L356 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-04-18 20:24:12,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 57 [2022-04-18 20:24:12,844 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-04-18 20:24:12,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 580 treesize of output 534 [2022-04-18 20:24:12,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 486 treesize of output 454 [2022-04-18 20:24:12,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 454 treesize of output 438 [2022-04-18 20:24:12,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 438 treesize of output 374 [2022-04-18 20:24:13,284 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:24:13,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-04-18 20:24:13,304 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:24:13,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 39 treesize of output 1 [2022-04-18 20:24:13,329 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:24:13,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-04-18 20:24:13,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:24:13,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-04-18 20:24:13,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:24:13,825 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:24:13,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 36 [2022-04-18 20:24:13,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-04-18 20:24:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:24:14,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:24:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111267371] [2022-04-18 20:24:14,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:24:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247303010] [2022-04-18 20:24:14,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247303010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:24:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1218643414] [2022-04-18 20:24:14,451 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:24:14,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:24:14,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-04-18 20:24:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263665389] [2022-04-18 20:24:14,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:24:14,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-18 20:24:14,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:24:14,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-18 20:24:14,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=541, Unknown=22, NotChecked=378, Total=1056 [2022-04-18 20:24:14,453 INFO L87 Difference]: Start difference. First operand 55645 states and 170837 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) [2022-04-18 20:24:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:24:21,561 INFO L93 Difference]: Finished difference Result 69921 states and 208715 transitions. [2022-04-18 20:24:21,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-18 20:24:21,564 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) Word has length 34 [2022-04-18 20:24:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:24:21,753 INFO L225 Difference]: With dead ends: 69921 [2022-04-18 20:24:21,753 INFO L226 Difference]: Without dead ends: 69920 [2022-04-18 20:24:21,754 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=392, Invalid=1247, Unknown=29, NotChecked=588, Total=2256 [2022-04-18 20:24:21,754 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 729 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 5075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2785 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-18 20:24:21,755 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [729 Valid, 163 Invalid, 5075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1996 Invalid, 0 Unknown, 2785 Unchecked, 3.5s Time] [2022-04-18 20:24:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69920 states. [2022-04-18 20:24:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69920 to 57177. [2022-04-18 20:24:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57177 states, 57153 states have (on average 3.0734869560652984) internal successors, (175659), 57176 states have internal predecessors, (175659), 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) [2022-04-18 20:24:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57177 states to 57177 states and 175659 transitions. [2022-04-18 20:24:22,931 INFO L78 Accepts]: Start accepts. Automaton has 57177 states and 175659 transitions. Word has length 34 [2022-04-18 20:24:22,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:24:22,931 INFO L478 AbstractCegarLoop]: Abstraction has 57177 states and 175659 transitions. [2022-04-18 20:24:22,931 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) [2022-04-18 20:24:22,931 INFO L276 IsEmpty]: Start isEmpty. Operand 57177 states and 175659 transitions. [2022-04-18 20:24:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:24:22,946 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:24:22,946 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:24:22,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-18 20:24:23,146 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,34 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:23,146 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:24:23,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:24:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash 954524124, now seen corresponding path program 5 times [2022-04-18 20:24:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:24:23,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760844507] [2022-04-18 20:24:23,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:24:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:24:23,403 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:24:23,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102912799] [2022-04-18 20:24:23,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:24:23,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:23,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:24:23,412 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:24:23,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-18 20:24:24,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 20:24:24,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:24:24,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-18 20:24:24,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:24:24,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:24:24,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:24,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:24:24,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:24,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:24:25,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:24:25,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:24:25,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:24:25,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:24:25,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:24:25,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:25,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:25,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:25,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:25,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:26,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:26,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:26,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:26,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:26,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:26,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:26,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:26,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:26,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:26,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:24:26,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:24:26,671 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5741 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5741 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5741 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5741 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:24:26,710 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-04-18 20:24:26,782 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:24:26,835 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-04-18 20:24:26,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_187| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_187| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-04-18 20:24:26,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_187| Int)) (or (and (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse1 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_187| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))))) is different from false [2022-04-18 20:24:27,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_187| Int)) (or (and (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) .cse1 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_5741 (Array Int Int)) (v_ArrVal_5740 (Array Int Int)) (v_ArrVal_5736 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse2 0)) c_~B~0.base v_ArrVal_5736) c_~F~0.base v_ArrVal_5740) |v_thread2Thread1of1ForFork1_#t~mem6.base_187| v_ArrVal_5741) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2)) 0))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_187| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))))) is different from false [2022-04-18 20:24:27,114 INFO L356 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-04-18 20:24:27,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 57 [2022-04-18 20:24:27,125 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-04-18 20:24:27,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1132 treesize of output 1062 [2022-04-18 20:24:27,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 982 treesize of output 854 [2022-04-18 20:24:27,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 854 treesize of output 822 [2022-04-18 20:24:27,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 822 treesize of output 758 [2022-04-18 20:24:28,772 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:24:28,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-04-18 20:24:28,800 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:24:28,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 39 treesize of output 1 [2022-04-18 20:24:28,824 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:24:28,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-04-18 20:24:29,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:24:29,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-04-18 20:24:29,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:24:29,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:24:29,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 36 [2022-04-18 20:24:29,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-04-18 20:24:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:24:30,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:24:30,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760844507] [2022-04-18 20:24:30,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:24:30,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102912799] [2022-04-18 20:24:30,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102912799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:24:30,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [959341618] [2022-04-18 20:24:30,014 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:24:30,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:24:30,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-04-18 20:24:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837531996] [2022-04-18 20:24:30,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:24:30,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-18 20:24:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:24:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-18 20:24:30,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=545, Unknown=26, NotChecked=378, Total=1056 [2022-04-18 20:24:30,016 INFO L87 Difference]: Start difference. First operand 57177 states and 175659 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) [2022-04-18 20:24:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:24:37,847 INFO L93 Difference]: Finished difference Result 66655 states and 198306 transitions. [2022-04-18 20:24:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-18 20:24:37,849 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) Word has length 34 [2022-04-18 20:24:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:24:38,015 INFO L225 Difference]: With dead ends: 66655 [2022-04-18 20:24:38,015 INFO L226 Difference]: Without dead ends: 66655 [2022-04-18 20:24:38,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=433, Invalid=1638, Unknown=27, NotChecked=658, Total=2756 [2022-04-18 20:24:38,016 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 673 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1440 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-18 20:24:38,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 237 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1671 Invalid, 0 Unknown, 1440 Unchecked, 3.0s Time] [2022-04-18 20:24:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66655 states. [2022-04-18 20:24:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66655 to 57491. [2022-04-18 20:24:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57491 states, 57467 states have (on average 3.073537856508953) internal successors, (176627), 57490 states have internal predecessors, (176627), 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) [2022-04-18 20:24:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57491 states to 57491 states and 176627 transitions. [2022-04-18 20:24:39,131 INFO L78 Accepts]: Start accepts. Automaton has 57491 states and 176627 transitions. Word has length 34 [2022-04-18 20:24:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:24:39,132 INFO L478 AbstractCegarLoop]: Abstraction has 57491 states and 176627 transitions. [2022-04-18 20:24:39,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) [2022-04-18 20:24:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 57491 states and 176627 transitions. [2022-04-18 20:24:39,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:24:39,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:24:39,361 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:24:39,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-18 20:24:39,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,35 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:39,569 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:24:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:24:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash -66381094, now seen corresponding path program 6 times [2022-04-18 20:24:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:24:39,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066129717] [2022-04-18 20:24:39,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:24:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:24:39,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:24:39,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399485426] [2022-04-18 20:24:39,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 20:24:39,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:39,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:24:39,593 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:24:39,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-18 20:24:40,180 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 20:24:40,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:24:40,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-18 20:24:40,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:24:40,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:24:40,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:40,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:24:40,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:40,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:24:41,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:24:41,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:24:41,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:24:41,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:24:41,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:24:41,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:24:41,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:24:41,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:41,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:24:42,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:42,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:42,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:42,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:42,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:42,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:42,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:42,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:42,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:42,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:42,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:42,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:24:42,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:24:42,852 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5968 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)))) (forall ((v_ArrVal_5968 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5968 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5968 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))))) is different from false [2022-04-18 20:24:42,893 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-04-18 20:24:42,974 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)))) (forall ((v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))))) is different from false [2022-04-18 20:24:42,993 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:24:43,012 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#race| c_~B~0.base v_ArrVal_5960))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= 0 (select (select (store (store (store (let ((.cse1 (store |c_#race| c_~B~0.base v_ArrVal_5960))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)))) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (let ((.cse2 (store |c_#race| c_~B~0.base v_ArrVal_5960))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse3 (store |c_#race| c_~B~0.base v_ArrVal_5960))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4)) 0))) is different from false [2022-04-18 20:24:43,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_189| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_189| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse0 (store |c_#race| c_~B~0.base v_ArrVal_5960))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (let ((.cse2 (store |c_#race| c_~B~0.base v_ArrVal_5960))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (let ((.cse3 (store |c_#race| c_~B~0.base v_ArrVal_5960))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (let ((.cse4 (store |c_#race| c_~B~0.base v_ArrVal_5960))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-04-18 20:24:43,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_189| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_189| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_5960))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_5960))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_5960))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5 0)) c_~B~0.base v_ArrVal_5960))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5)) 0))))) is different from false [2022-04-18 20:24:43,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_189| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_189| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_5960))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (store (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_5960))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_5960))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_5960 (Array Int Int)) (v_ArrVal_5963 (Array Int Int)) (v_ArrVal_5967 (Array Int Int)) (v_ArrVal_5968 (Array Int Int))) (= (let ((.cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) .cse6 0)) c_~B~0.base v_ArrVal_5960))) (store .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_5963) c_~F~0.base v_ArrVal_5967) |v_thread2Thread1of1ForFork1_#t~mem6.base_189| v_ArrVal_5968) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse6)) 0))))) is different from false [2022-04-18 20:24:43,321 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-04-18 20:24:43,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 61 [2022-04-18 20:24:43,330 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 20:24:43,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 502 treesize of output 478 [2022-04-18 20:24:43,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 450 treesize of output 418 [2022-04-18 20:24:43,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 418 treesize of output 402 [2022-04-18 20:24:43,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 402 treesize of output 394 [2022-04-18 20:24:43,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 206 treesize of output 202 [2022-04-18 20:24:43,957 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:24:43,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 70 treesize of output 1 [2022-04-18 20:24:43,981 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:24:43,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 70 treesize of output 1 [2022-04-18 20:24:44,001 INFO L356 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2022-04-18 20:24:44,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 70 treesize of output 1 [2022-04-18 20:24:44,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:24:44,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 27 [2022-04-18 20:24:44,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:24:44,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 68 [2022-04-18 20:24:44,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 48 [2022-04-18 20:24:44,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 46 [2022-04-18 20:24:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:24:45,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:24:45,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066129717] [2022-04-18 20:24:45,470 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:24:45,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399485426] [2022-04-18 20:24:45,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399485426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:24:45,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [588621783] [2022-04-18 20:24:45,470 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:24:45,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:24:45,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 32 [2022-04-18 20:24:45,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861026215] [2022-04-18 20:24:45,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:24:45,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-18 20:24:45,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:24:45,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-18 20:24:45,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=554, Unknown=20, NotChecked=440, Total=1122 [2022-04-18 20:24:45,477 INFO L87 Difference]: Start difference. First operand 57491 states and 176627 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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) [2022-04-18 20:24:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:24:54,796 INFO L93 Difference]: Finished difference Result 70559 states and 210308 transitions. [2022-04-18 20:24:54,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-18 20:24:54,798 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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) Word has length 34 [2022-04-18 20:24:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:24:54,987 INFO L225 Difference]: With dead ends: 70559 [2022-04-18 20:24:54,987 INFO L226 Difference]: Without dead ends: 70558 [2022-04-18 20:24:54,988 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 8 IntricatePredicates, 4 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=433, Invalid=1649, Unknown=20, NotChecked=760, Total=2862 [2022-04-18 20:24:54,988 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 725 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 7373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4886 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-18 20:24:54,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [725 Valid, 219 Invalid, 7373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 2130 Invalid, 0 Unknown, 4886 Unchecked, 4.1s Time] [2022-04-18 20:24:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70558 states. [2022-04-18 20:24:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70558 to 57954. [2022-04-18 20:24:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57954 states, 57930 states have (on average 3.0735888140859657) internal successors, (178053), 57953 states have internal predecessors, (178053), 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) [2022-04-18 20:24:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57954 states to 57954 states and 178053 transitions. [2022-04-18 20:24:56,331 INFO L78 Accepts]: Start accepts. Automaton has 57954 states and 178053 transitions. Word has length 34 [2022-04-18 20:24:56,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:24:56,332 INFO L478 AbstractCegarLoop]: Abstraction has 57954 states and 178053 transitions. [2022-04-18 20:24:56,332 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 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) [2022-04-18 20:24:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 57954 states and 178053 transitions. [2022-04-18 20:24:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:24:56,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:24:56,352 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:24:56,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-18 20:24:56,552 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,36 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:56,552 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:24:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:24:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 621108916, now seen corresponding path program 7 times [2022-04-18 20:24:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:24:56,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897771362] [2022-04-18 20:24:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:24:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:24:56,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:24:56,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172827940] [2022-04-18 20:24:56,568 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 20:24:56,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:24:56,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:24:56,569 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:24:56,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-18 20:24:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 20:24:56,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-18 20:24:56,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:24:57,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:24:57,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:57,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:24:57,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:57,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:24:58,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:24:58,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:24:58,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:24:58,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:24:58,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:58,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:24:59,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:59,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:59,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:59,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:59,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:59,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:59,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:59,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:59,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:59,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:59,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:59,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:59,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:59,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:59,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:59,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:59,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:24:59,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:24:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:24:59,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:25:00,081 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6195 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6195 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6195 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6195 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:25:00,115 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-04-18 20:25:00,185 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:25:00,239 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0))) is different from false [2022-04-18 20:25:00,259 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse1 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0))) is different from false [2022-04-18 20:25:00,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_191| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_191| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |v_thread2Thread1of1ForFork1_#t~mem6.base_191| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |v_thread2Thread1of1ForFork1_#t~mem6.base_191| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse1 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |v_thread2Thread1of1ForFork1_#t~mem6.base_191| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |v_thread2Thread1of1ForFork1_#t~mem6.base_191| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))))) is different from false [2022-04-18 20:25:00,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_191| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_191| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |v_thread2Thread1of1ForFork1_#t~mem6.base_191| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |v_thread2Thread1of1ForFork1_#t~mem6.base_191| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0) .cse1 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |v_thread2Thread1of1ForFork1_#t~mem6.base_191| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_6190 (Array Int Int)) (v_ArrVal_6195 (Array Int Int)) (v_ArrVal_6194 (Array Int Int))) (= 0 (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) .cse2 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6190) c_~F~0.base v_ArrVal_6194) |v_thread2Thread1of1ForFork1_#t~mem6.base_191| v_ArrVal_6195) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2))))))) is different from false [2022-04-18 20:25:00,490 INFO L356 Elim1Store]: treesize reduction 167, result has 18.9 percent of original size [2022-04-18 20:25:00,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 57 [2022-04-18 20:25:00,500 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-04-18 20:25:00,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 166 treesize of output 138 [2022-04-18 20:25:00,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 98 [2022-04-18 20:25:00,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 treesize of output 90 [2022-04-18 20:25:00,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-04-18 20:25:00,651 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:25:00,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 39 treesize of output 1 [2022-04-18 20:25:00,673 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:25:00,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-04-18 20:25:00,698 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-04-18 20:25:00,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 41 treesize of output 1 [2022-04-18 20:25:01,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:25:01,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 27 [2022-04-18 20:25:01,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 20:25:01,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 20:25:01,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 36 [2022-04-18 20:25:01,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-04-18 20:25:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:25:02,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 20:25:02,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897771362] [2022-04-18 20:25:02,622 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-18 20:25:02,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172827940] [2022-04-18 20:25:02,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172827940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 20:25:02,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1220335655] [2022-04-18 20:25:02,622 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-18 20:25:02,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-18 20:25:02,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-04-18 20:25:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000015612] [2022-04-18 20:25:02,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-18 20:25:02,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-18 20:25:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 20:25:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-18 20:25:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=556, Unknown=19, NotChecked=378, Total=1056 [2022-04-18 20:25:02,625 INFO L87 Difference]: Start difference. First operand 57954 states and 178053 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) [2022-04-18 20:25:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 20:25:11,293 INFO L93 Difference]: Finished difference Result 66576 states and 198477 transitions. [2022-04-18 20:25:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-18 20:25:11,296 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) Word has length 34 [2022-04-18 20:25:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 20:25:11,460 INFO L225 Difference]: With dead ends: 66576 [2022-04-18 20:25:11,461 INFO L226 Difference]: Without dead ends: 66576 [2022-04-18 20:25:11,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 6 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=438, Invalid=1733, Unknown=19, NotChecked=672, Total=2862 [2022-04-18 20:25:11,462 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 663 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1736 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-18 20:25:11,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 204 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1529 Invalid, 0 Unknown, 1736 Unchecked, 2.9s Time] [2022-04-18 20:25:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66576 states. [2022-04-18 20:25:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66576 to 58242. [2022-04-18 20:25:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58242 states, 58218 states have (on average 3.073637019478512) internal successors, (178941), 58241 states have internal predecessors, (178941), 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) [2022-04-18 20:25:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58242 states to 58242 states and 178941 transitions. [2022-04-18 20:25:12,786 INFO L78 Accepts]: Start accepts. Automaton has 58242 states and 178941 transitions. Word has length 34 [2022-04-18 20:25:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 20:25:12,786 INFO L478 AbstractCegarLoop]: Abstraction has 58242 states and 178941 transitions. [2022-04-18 20:25:12,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 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) [2022-04-18 20:25:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 58242 states and 178941 transitions. [2022-04-18 20:25:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-18 20:25:12,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 20:25:12,803 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 20:25:12,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-18 20:25:13,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-18 20:25:13,004 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-04-18 20:25:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 20:25:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash -399796302, now seen corresponding path program 8 times [2022-04-18 20:25:13,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 20:25:13,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902668611] [2022-04-18 20:25:13,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 20:25:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 20:25:13,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-18 20:25:13,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970516807] [2022-04-18 20:25:13,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 20:25:13,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 20:25:13,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 20:25:13,020 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 20:25:13,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-18 20:25:13,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 20:25:13,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 20:25:13,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-18 20:25:13,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 20:25:14,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:25:14,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:14,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:25:14,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:14,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-04-18 20:25:15,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-04-18 20:25:15,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:15,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2022-04-18 20:25:15,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-04-18 20:25:15,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:15,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:15,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:15,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-04-18 20:25:15,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:15,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:25:15,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:15,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:25:16,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-04-18 20:25:16,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2022-04-18 20:25:16,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:25:16,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:25:16,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:25:16,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:25:16,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:16,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:25:17,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 20:25:17,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-04-18 20:25:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 20:25:17,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 20:25:17,323 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6422 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6422 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6422 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6422 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-04-18 20:25:17,362 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-04-18 20:25:17,435 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-04-18 20:25:17,456 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0 0)) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0)) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-04-18 20:25:17,481 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store |c_#race| c_~B~0.base v_ArrVal_6414))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (let ((.cse1 (store |c_#race| c_~B~0.base v_ArrVal_6414))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (let ((.cse2 (store |c_#race| c_~B~0.base v_ArrVal_6414))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse3 (store |c_#race| c_~B~0.base v_ArrVal_6414))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4)) 0))) is different from false [2022-04-18 20:25:17,552 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_6414))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0)) c_~B~0.base v_ArrVal_6414))) (store .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_6414))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_6414))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse5)) 0))) is different from false [2022-04-18 20:25:17,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_193| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_193| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_6414))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |v_thread2Thread1of1ForFork1_#t~mem6.base_193| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0)) c_~B~0.base v_ArrVal_6414))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |v_thread2Thread1of1ForFork1_#t~mem6.base_193| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_6414))) (store .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |v_thread2Thread1of1ForFork1_#t~mem6.base_193| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_6414))) (store .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |v_thread2Thread1of1ForFork1_#t~mem6.base_193| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-04-18 20:25:17,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_193| Int)) (or (and (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1))) (select (select (store (store (store (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_6414))) (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |v_thread2Thread1of1ForFork1_#t~mem6.base_193| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (select (select (store (store (store (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_6414))) (store .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |v_thread2Thread1of1ForFork1_#t~mem6.base_193| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (select (select (store (store (store (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2) 0)) c_~B~0.base v_ArrVal_6414))) (store .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |v_thread2Thread1of1ForFork1_#t~mem6.base_193| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_6421 (Array Int Int)) (v_ArrVal_6422 (Array Int Int)) (v_ArrVal_6414 (Array Int Int)) (v_ArrVal_6417 (Array Int Int))) (= (let ((.cse6 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))) (select (select (store (store (store (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1) 0) .cse6 0)) c_~B~0.base v_ArrVal_6414))) (store .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3) 0))) c_~B~0.base v_ArrVal_6417) c_~F~0.base v_ArrVal_6421) |v_thread2Thread1of1ForFork1_#t~mem6.base_193| v_ArrVal_6422) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse6)) 0))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_193| (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))))) is different from false [2022-04-18 20:25:17,827 INFO L356 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-04-18 20:25:17,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 70 treesize of output 63 [2022-04-18 20:25:17,839 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-04-18 20:25:17,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1394 treesize of output 1330 [2022-04-18 20:25:18,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1254 treesize of output 1094 [2022-04-18 20:25:18,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1094 treesize of output 1054 [2022-04-18 20:25:18,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 226 treesize of output 218 [2022-04-18 20:25:18,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1046 treesize of output 966