./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 15:11:10,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:11:10,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:11:10,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:11:10,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:11:10,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:11:10,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:11:10,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:11:10,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:11:10,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:11:10,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:11:10,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:11:10,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:11:10,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:11:10,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:11:10,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:11:10,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:11:10,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:11:10,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:11:10,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:11:10,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:11:10,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:11:10,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:11:10,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:11:10,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:11:10,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:11:10,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:11:10,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:11:10,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:11:10,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:11:10,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:11:10,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:11:10,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:11:10,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:11:10,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:11:10,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:11:10,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:11:10,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:11:10,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:11:10,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:11:10,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:11:10,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-23 15:11:10,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:11:10,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:11:10,613 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:11:10,613 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:11:10,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:11:10,614 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:11:10,614 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:11:10,614 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:11:10,615 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:11:10,615 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:11:10,615 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:11:10,615 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:11:10,615 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:11:10,615 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:11:10,616 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:11:10,616 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:11:10,616 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:11:10,616 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:11:10,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:11:10,617 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:11:10,617 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:11:10,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:11:10,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:11:10,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:11:10,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:11:10,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:11:10,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:11:10,620 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-23 15:11:10,620 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:11:10,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:11:10,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:11:10,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:11:10,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:11:10,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:11:10,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:11:10,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:11:10,622 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:11:10,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:11:10,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:11:10,623 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:11:10,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:11:10,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:11:10,636 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:11:10,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW 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-11-23 15:11:10,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:11:11,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:11:11,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:11:11,009 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:11:11,010 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:11:11,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-23 15:11:14,168 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:11:14,412 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:11:14,413 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-23 15:11:14,421 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/data/3c4136e10/bec09a8cb3d24cce8c1b63538e259943/FLAG5cdebde71 [2022-11-23 15:11:14,438 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/data/3c4136e10/bec09a8cb3d24cce8c1b63538e259943 [2022-11-23 15:11:14,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:11:14,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:11:14,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:11:14,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:11:14,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:11:14,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:14,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b54e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14, skipping insertion in model container [2022-11-23 15:11:14,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:14,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:11:14,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:11:14,860 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-23 15:11:14,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:11:14,887 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:11:14,959 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-23 15:11:14,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:11:14,995 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:11:14,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14 WrapperNode [2022-11-23 15:11:14,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:11:14,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:11:14,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:11:14,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:11:15,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,033 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,080 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 341 [2022-11-23 15:11:15,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:11:15,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:11:15,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:11:15,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:11:15,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,130 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:11:15,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:11:15,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:11:15,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:11:15,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (1/1) ... [2022-11-23 15:11:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:11:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:11:15,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:11:15,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:11:15,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:11:15,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 15:11:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:11:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 15:11:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 15:11:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 15:11:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 15:11:15,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 15:11:15,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 15:11:15,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 15:11:15,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:11:15,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 15:11:15,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:11:15,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:11:15,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:11:15,245 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:11:15,383 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:11:15,389 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:11:16,345 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:11:16,358 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:11:16,359 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-23 15:11:16,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:16 BoogieIcfgContainer [2022-11-23 15:11:16,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:11:16,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:11:16,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:11:16,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:11:16,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:11:14" (1/3) ... [2022-11-23 15:11:16,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cf0865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:11:16, skipping insertion in model container [2022-11-23 15:11:16,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:11:14" (2/3) ... [2022-11-23 15:11:16,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cf0865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:11:16, skipping insertion in model container [2022-11-23 15:11:16,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:11:16" (3/3) ... [2022-11-23 15:11:16,373 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2022-11-23 15:11:16,383 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 15:11:16,395 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:11:16,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-11-23 15:11:16,395 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:11:16,559 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 15:11:16,641 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:11:16,664 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 516 places, 539 transitions, 1094 flow [2022-11-23 15:11:16,670 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 516 places, 539 transitions, 1094 flow [2022-11-23 15:11:16,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 516 places, 539 transitions, 1094 flow [2022-11-23 15:11:16,952 INFO L130 PetriNetUnfolder]: 30/537 cut-off events. [2022-11-23 15:11:16,952 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 15:11:16,961 INFO L83 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 813 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-11-23 15:11:16,969 INFO L119 LiptonReduction]: Number of co-enabled transitions 6986 [2022-11-23 15:12:04,139 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 173 DAG size of output: 167 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 15:12:08,242 INFO L134 LiptonReduction]: Checked pairs total: 48935 [2022-11-23 15:12:08,242 INFO L136 LiptonReduction]: Total number of compositions: 662 [2022-11-23 15:12:08,251 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 123 places, 123 transitions, 262 flow [2022-11-23 15:12:08,445 INFO L135 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-11-23 15:12:08,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:12:08,469 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17bf69ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:12:08,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-23 15:12:08,485 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-11-23 15:12:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:12:08,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:08,491 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:12:08,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1971, now seen corresponding path program 1 times [2022-11-23 15:12:08,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:08,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210308788] [2022-11-23 15:12:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:08,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:08,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210308788] [2022-11-23 15:12:08,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210308788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:08,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:08,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:12:08,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245050090] [2022-11-23 15:12:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:08,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:12:08,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:08,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:12:08,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:12:08,668 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-11-23 15:12:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:08,845 INFO L93 Difference]: Finished difference Result 3497 states and 9991 transitions. [2022-11-23 15:12:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:12:08,848 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-11-23 15:12:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:08,887 INFO L225 Difference]: With dead ends: 3497 [2022-11-23 15:12:08,887 INFO L226 Difference]: Without dead ends: 3495 [2022-11-23 15:12:08,888 INFO L412 NwaCegarLoop]: 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-11-23 15:12:08,892 INFO L413 NwaCegarLoop]: 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-11-23 15:12:08,893 INFO L414 NwaCegarLoop]: 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-11-23 15:12:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2022-11-23 15:12:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2022-11-23 15:12:09,076 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-11-23 15:12:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 9988 transitions. [2022-11-23 15:12:09,103 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 9988 transitions. Word has length 1 [2022-11-23 15:12:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:09,104 INFO L495 AbstractCegarLoop]: Abstraction has 3495 states and 9988 transitions. [2022-11-23 15:12:09,105 INFO L496 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-11-23 15:12:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 9988 transitions. [2022-11-23 15:12:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:12:09,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:09,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:09,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:12:09,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1855252122, now seen corresponding path program 1 times [2022-11-23 15:12:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:09,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319527741] [2022-11-23 15:12:09,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:09,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:09,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266755002] [2022-11-23 15:12:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:09,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:09,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:09,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:09,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:12:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:09,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:12:09,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:09,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:09,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:09,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319527741] [2022-11-23 15:12:09,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266755002] [2022-11-23 15:12:09,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266755002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:09,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:09,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:12:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442043676] [2022-11-23 15:12:09,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:09,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:12:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:09,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:12:09,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:12:09,444 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-11-23 15:12:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:09,889 INFO L93 Difference]: Finished difference Result 5051 states and 13782 transitions. [2022-11-23 15:12:09,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:12:09,890 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-11-23 15:12:09,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:09,919 INFO L225 Difference]: With dead ends: 5051 [2022-11-23 15:12:09,920 INFO L226 Difference]: Without dead ends: 5051 [2022-11-23 15:12:09,920 INFO L412 NwaCegarLoop]: 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-11-23 15:12:09,921 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 231 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:09,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 192 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:12:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5051 states. [2022-11-23 15:12:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5051 to 3889. [2022-11-23 15:12:10,061 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-11-23 15:12:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 11127 transitions. [2022-11-23 15:12:10,080 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 11127 transitions. Word has length 13 [2022-11-23 15:12:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:10,081 INFO L495 AbstractCegarLoop]: Abstraction has 3889 states and 11127 transitions. [2022-11-23 15:12:10,082 INFO L496 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-11-23 15:12:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 11127 transitions. [2022-11-23 15:12:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:12:10,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:10,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:10,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:10,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:10,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1689690295, now seen corresponding path program 1 times [2022-11-23 15:12:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:10,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187113605] [2022-11-23 15:12:10,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:10,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:10,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953040201] [2022-11-23 15:12:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:10,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:10,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:10,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:10,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 15:12:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:10,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 15:12:10,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:10,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:12:10,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:10,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:10,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:10,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:10,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:10,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:12:10,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:10,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:10,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:10,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:10,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:12:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:10,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:10,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:10,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187113605] [2022-11-23 15:12:10,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:10,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953040201] [2022-11-23 15:12:10,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953040201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:10,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:10,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:12:10,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576812229] [2022-11-23 15:12:10,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:10,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:12:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:10,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:12:10,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:12:10,709 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-11-23 15:12:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:11,654 INFO L93 Difference]: Finished difference Result 6342 states and 17945 transitions. [2022-11-23 15:12:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:12:11,654 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-11-23 15:12:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:11,700 INFO L225 Difference]: With dead ends: 6342 [2022-11-23 15:12:11,700 INFO L226 Difference]: Without dead ends: 6342 [2022-11-23 15:12:11,701 INFO L412 NwaCegarLoop]: 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-11-23 15:12:11,710 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 160 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:11,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 69 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 15:12:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6342 states. [2022-11-23 15:12:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6342 to 5698. [2022-11-23 15:12:11,882 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-11-23 15:12:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 16630 transitions. [2022-11-23 15:12:11,917 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 16630 transitions. Word has length 13 [2022-11-23 15:12:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:11,919 INFO L495 AbstractCegarLoop]: Abstraction has 5698 states and 16630 transitions. [2022-11-23 15:12:11,919 INFO L496 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-11-23 15:12:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 16630 transitions. [2022-11-23 15:12:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 15:12:11,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:11,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:11,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:12,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:12,135 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:12,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash -762446149, now seen corresponding path program 1 times [2022-11-23 15:12:12,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:12,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771075555] [2022-11-23 15:12:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:12,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:12,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743842260] [2022-11-23 15:12:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:12,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:12,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:12,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:12,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 15:12:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:12,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-23 15:12:12,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:12,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:12,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:12,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:12,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:12,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:12,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:12:12,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:12,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771075555] [2022-11-23 15:12:12,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743842260] [2022-11-23 15:12:12,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743842260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:12,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:12,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 15:12:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120226331] [2022-11-23 15:12:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:12,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 15:12:12,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:12,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 15:12:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:12:12,634 INFO L87 Difference]: Start difference. First operand 5698 states and 16630 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-11-23 15:12:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:14,403 INFO L93 Difference]: Finished difference Result 24236 states and 70847 transitions. [2022-11-23 15:12:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 15:12:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-11-23 15:12:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:14,523 INFO L225 Difference]: With dead ends: 24236 [2022-11-23 15:12:14,524 INFO L226 Difference]: Without dead ends: 24236 [2022-11-23 15:12:14,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-11-23 15:12:14,525 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 705 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:14,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 133 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 15:12:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24236 states. [2022-11-23 15:12:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24236 to 7693. [2022-11-23 15:12:15,040 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-11-23 15:12:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7693 states to 7693 states and 22802 transitions. [2022-11-23 15:12:15,072 INFO L78 Accepts]: Start accepts. Automaton has 7693 states and 22802 transitions. Word has length 15 [2022-11-23 15:12:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:15,073 INFO L495 AbstractCegarLoop]: Abstraction has 7693 states and 22802 transitions. [2022-11-23 15:12:15,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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-11-23 15:12:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 7693 states and 22802 transitions. [2022-11-23 15:12:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 15:12:15,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:15,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:15,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 15:12:15,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-23 15:12:15,280 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:15,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1230086114, now seen corresponding path program 1 times [2022-11-23 15:12:15,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:15,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360036584] [2022-11-23 15:12:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:15,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:15,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:15,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743764442] [2022-11-23 15:12:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:15,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:15,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:15,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:15,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 15:12:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:15,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 15:12:15,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:15,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:15,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:15,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360036584] [2022-11-23 15:12:15,564 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:15,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743764442] [2022-11-23 15:12:15,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743764442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:15,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:15,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:12:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435513765] [2022-11-23 15:12:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:15,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:12:15,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:12:15,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:12:15,567 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-11-23 15:12:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:15,915 INFO L93 Difference]: Finished difference Result 8560 states and 24995 transitions. [2022-11-23 15:12:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:12:15,916 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-11-23 15:12:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:15,961 INFO L225 Difference]: With dead ends: 8560 [2022-11-23 15:12:15,961 INFO L226 Difference]: Without dead ends: 8558 [2022-11-23 15:12:15,962 INFO L412 NwaCegarLoop]: 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-11-23 15:12:15,963 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 106 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:15,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 176 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:12:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2022-11-23 15:12:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8287. [2022-11-23 15:12:16,487 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-11-23 15:12:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 24476 transitions. [2022-11-23 15:12:16,528 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 24476 transitions. Word has length 15 [2022-11-23 15:12:16,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:16,529 INFO L495 AbstractCegarLoop]: Abstraction has 8287 states and 24476 transitions. [2022-11-23 15:12:16,529 INFO L496 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-11-23 15:12:16,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 24476 transitions. [2022-11-23 15:12:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 15:12:16,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:16,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:16,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-23 15:12:16,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:16,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1494825734, now seen corresponding path program 1 times [2022-11-23 15:12:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:16,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216181043] [2022-11-23 15:12:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:16,762 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:16,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678318876] [2022-11-23 15:12:16,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:16,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:16,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:16,780 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:16,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 15:12:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:16,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:12:16,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:17,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:17,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:17,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216181043] [2022-11-23 15:12:17,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:17,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678318876] [2022-11-23 15:12:17,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678318876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:17,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:17,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:12:17,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371531189] [2022-11-23 15:12:17,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:17,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:12:17,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:17,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:12:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:12:17,068 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-11-23 15:12:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:17,401 INFO L93 Difference]: Finished difference Result 11641 states and 34100 transitions. [2022-11-23 15:12:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:12:17,402 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-11-23 15:12:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:17,445 INFO L225 Difference]: With dead ends: 11641 [2022-11-23 15:12:17,445 INFO L226 Difference]: Without dead ends: 11633 [2022-11-23 15:12:17,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-11-23 15:12:17,446 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 184 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:17,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 233 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:12:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11633 states. [2022-11-23 15:12:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11633 to 9154. [2022-11-23 15:12:17,760 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-11-23 15:12:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 27208 transitions. [2022-11-23 15:12:17,805 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 27208 transitions. Word has length 17 [2022-11-23 15:12:17,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:17,806 INFO L495 AbstractCegarLoop]: Abstraction has 9154 states and 27208 transitions. [2022-11-23 15:12:17,807 INFO L496 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-11-23 15:12:17,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 27208 transitions. [2022-11-23 15:12:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 15:12:17,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:17,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:17,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:18,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:18,015 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:18,016 INFO L85 PathProgramCache]: Analyzing trace with hash 99014628, now seen corresponding path program 1 times [2022-11-23 15:12:18,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:18,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739765071] [2022-11-23 15:12:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:18,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:18,036 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:18,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927848193] [2022-11-23 15:12:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:18,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:18,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:18,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 15:12:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:18,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-23 15:12:18,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:18,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:18,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:18,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:18,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:18,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:18,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:12:18,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:12:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:12:18,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:18,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739765071] [2022-11-23 15:12:18,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:18,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927848193] [2022-11-23 15:12:18,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927848193] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 15:12:18,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:12:18,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2022-11-23 15:12:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26010133] [2022-11-23 15:12:18,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:18,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:12:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:12:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-23 15:12:18,643 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-11-23 15:12:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:19,312 INFO L93 Difference]: Finished difference Result 11634 states and 34334 transitions. [2022-11-23 15:12:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:12:19,313 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-11-23 15:12:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:19,354 INFO L225 Difference]: With dead ends: 11634 [2022-11-23 15:12:19,354 INFO L226 Difference]: Without dead ends: 11634 [2022-11-23 15:12:19,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-23 15:12:19,356 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 74 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:19,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 15:12:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2022-11-23 15:12:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 9834. [2022-11-23 15:12:19,678 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-11-23 15:12:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9834 states to 9834 states and 29150 transitions. [2022-11-23 15:12:19,712 INFO L78 Accepts]: Start accepts. Automaton has 9834 states and 29150 transitions. Word has length 18 [2022-11-23 15:12:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:19,712 INFO L495 AbstractCegarLoop]: Abstraction has 9834 states and 29150 transitions. [2022-11-23 15:12:19,712 INFO L496 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-11-23 15:12:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 9834 states and 29150 transitions. [2022-11-23 15:12:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 15:12:19,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:19,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:12:19,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:19,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:19,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:19,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:19,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1091291607, now seen corresponding path program 1 times [2022-11-23 15:12:19,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:19,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621618015] [2022-11-23 15:12:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:19,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:19,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782315629] [2022-11-23 15:12:19,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:19,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:19,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:19,945 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:19,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 15:12:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:20,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 15:12:20,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:20,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:20,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:20,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:20,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:20,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:20,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:12:20,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:20,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:20,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621618015] [2022-11-23 15:12:20,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:20,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782315629] [2022-11-23 15:12:20,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782315629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:20,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:20,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 15:12:20,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227347079] [2022-11-23 15:12:20,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:20,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 15:12:20,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:20,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 15:12:20,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:12:20,493 INFO L87 Difference]: Start difference. First operand 9834 states and 29150 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-11-23 15:12:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:21,810 INFO L93 Difference]: Finished difference Result 15553 states and 45131 transitions. [2022-11-23 15:12:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 15:12:21,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-11-23 15:12:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:21,862 INFO L225 Difference]: With dead ends: 15553 [2022-11-23 15:12:21,862 INFO L226 Difference]: Without dead ends: 15553 [2022-11-23 15:12:21,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2022-11-23 15:12:21,863 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 572 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:21,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 159 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 15:12:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15553 states. [2022-11-23 15:12:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15553 to 12466. [2022-11-23 15:12:22,357 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-11-23 15:12:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37164 transitions. [2022-11-23 15:12:22,400 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37164 transitions. Word has length 21 [2022-11-23 15:12:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:22,400 INFO L495 AbstractCegarLoop]: Abstraction has 12466 states and 37164 transitions. [2022-11-23 15:12:22,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-11-23 15:12:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37164 transitions. [2022-11-23 15:12:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 15:12:22,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:22,404 INFO L195 NwaCegarLoop]: 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-11-23 15:12:22,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:22,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-23 15:12:22,621 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:22,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash -688650743, now seen corresponding path program 1 times [2022-11-23 15:12:22,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:22,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901947164] [2022-11-23 15:12:22,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:22,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:22,638 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:22,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609324933] [2022-11-23 15:12:22,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:22,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:22,640 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:22,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 15:12:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:22,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 15:12:22,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:22,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:12:22,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:22,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:22,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:22,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:22,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:22,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:12:22,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:22,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:22,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:22,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:22,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:12:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:12:22,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:22,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:22,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901947164] [2022-11-23 15:12:22,968 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:22,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609324933] [2022-11-23 15:12:22,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609324933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:22,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:22,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:12:22,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758560175] [2022-11-23 15:12:22,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:22,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:12:22,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:22,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:12:22,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:12:22,970 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-11-23 15:12:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:23,617 INFO L93 Difference]: Finished difference Result 12564 states and 37342 transitions. [2022-11-23 15:12:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:12:23,618 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-11-23 15:12:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:23,650 INFO L225 Difference]: With dead ends: 12564 [2022-11-23 15:12:23,650 INFO L226 Difference]: Without dead ends: 12386 [2022-11-23 15:12:23,651 INFO L412 NwaCegarLoop]: 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-11-23 15:12:23,651 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:23,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 63 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:12:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2022-11-23 15:12:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12365. [2022-11-23 15:12:23,933 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-11-23 15:12:24,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12365 states to 12365 states and 36775 transitions. [2022-11-23 15:12:24,081 INFO L78 Accepts]: Start accepts. Automaton has 12365 states and 36775 transitions. Word has length 22 [2022-11-23 15:12:24,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:24,081 INFO L495 AbstractCegarLoop]: Abstraction has 12365 states and 36775 transitions. [2022-11-23 15:12:24,081 INFO L496 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-11-23 15:12:24,081 INFO L276 IsEmpty]: Start isEmpty. Operand 12365 states and 36775 transitions. [2022-11-23 15:12:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:12:24,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:24,085 INFO L195 NwaCegarLoop]: 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-11-23 15:12:24,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:24,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 15:12:24,291 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash 477787027, now seen corresponding path program 1 times [2022-11-23 15:12:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:24,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685426431] [2022-11-23 15:12:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:24,315 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:24,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211041165] [2022-11-23 15:12:24,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:24,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:24,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:24,317 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:24,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 15:12:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:24,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:12:24,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:24,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-11-23 15:12:24,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2022-11-23 15:12:24,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:24,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2022-11-23 15:12:24,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:24,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 77 [2022-11-23 15:12:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:12:24,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:24,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:24,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685426431] [2022-11-23 15:12:24,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:24,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211041165] [2022-11-23 15:12:24,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211041165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:24,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:24,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:12:24,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633871664] [2022-11-23 15:12:24,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:24,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:12:24,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:24,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:12:24,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:12:24,660 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-11-23 15:12:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:25,362 INFO L93 Difference]: Finished difference Result 13426 states and 39809 transitions. [2022-11-23 15:12:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:12:25,363 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-11-23 15:12:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:25,397 INFO L225 Difference]: With dead ends: 13426 [2022-11-23 15:12:25,398 INFO L226 Difference]: Without dead ends: 13426 [2022-11-23 15:12:25,398 INFO L412 NwaCegarLoop]: 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-11-23 15:12:25,398 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 68 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:25,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 56 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 15:12:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13426 states. [2022-11-23 15:12:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13426 to 12964. [2022-11-23 15:12:25,800 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-11-23 15:12:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12964 states to 12964 states and 38477 transitions. [2022-11-23 15:12:25,867 INFO L78 Accepts]: Start accepts. Automaton has 12964 states and 38477 transitions. Word has length 24 [2022-11-23 15:12:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:25,868 INFO L495 AbstractCegarLoop]: Abstraction has 12964 states and 38477 transitions. [2022-11-23 15:12:25,868 INFO L496 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-11-23 15:12:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 12964 states and 38477 transitions. [2022-11-23 15:12:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 15:12:25,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:25,876 INFO L195 NwaCegarLoop]: 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-11-23 15:12:25,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:26,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:26,082 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:26,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -62933662, now seen corresponding path program 1 times [2022-11-23 15:12:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:26,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044162414] [2022-11-23 15:12:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:26,104 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:26,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839524176] [2022-11-23 15:12:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:26,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:26,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:26,106 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:26,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 15:12:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:26,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-23 15:12:26,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:26,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:26,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:26,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:26,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:26,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:26,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:12:26,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:26,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:26,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044162414] [2022-11-23 15:12:26,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:26,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839524176] [2022-11-23 15:12:26,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839524176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:26,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:26,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 15:12:26,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394019021] [2022-11-23 15:12:26,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:26,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 15:12:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:26,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 15:12:26,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:12:26,880 INFO L87 Difference]: Start difference. First operand 12964 states and 38477 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-11-23 15:12:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:28,515 INFO L93 Difference]: Finished difference Result 17019 states and 49378 transitions. [2022-11-23 15:12:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 15:12:28,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-11-23 15:12:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:28,557 INFO L225 Difference]: With dead ends: 17019 [2022-11-23 15:12:28,557 INFO L226 Difference]: Without dead ends: 17019 [2022-11-23 15:12:28,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-11-23 15:12:28,558 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 369 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:28,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 184 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 15:12:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2022-11-23 15:12:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 13428. [2022-11-23 15:12:28,884 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-11-23 15:12:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13428 states to 13428 states and 39901 transitions. [2022-11-23 15:12:28,943 INFO L78 Accepts]: Start accepts. Automaton has 13428 states and 39901 transitions. Word has length 25 [2022-11-23 15:12:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:28,943 INFO L495 AbstractCegarLoop]: Abstraction has 13428 states and 39901 transitions. [2022-11-23 15:12:28,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-11-23 15:12:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 13428 states and 39901 transitions. [2022-11-23 15:12:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 15:12:28,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:28,948 INFO L195 NwaCegarLoop]: 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-11-23 15:12:28,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:29,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:29,149 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash 183808725, now seen corresponding path program 1 times [2022-11-23 15:12:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:29,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381626681] [2022-11-23 15:12:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:29,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:29,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037750952] [2022-11-23 15:12:29,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:29,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:29,171 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:29,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 15:12:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:29,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-23 15:12:29,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:29,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:12:29,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:29,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:29,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:29,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:29,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:12:29,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:29,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:29,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:29,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:12:29,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:29,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:12:29,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:29,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:29,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381626681] [2022-11-23 15:12:29,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:29,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037750952] [2022-11-23 15:12:29,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037750952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:29,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:29,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 15:12:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683371587] [2022-11-23 15:12:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:29,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 15:12:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:29,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 15:12:29,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:12:29,699 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-11-23 15:12:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:30,769 INFO L93 Difference]: Finished difference Result 16791 states and 49002 transitions. [2022-11-23 15:12:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:12:30,771 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-11-23 15:12:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:30,824 INFO L225 Difference]: With dead ends: 16791 [2022-11-23 15:12:30,824 INFO L226 Difference]: Without dead ends: 16767 [2022-11-23 15:12:30,825 INFO L412 NwaCegarLoop]: 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-11-23 15:12:30,825 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 176 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:30,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 98 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 15:12:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16767 states. [2022-11-23 15:12:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16767 to 12828. [2022-11-23 15:12:31,164 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-11-23 15:12:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12828 states to 12828 states and 38006 transitions. [2022-11-23 15:12:31,213 INFO L78 Accepts]: Start accepts. Automaton has 12828 states and 38006 transitions. Word has length 25 [2022-11-23 15:12:31,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:31,213 INFO L495 AbstractCegarLoop]: Abstraction has 12828 states and 38006 transitions. [2022-11-23 15:12:31,213 INFO L496 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-11-23 15:12:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 12828 states and 38006 transitions. [2022-11-23 15:12:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:12:31,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:31,220 INFO L195 NwaCegarLoop]: 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-11-23 15:12:31,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:31,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 15:12:31,423 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:31,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1924236333, now seen corresponding path program 1 times [2022-11-23 15:12:31,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:31,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015510741] [2022-11-23 15:12:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:31,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:31,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41951238] [2022-11-23 15:12:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:31,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:31,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:31,447 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:31,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 15:12:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:31,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 15:12:31,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:12:31,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:12:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:12:31,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:31,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015510741] [2022-11-23 15:12:31,892 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:31,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41951238] [2022-11-23 15:12:31,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41951238] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:12:31,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1105486912] [2022-11-23 15:12:31,901 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:12:31,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:12:31,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-23 15:12:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541223651] [2022-11-23 15:12:31,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:12:31,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 15:12:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 15:12:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:12:31,906 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-11-23 15:12:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:32,714 INFO L93 Difference]: Finished difference Result 22207 states and 64542 transitions. [2022-11-23 15:12:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 15:12:32,715 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-11-23 15:12:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:32,770 INFO L225 Difference]: With dead ends: 22207 [2022-11-23 15:12:32,770 INFO L226 Difference]: Without dead ends: 21167 [2022-11-23 15:12:32,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-23 15:12:32,771 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 375 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:32,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 580 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 15:12:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21167 states. [2022-11-23 15:12:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21167 to 19081. [2022-11-23 15:12:33,179 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-11-23 15:12:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19081 states to 19081 states and 57321 transitions. [2022-11-23 15:12:33,227 INFO L78 Accepts]: Start accepts. Automaton has 19081 states and 57321 transitions. Word has length 28 [2022-11-23 15:12:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:33,228 INFO L495 AbstractCegarLoop]: Abstraction has 19081 states and 57321 transitions. [2022-11-23 15:12:33,228 INFO L496 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-11-23 15:12:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 19081 states and 57321 transitions. [2022-11-23 15:12:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 15:12:33,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:33,237 INFO L195 NwaCegarLoop]: 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-11-23 15:12:33,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:33,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:33,444 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash 377215540, now seen corresponding path program 2 times [2022-11-23 15:12:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:33,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076601247] [2022-11-23 15:12:33,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:33,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:33,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:33,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270734964] [2022-11-23 15:12:33,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:12:33,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:33,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:33,466 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:33,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 15:12:33,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:12:33,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:12:33,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:12:33,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:33,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:33,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 15:12:33,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:33,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:33,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:33,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 15:12:33,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:33,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:33,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076601247] [2022-11-23 15:12:33,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:33,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270734964] [2022-11-23 15:12:33,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270734964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:33,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:33,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:12:33,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847942999] [2022-11-23 15:12:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:33,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:12:33,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:33,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:12:33,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:12:33,795 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-11-23 15:12:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:34,724 INFO L93 Difference]: Finished difference Result 21419 states and 64260 transitions. [2022-11-23 15:12:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:12:34,725 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-11-23 15:12:34,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:34,783 INFO L225 Difference]: With dead ends: 21419 [2022-11-23 15:12:34,783 INFO L226 Difference]: Without dead ends: 21419 [2022-11-23 15:12:34,783 INFO L412 NwaCegarLoop]: 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-11-23 15:12:34,784 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 74 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:34,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 15:12:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21419 states. [2022-11-23 15:12:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21419 to 19921. [2022-11-23 15:12:35,482 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-11-23 15:12:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19921 states to 19921 states and 59820 transitions. [2022-11-23 15:12:35,558 INFO L78 Accepts]: Start accepts. Automaton has 19921 states and 59820 transitions. Word has length 30 [2022-11-23 15:12:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:35,558 INFO L495 AbstractCegarLoop]: Abstraction has 19921 states and 59820 transitions. [2022-11-23 15:12:35,559 INFO L496 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-11-23 15:12:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 19921 states and 59820 transitions. [2022-11-23 15:12:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 15:12:35,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:35,570 INFO L195 NwaCegarLoop]: 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-11-23 15:12:35,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:35,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 15:12:35,776 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:35,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1176781416, now seen corresponding path program 1 times [2022-11-23 15:12:35,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:35,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643660185] [2022-11-23 15:12:35,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:35,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:35,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:35,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236999238] [2022-11-23 15:12:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:35,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:35,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:35,807 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:35,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 15:12:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:36,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-23 15:12:36,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:36,139 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 15:12:36,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-23 15:12:36,204 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 15:12:36,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 15:12:36,254 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:12:36,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 15:12:36,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:36,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 15:12:36,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:36,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:36,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:12:36,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:36,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:36,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643660185] [2022-11-23 15:12:36,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:36,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236999238] [2022-11-23 15:12:36,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236999238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:36,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:36,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 15:12:36,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544559056] [2022-11-23 15:12:36,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:36,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 15:12:36,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:36,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 15:12:36,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:12:36,708 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-11-23 15:12:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:38,068 INFO L93 Difference]: Finished difference Result 25553 states and 75637 transitions. [2022-11-23 15:12:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 15:12:38,068 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-11-23 15:12:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:38,136 INFO L225 Difference]: With dead ends: 25553 [2022-11-23 15:12:38,136 INFO L226 Difference]: Without dead ends: 25553 [2022-11-23 15:12:38,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-11-23 15:12:38,138 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 409 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:38,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 92 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 15:12:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25553 states. [2022-11-23 15:12:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25553 to 21269. [2022-11-23 15:12:38,612 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-11-23 15:12:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 63964 transitions. [2022-11-23 15:12:38,670 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 63964 transitions. Word has length 30 [2022-11-23 15:12:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:38,671 INFO L495 AbstractCegarLoop]: Abstraction has 21269 states and 63964 transitions. [2022-11-23 15:12:38,671 INFO L496 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-11-23 15:12:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 63964 transitions. [2022-11-23 15:12:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 15:12:38,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:38,679 INFO L195 NwaCegarLoop]: 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-11-23 15:12:38,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:38,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 15:12:38,886 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash 832271772, now seen corresponding path program 1 times [2022-11-23 15:12:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:38,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101043742] [2022-11-23 15:12:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:38,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:38,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:38,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121490047] [2022-11-23 15:12:38,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:38,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:38,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:38,910 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:38,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 15:12:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:39,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 15:12:39,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:39,255 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 15:12:39,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-23 15:12:39,293 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 15:12:39,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 15:12:39,323 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:12:39,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 15:12:39,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:39,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 15:12:39,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:39,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:39,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:12:39,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:12:39,766 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_thread2Thread1of1ForFork1_~i~1 4))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 3 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 c_~B~0.offset 1)) 0)))) is different from false [2022-11-23 15:12:39,796 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (+ .cse2 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0)))))) is different from false [2022-11-23 15:12:39,835 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse3 (+ .cse2 2 c_~B~0.offset)) (.cse1 (+ .cse2 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse3) 0)))))) is different from false [2022-11-23 15:12:39,865 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse4 (+ .cse1 c_~B~0.offset 1)) (.cse2 (+ .cse1 2 c_~B~0.offset)) (.cse3 (+ .cse1 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse4 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= 0 (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse3))) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse4) 0)))))) is different from false [2022-11-23 15:12:39,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:39,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2022-11-23 15:12:39,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:39,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2022-11-23 15:12:39,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-23 15:12:39,920 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-23 15:12:39,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2022-11-23 15:12:39,927 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-23 15:12:39,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-11-23 15:12:39,934 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-23 15:12:39,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-11-23 15:12:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:12:40,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:40,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101043742] [2022-11-23 15:12:40,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:40,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121490047] [2022-11-23 15:12:40,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121490047] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 15:12:40,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:12:40,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2022-11-23 15:12:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113330081] [2022-11-23 15:12:40,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:40,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 15:12:40,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:40,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 15:12:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=209, Unknown=4, NotChecked=132, Total=420 [2022-11-23 15:12:40,100 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-11-23 15:12:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:42,857 INFO L93 Difference]: Finished difference Result 30009 states and 89637 transitions. [2022-11-23 15:12:42,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 15:12:42,858 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-11-23 15:12:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:42,968 INFO L225 Difference]: With dead ends: 30009 [2022-11-23 15:12:42,968 INFO L226 Difference]: Without dead ends: 30009 [2022-11-23 15:12:42,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=150, Invalid=461, Unknown=5, NotChecked=196, Total=812 [2022-11-23 15:12:42,969 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 349 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 12 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 703 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:42,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 52 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 382 Invalid, 18 Unknown, 703 Unchecked, 1.7s Time] [2022-11-23 15:12:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30009 states. [2022-11-23 15:12:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30009 to 21437. [2022-11-23 15:12:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21437 states, 21416 states have (on average 3.0097123645872244) internal successors, (64456), 21436 states have internal predecessors, (64456), 0 states have call successors, (0), 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-11-23 15:12:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21437 states to 21437 states and 64456 transitions. [2022-11-23 15:12:43,849 INFO L78 Accepts]: Start accepts. Automaton has 21437 states and 64456 transitions. Word has length 30 [2022-11-23 15:12:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:43,849 INFO L495 AbstractCegarLoop]: Abstraction has 21437 states and 64456 transitions. [2022-11-23 15:12:43,849 INFO L496 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-11-23 15:12:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 21437 states and 64456 transitions. [2022-11-23 15:12:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 15:12:43,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:43,854 INFO L195 NwaCegarLoop]: 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-11-23 15:12:43,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:44,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 15:12:44,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash 832483812, now seen corresponding path program 2 times [2022-11-23 15:12:44,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:44,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620631652] [2022-11-23 15:12:44,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:44,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:44,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:44,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849055984] [2022-11-23 15:12:44,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:12:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:44,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:44,078 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:44,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 15:12:44,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:12:44,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:12:44,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-23 15:12:44,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:44,419 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 15:12:44,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-23 15:12:44,458 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 15:12:44,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 15:12:44,486 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:12:44,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 15:12:44,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:44,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 15:12:44,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:44,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:44,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:44,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:12:44,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:44,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:44,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620631652] [2022-11-23 15:12:44,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:44,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849055984] [2022-11-23 15:12:44,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849055984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:44,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:44,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 15:12:44,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365920114] [2022-11-23 15:12:44,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:44,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 15:12:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:44,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 15:12:44,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:12:44,835 INFO L87 Difference]: Start difference. First operand 21437 states and 64456 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-11-23 15:12:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:46,143 INFO L93 Difference]: Finished difference Result 40389 states and 121799 transitions. [2022-11-23 15:12:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 15:12:46,143 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-11-23 15:12:46,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:46,256 INFO L225 Difference]: With dead ends: 40389 [2022-11-23 15:12:46,256 INFO L226 Difference]: Without dead ends: 40389 [2022-11-23 15:12:46,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-11-23 15:12:46,257 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 372 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:46,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 107 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 15:12:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40389 states. [2022-11-23 15:12:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40389 to 35161. [2022-11-23 15:12:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35161 states, 35140 states have (on average 3.074843483210017) internal successors, (108050), 35160 states have internal predecessors, (108050), 0 states have call successors, (0), 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-11-23 15:12:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35161 states to 35161 states and 108050 transitions. [2022-11-23 15:12:47,264 INFO L78 Accepts]: Start accepts. Automaton has 35161 states and 108050 transitions. Word has length 30 [2022-11-23 15:12:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:47,265 INFO L495 AbstractCegarLoop]: Abstraction has 35161 states and 108050 transitions. [2022-11-23 15:12:47,265 INFO L496 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-11-23 15:12:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 35161 states and 108050 transitions. [2022-11-23 15:12:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 15:12:47,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:47,275 INFO L195 NwaCegarLoop]: 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-11-23 15:12:47,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:47,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 15:12:47,476 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 936168753, now seen corresponding path program 1 times [2022-11-23 15:12:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:47,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571728231] [2022-11-23 15:12:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:47,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:47,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2022056384] [2022-11-23 15:12:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:47,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:47,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:47,501 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:47,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 15:12:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:47,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:12:47,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:47,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:47,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 15:12:47,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:47,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:47,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:47,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:12:47,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:12:47,880 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:47,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571728231] [2022-11-23 15:12:47,880 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:47,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022056384] [2022-11-23 15:12:47,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022056384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:12:47,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:12:47,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:12:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950063640] [2022-11-23 15:12:47,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:47,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:12:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:12:47,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:12:47,883 INFO L87 Difference]: Start difference. First operand 35161 states and 108050 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-11-23 15:12:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:12:48,740 INFO L93 Difference]: Finished difference Result 37493 states and 115031 transitions. [2022-11-23 15:12:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:12:48,740 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-11-23 15:12:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:12:48,847 INFO L225 Difference]: With dead ends: 37493 [2022-11-23 15:12:48,847 INFO L226 Difference]: Without dead ends: 37473 [2022-11-23 15:12:48,847 INFO L412 NwaCegarLoop]: 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-11-23 15:12:48,848 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:12:48,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 52 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:12:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37473 states. [2022-11-23 15:12:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37473 to 37473. [2022-11-23 15:12:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37473 states, 37452 states have (on average 3.0698494072412688) internal successors, (114972), 37472 states have internal predecessors, (114972), 0 states have call successors, (0), 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-11-23 15:12:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37473 states to 37473 states and 114972 transitions. [2022-11-23 15:12:49,913 INFO L78 Accepts]: Start accepts. Automaton has 37473 states and 114972 transitions. Word has length 30 [2022-11-23 15:12:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:12:49,913 INFO L495 AbstractCegarLoop]: Abstraction has 37473 states and 114972 transitions. [2022-11-23 15:12:49,913 INFO L496 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-11-23 15:12:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 37473 states and 114972 transitions. [2022-11-23 15:12:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 15:12:49,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:12:49,925 INFO L195 NwaCegarLoop]: 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-11-23 15:12:49,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 15:12:50,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 15:12:50,131 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:12:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:12:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1750440838, now seen corresponding path program 1 times [2022-11-23 15:12:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:12:50,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115856846] [2022-11-23 15:12:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:50,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:12:50,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:12:50,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495529777] [2022-11-23 15:12:50,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:12:50,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:12:50,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:12:50,152 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:12:50,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 15:12:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:12:50,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-23 15:12:50,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:12:50,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:50,492 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 15:12:50,493 INFO L350 Elim1Store]: Elim1 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-11-23 15:12:50,539 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:12:50,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 15:12:50,591 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:12:50,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 15:12:50,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:12:50,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 15:12:50,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:12:50,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:12:51,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:12:51,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-11-23 15:12:51,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:12:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:12:51,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:12:51,287 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_thread1Thread1of1ForFork0_~i~0 4))) (and (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse0)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset 2 .cse0)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse0 1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset 3 .cse0)) |c_thread1Thread1of1ForFork0_#t~nondet3|)))) is different from false [2022-11-23 15:12:51,452 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse1)) (.cse3 (+ c_~A~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 |c_thread1Thread1of1ForFork0_#t~nondet3|) .cse3 |c_thread1Thread1of1ForFork0_#t~nondet3|)))) (and (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse2) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse3) |c_thread1Thread1of1ForFork0_#t~nondet3|)))))) is different from false [2022-11-23 15:12:51,480 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse3 1)) (.cse2 (+ c_~A~0.offset 2 .cse3)) (.cse4 (+ c_~A~0.offset 3 .cse3))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (select |c_#race| c_~A~0.base) .cse1 |c_thread1Thread1of1ForFork0_#t~nondet3|) .cse2 |c_thread1Thread1of1ForFork0_#t~nondet3|) .cse4 |c_thread1Thread1of1ForFork0_#t~nondet3|)))) (and (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse1) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse2) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse3)) |c_thread1Thread1of1ForFork0_#t~nondet3|)) (forall ((v_ArrVal_2497 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2496) c_~B~0.base v_ArrVal_2497) c_~A~0.base) .cse4) |c_thread1Thread1of1ForFork0_#t~nondet3|)))))) is different from false [2022-11-23 15:12:51,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:51,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 70 [2022-11-23 15:12:51,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:12:51,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 71 [2022-11-23 15:12:51,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-11-23 15:12:51,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-11-23 15:12:51,557 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-23 15:12:51,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 1 [2022-11-23 15:12:51,568 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-23 15:12:51,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 1 [2022-11-23 15:12:51,577 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-23 15:12:51,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 1 [2022-11-23 15:12:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:12:51,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:12:51,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115856846] [2022-11-23 15:12:51,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:12:51,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495529777] [2022-11-23 15:12:51,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495529777] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 15:12:51,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:12:51,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 21 [2022-11-23 15:12:51,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229255444] [2022-11-23 15:12:51,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:12:51,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 15:12:51,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:12:51,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 15:12:51,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=292, Unknown=14, NotChecked=114, Total=506 [2022-11-23 15:12:51,876 INFO L87 Difference]: Start difference. First operand 37473 states and 114972 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-11-23 15:12:57,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:12:59,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:13:01,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:13:04,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:13:06,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:13:09,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:13:12,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-23 15:13:14,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-23 15:13:16,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-23 15:13:19,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 15:13:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:13:20,375 INFO L93 Difference]: Finished difference Result 46115 states and 140954 transitions. [2022-11-23 15:13:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 15:13:20,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-11-23 15:13:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:13:20,540 INFO L225 Difference]: With dead ends: 46115 [2022-11-23 15:13:20,540 INFO L226 Difference]: Without dead ends: 46083 [2022-11-23 15:13:20,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=550, Unknown=16, NotChecked=156, Total=870 [2022-11-23 15:13:20,540 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 235 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 19 mSolverCounterUnsat, 118 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 118 IncrementalHoareTripleChecker+Unknown, 597 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2022-11-23 15:13:20,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 105 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 767 Invalid, 118 Unknown, 597 Unchecked, 26.9s Time] [2022-11-23 15:13:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46083 states. [2022-11-23 15:13:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46083 to 40741. [2022-11-23 15:13:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40741 states, 40720 states have (on average 3.0721267190569743) internal successors, (125097), 40740 states have internal predecessors, (125097), 0 states have call successors, (0), 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-11-23 15:13:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40741 states to 40741 states and 125097 transitions. [2022-11-23 15:13:21,759 INFO L78 Accepts]: Start accepts. Automaton has 40741 states and 125097 transitions. Word has length 32 [2022-11-23 15:13:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:13:21,760 INFO L495 AbstractCegarLoop]: Abstraction has 40741 states and 125097 transitions. [2022-11-23 15:13:21,760 INFO L496 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-11-23 15:13:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 40741 states and 125097 transitions. [2022-11-23 15:13:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 15:13:21,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:13:21,773 INFO L195 NwaCegarLoop]: 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-11-23 15:13:21,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 15:13:21,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:21,974 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:13:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:13:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1750619398, now seen corresponding path program 2 times [2022-11-23 15:13:21,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:13:21,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555571000] [2022-11-23 15:13:21,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:21,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:13:21,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:13:21,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015546754] [2022-11-23 15:13:21,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:13:21,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:21,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:13:21,997 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:13:22,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 15:13:22,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:13:22,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:13:22,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-23 15:13:22,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:13:22,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:22,311 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 15:13:22,312 INFO L350 Elim1Store]: Elim1 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-11-23 15:13:22,361 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:13:22,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 15:13:22,413 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:13:22,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 15:13:22,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:13:22,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 15:13:22,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:13:22,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:13:22,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:22,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:22,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:13:23,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:13:23,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:13:23,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555571000] [2022-11-23 15:13:23,032 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:13:23,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015546754] [2022-11-23 15:13:23,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015546754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:13:23,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:13:23,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 15:13:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878363065] [2022-11-23 15:13:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:13:23,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 15:13:23,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:13:23,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 15:13:23,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:13:23,033 INFO L87 Difference]: Start difference. First operand 40741 states and 125097 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-11-23 15:13:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:13:25,042 INFO L93 Difference]: Finished difference Result 46570 states and 141511 transitions. [2022-11-23 15:13:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 15:13:25,043 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-11-23 15:13:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:13:25,163 INFO L225 Difference]: With dead ends: 46570 [2022-11-23 15:13:25,163 INFO L226 Difference]: Without dead ends: 46570 [2022-11-23 15:13:25,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-11-23 15:13:25,164 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 283 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:13:25,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 116 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 15:13:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46570 states. [2022-11-23 15:13:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46570 to 37783. [2022-11-23 15:13:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37783 states, 37762 states have (on average 3.0650124463746624) internal successors, (115741), 37782 states have internal predecessors, (115741), 0 states have call successors, (0), 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-11-23 15:13:26,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37783 states to 37783 states and 115741 transitions. [2022-11-23 15:13:26,101 INFO L78 Accepts]: Start accepts. Automaton has 37783 states and 115741 transitions. Word has length 32 [2022-11-23 15:13:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:13:26,102 INFO L495 AbstractCegarLoop]: Abstraction has 37783 states and 115741 transitions. [2022-11-23 15:13:26,102 INFO L496 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-11-23 15:13:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 37783 states and 115741 transitions. [2022-11-23 15:13:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 15:13:26,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:13:26,110 INFO L195 NwaCegarLoop]: 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-11-23 15:13:26,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-23 15:13:26,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:26,310 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:13:26,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:13:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1386527827, now seen corresponding path program 1 times [2022-11-23 15:13:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:13:26,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844704637] [2022-11-23 15:13:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:13:26,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:13:26,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726921331] [2022-11-23 15:13:26,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:26,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:26,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:13:26,332 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:13:26,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 15:13:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:13:26,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:13:26,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:13:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:13:26,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:13:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:13:26,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:13:26,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844704637] [2022-11-23 15:13:26,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:13:26,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726921331] [2022-11-23 15:13:26,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726921331] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 15:13:26,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:13:26,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-23 15:13:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179742977] [2022-11-23 15:13:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:13:26,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:13:26,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:13:26,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:13:26,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:13:26,743 INFO L87 Difference]: Start difference. First operand 37783 states and 115741 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-11-23 15:13:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:13:27,371 INFO L93 Difference]: Finished difference Result 38896 states and 118818 transitions. [2022-11-23 15:13:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:13:27,371 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-11-23 15:13:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:13:27,470 INFO L225 Difference]: With dead ends: 38896 [2022-11-23 15:13:27,470 INFO L226 Difference]: Without dead ends: 38869 [2022-11-23 15:13:27,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:13:27,471 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 122 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:13:27,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 74 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:13:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38869 states. [2022-11-23 15:13:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38869 to 38867. [2022-11-23 15:13:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38867 states, 38845 states have (on average 3.05676406229888) internal successors, (118740), 38866 states have internal predecessors, (118740), 0 states have call successors, (0), 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-11-23 15:13:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38867 states to 38867 states and 118740 transitions. [2022-11-23 15:13:28,330 INFO L78 Accepts]: Start accepts. Automaton has 38867 states and 118740 transitions. Word has length 32 [2022-11-23 15:13:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:13:28,331 INFO L495 AbstractCegarLoop]: Abstraction has 38867 states and 118740 transitions. [2022-11-23 15:13:28,331 INFO L496 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-11-23 15:13:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 38867 states and 118740 transitions. [2022-11-23 15:13:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 15:13:28,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:13:28,337 INFO L195 NwaCegarLoop]: 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-11-23 15:13:28,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-23 15:13:28,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:28,538 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:13:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:13:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2079790042, now seen corresponding path program 1 times [2022-11-23 15:13:28,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:13:28,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100780364] [2022-11-23 15:13:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:13:28,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:13:28,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870323735] [2022-11-23 15:13:28,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:28,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:28,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:13:28,558 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:13:28,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-23 15:13:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:13:28,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-23 15:13:28,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:13:29,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:13:29,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:29,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:29,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 15:13:29,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:13:29,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:29,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:13:29,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:13:29,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:29,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:29,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:29,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:29,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:30,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:30,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:30,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:30,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:30,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:30,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:30,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:30,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:30,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:30,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:13:30,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:13:30,632 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3078 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3078 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3078 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3078 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-11-23 15:13:30,681 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-23 15:13:30,802 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-11-23 15:13:30,887 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-11-23 15:13:30,916 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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) .cse2 0)))) (and (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)))) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3077 (Array Int Int)) (v_ArrVal_3078 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3073) c_~F~0.base v_ArrVal_3077) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3078) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0))))) is different from false [2022-11-23 15:13:31,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:31,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2022-11-23 15:13:31,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:31,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1004 treesize of output 950 [2022-11-23 15:13:31,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 870 treesize of output 806 [2022-11-23 15:13:31,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 806 treesize of output 790 [2022-11-23 15:13:31,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 758 [2022-11-23 15:13:32,633 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3061 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3061) c_~B~0.base) c_~B~0.offset) |c_ULTIMATE.start_main_~#t1~0#1.base|))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-23 15:13:32,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:32,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-23 15:13:32,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:13:32,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:32,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-23 15:13:32,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-23 15:13:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:13:33,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:13:33,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100780364] [2022-11-23 15:13:33,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:13:33,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870323735] [2022-11-23 15:13:33,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870323735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:13:33,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1971679508] [2022-11-23 15:13:33,051 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:13:33,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:13:33,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-23 15:13:33,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065644501] [2022-11-23 15:13:33,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:13:33,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 15:13:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:13:33,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 15:13:33,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=592, Unknown=26, NotChecked=330, Total=1056 [2022-11-23 15:13:33,055 INFO L87 Difference]: Start difference. First operand 38867 states and 118740 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-11-23 15:13:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:13:43,218 INFO L93 Difference]: Finished difference Result 65685 states and 195144 transitions. [2022-11-23 15:13:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 15:13:43,219 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-11-23 15:13:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:13:43,395 INFO L225 Difference]: With dead ends: 65685 [2022-11-23 15:13:43,395 INFO L226 Difference]: Without dead ends: 65682 [2022-11-23 15:13:43,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=507, Invalid=1731, Unknown=42, NotChecked=582, Total=2862 [2022-11-23 15:13:43,396 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1083 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 3478 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 6267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 3478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2472 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:13:43,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 219 Invalid, 6267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 3478 Invalid, 0 Unknown, 2472 Unchecked, 6.7s Time] [2022-11-23 15:13:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65682 states. [2022-11-23 15:13:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65682 to 47764. [2022-11-23 15:13:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47764 states, 47742 states have (on average 3.065581668132881) internal successors, (146357), 47763 states have internal predecessors, (146357), 0 states have call successors, (0), 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-11-23 15:13:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47764 states to 47764 states and 146357 transitions. [2022-11-23 15:13:44,768 INFO L78 Accepts]: Start accepts. Automaton has 47764 states and 146357 transitions. Word has length 32 [2022-11-23 15:13:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:13:44,768 INFO L495 AbstractCegarLoop]: Abstraction has 47764 states and 146357 transitions. [2022-11-23 15:13:44,768 INFO L496 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-11-23 15:13:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47764 states and 146357 transitions. [2022-11-23 15:13:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 15:13:44,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:13:44,777 INFO L195 NwaCegarLoop]: 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-11-23 15:13:44,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-23 15:13:44,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:44,977 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:13:44,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:13:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash 826937013, now seen corresponding path program 1 times [2022-11-23 15:13:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:13:44,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875248917] [2022-11-23 15:13:44,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:44,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:13:44,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:13:44,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667074627] [2022-11-23 15:13:44,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:44,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:44,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:13:44,999 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:13:45,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-23 15:13:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:13:45,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 15:13:45,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:13:45,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:13:45,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:45,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:45,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:45,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:45,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 15:13:45,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:13:45,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-23 15:13:45,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:45,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-23 15:13:45,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:45,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-23 15:13:45,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:13:45,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:13:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:13:45,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:13:45,952 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_thread2Thread1of1ForFork1_~j~0 4))) (and (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse0)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse0)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse0)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse0 1)) |c_thread2Thread1of1ForFork1_#t~nondet8|)))) is different from false [2022-11-23 15:13:46,150 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread2Thread1of1ForFork1_~j~0 4))) (let ((.cse2 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 2 .cse1)) (.cse3 (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| (store (store (select |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse2 |c_thread2Thread1of1ForFork1_#t~nondet8|) .cse3 |c_thread2Thread1of1ForFork1_#t~nondet8|)))) (and (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse1 1)) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse2) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) .cse3) |c_thread2Thread1of1ForFork1_#t~nondet8|)) (forall ((v_ArrVal_3253 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3253) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| .cse1)) |c_thread2Thread1of1ForFork1_#t~nondet8|)))))) is different from false [2022-11-23 15:13:46,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:46,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2022-11-23 15:13:46,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:46,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2022-11-23 15:13:46,404 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-23 15:13:46,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-11-23 15:13:46,579 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3244 (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_3244) c_~B~0.base) c_~B~0.offset)))) is different from false [2022-11-23 15:13:48,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:48,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-23 15:13:48,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:13:48,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2022-11-23 15:13:48,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-11-23 15:13:48,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-11-23 15:13:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:13:48,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:13:48,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875248917] [2022-11-23 15:13:48,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:13:48,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667074627] [2022-11-23 15:13:48,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667074627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:13:48,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1395188784] [2022-11-23 15:13:48,939 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:13:48,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:13:48,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2022-11-23 15:13:48,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145377511] [2022-11-23 15:13:48,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:13:48,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 15:13:48,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:13:48,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 15:13:48,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=402, Unknown=31, NotChecked=132, Total=650 [2022-11-23 15:13:48,941 INFO L87 Difference]: Start difference. First operand 47764 states and 146357 transitions. Second operand has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-23 15:13:54,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:13:54,706 INFO L93 Difference]: Finished difference Result 59648 states and 180611 transitions. [2022-11-23 15:13:54,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 15:13:54,707 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-23 15:13:54,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:13:54,862 INFO L225 Difference]: With dead ends: 59648 [2022-11-23 15:13:54,862 INFO L226 Difference]: Without dead ends: 59648 [2022-11-23 15:13:54,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=219, Invalid=877, Unknown=38, NotChecked=198, Total=1332 [2022-11-23 15:13:54,863 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 585 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 886 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:13:54,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 304 Invalid, 2999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2077 Invalid, 0 Unknown, 886 Unchecked, 4.7s Time] [2022-11-23 15:13:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59648 states. [2022-11-23 15:13:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59648 to 51035. [2022-11-23 15:13:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51035 states, 51013 states have (on average 3.0681394938545075) internal successors, (156515), 51034 states have internal predecessors, (156515), 0 states have call successors, (0), 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-11-23 15:13:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51035 states to 51035 states and 156515 transitions. [2022-11-23 15:13:56,215 INFO L78 Accepts]: Start accepts. Automaton has 51035 states and 156515 transitions. Word has length 32 [2022-11-23 15:13:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:13:56,215 INFO L495 AbstractCegarLoop]: Abstraction has 51035 states and 156515 transitions. [2022-11-23 15:13:56,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-23 15:13:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 51035 states and 156515 transitions. [2022-11-23 15:13:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 15:13:56,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:13:56,225 INFO L195 NwaCegarLoop]: 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-11-23 15:13:56,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-23 15:13:56,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 15:13:56,425 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:13:56,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:13:56,426 INFO L85 PathProgramCache]: Analyzing trace with hash 49004664, now seen corresponding path program 2 times [2022-11-23 15:13:56,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:13:56,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804292032] [2022-11-23 15:13:56,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:13:56,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:13:56,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:13:56,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1903440941] [2022-11-23 15:13:56,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:13:56,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:13:56,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:13:56,446 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:13:56,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-23 15:13:56,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:13:56,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:13:56,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 15:13:56,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:13:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:13:57,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:13:57,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:13:57,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804292032] [2022-11-23 15:13:57,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:13:57,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903440941] [2022-11-23 15:13:57,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903440941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:13:57,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:13:57,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:13:57,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862782822] [2022-11-23 15:13:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:13:57,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:13:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:13:57,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:13:57,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:13:57,387 INFO L87 Difference]: Start difference. First operand 51035 states and 156515 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-11-23 15:13:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:13:58,617 INFO L93 Difference]: Finished difference Result 51184 states and 156824 transitions. [2022-11-23 15:13:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:13:58,617 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-11-23 15:13:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:13:58,767 INFO L225 Difference]: With dead ends: 51184 [2022-11-23 15:13:58,767 INFO L226 Difference]: Without dead ends: 51034 [2022-11-23 15:13:58,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:13:58,768 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:13:58,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 220 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 15:13:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51034 states. [2022-11-23 15:14:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51034 to 51034. [2022-11-23 15:14:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51034 states, 51012 states have (on average 3.0681408296087196) internal successors, (156512), 51033 states have internal predecessors, (156512), 0 states have call successors, (0), 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-11-23 15:14:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51034 states to 51034 states and 156512 transitions. [2022-11-23 15:14:00,474 INFO L78 Accepts]: Start accepts. Automaton has 51034 states and 156512 transitions. Word has length 32 [2022-11-23 15:14:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:14:00,474 INFO L495 AbstractCegarLoop]: Abstraction has 51034 states and 156512 transitions. [2022-11-23 15:14:00,474 INFO L496 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-11-23 15:14:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 51034 states and 156512 transitions. [2022-11-23 15:14:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-23 15:14:00,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:14:00,488 INFO L195 NwaCegarLoop]: 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-11-23 15:14:00,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-23 15:14:00,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:14:00,689 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:14:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:14:00,690 INFO L85 PathProgramCache]: Analyzing trace with hash -537347640, now seen corresponding path program 1 times [2022-11-23 15:14:00,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:14:00,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683841491] [2022-11-23 15:14:00,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:14:00,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:14:00,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:14:00,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934092045] [2022-11-23 15:14:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:14:00,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:14:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:14:00,710 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:14:00,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-23 15:14:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:14:01,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 15:14:01,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:14:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:14:01,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:14:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:14:01,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:14:01,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683841491] [2022-11-23 15:14:01,170 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:14:01,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934092045] [2022-11-23 15:14:01,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934092045] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 15:14:01,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:14:01,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-23 15:14:01,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938072234] [2022-11-23 15:14:01,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:14:01,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:14:01,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:14:01,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:14:01,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:14:01,172 INFO L87 Difference]: Start difference. First operand 51034 states and 156512 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-11-23 15:14:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:14:01,574 INFO L93 Difference]: Finished difference Result 50548 states and 155087 transitions. [2022-11-23 15:14:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:14:01,575 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-11-23 15:14:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:14:01,714 INFO L225 Difference]: With dead ends: 50548 [2022-11-23 15:14:01,714 INFO L226 Difference]: Without dead ends: 50548 [2022-11-23 15:14:01,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:14:01,714 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 135 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:14:01,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 82 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:14:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50548 states. [2022-11-23 15:14:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50548 to 50548. [2022-11-23 15:14:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50548 states, 50526 states have (on average 3.069449392392036) internal successors, (155087), 50547 states have internal predecessors, (155087), 0 states have call successors, (0), 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-11-23 15:14:03,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50548 states to 50548 states and 155087 transitions. [2022-11-23 15:14:03,229 INFO L78 Accepts]: Start accepts. Automaton has 50548 states and 155087 transitions. Word has length 33 [2022-11-23 15:14:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:14:03,229 INFO L495 AbstractCegarLoop]: Abstraction has 50548 states and 155087 transitions. [2022-11-23 15:14:03,229 INFO L496 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-11-23 15:14:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 50548 states and 155087 transitions. [2022-11-23 15:14:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:14:03,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:14:03,239 INFO L195 NwaCegarLoop]: 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-11-23 15:14:03,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-23 15:14:03,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-23 15:14:03,440 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:14:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:14:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1246251703, now seen corresponding path program 1 times [2022-11-23 15:14:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:14:03,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288737365] [2022-11-23 15:14:03,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:14:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:14:03,461 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:14:03,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1313401718] [2022-11-23 15:14:03,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:14:03,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:14:03,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:14:03,463 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:14:03,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-23 15:14:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:14:03,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 15:14:03,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:14:04,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:14:04,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:04,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:04,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:14:04,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:04,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:14:04,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:14:04,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 15:14:04,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:04,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:04,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:04,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:05,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:05,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:05,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:05,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:05,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:05,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:05,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:05,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:05,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:05,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:05,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:05,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:14:05,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:14:05,736 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3826 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3826 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3826 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3826 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-11-23 15:14:12,074 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-11-23 15:14:12,195 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))))) is different from false [2022-11-23 15:14:12,271 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1))))))) is different from false [2022-11-23 15:14:12,333 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1))))))) is different from false [2022-11-23 15:14:12,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (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|) .cse3 0) .cse4 0) .cse2 0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)) (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= 0 (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3821 (Array Int Int)) (v_ArrVal_3825 (Array Int Int)) (v_ArrVal_3826 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_3821) c_~F~0.base v_ArrVal_3825) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3826) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse0))))))) is different from false [2022-11-23 15:14:12,446 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:12,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2022-11-23 15:14:12,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:12,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 124 [2022-11-23 15:14:12,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2022-11-23 15:14:12,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-11-23 15:14:12,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2022-11-23 15:14:12,653 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:14:12,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:14:12,665 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:14:12,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:14:12,677 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:14:12,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:14:12,816 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (forall ((v_ArrVal_3809 (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_3809) c_~B~0.base) c_~B~0.offset))))) is different from false [2022-11-23 15:14:12,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:12,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-23 15:14:12,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:12,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-11-23 15:14:12,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-23 15:14:12,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-11-23 15:14:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:14:13,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:14:13,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288737365] [2022-11-23 15:14:13,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:14:13,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313401718] [2022-11-23 15:14:13,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313401718] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:14:13,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2118069296] [2022-11-23 15:14:13,333 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:14:13,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:14:13,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-23 15:14:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013113063] [2022-11-23 15:14:13,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:14:13,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 15:14:13,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:14:13,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 15:14:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=545, Unknown=18, NotChecked=378, Total=1056 [2022-11-23 15:14:13,335 INFO L87 Difference]: Start difference. First operand 50548 states and 155087 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-11-23 15:14:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:14:21,390 INFO L93 Difference]: Finished difference Result 59788 states and 178977 transitions. [2022-11-23 15:14:21,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 15:14:21,390 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-11-23 15:14:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:14:21,552 INFO L225 Difference]: With dead ends: 59788 [2022-11-23 15:14:21,552 INFO L226 Difference]: Without dead ends: 59787 [2022-11-23 15:14:21,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=416, Invalid=1314, Unknown=20, NotChecked=602, Total=2352 [2022-11-23 15:14:21,553 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 689 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1760 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:14:21,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 159 Invalid, 4309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2373 Invalid, 0 Unknown, 1760 Unchecked, 5.0s Time] [2022-11-23 15:14:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59787 states. [2022-11-23 15:14:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59787 to 50700. [2022-11-23 15:14:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50700 states, 50678 states have (on average 3.0701093176526304) internal successors, (155587), 50699 states have internal predecessors, (155587), 0 states have call successors, (0), 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-11-23 15:14:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50700 states to 50700 states and 155587 transitions. [2022-11-23 15:14:22,886 INFO L78 Accepts]: Start accepts. Automaton has 50700 states and 155587 transitions. Word has length 34 [2022-11-23 15:14:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:14:22,887 INFO L495 AbstractCegarLoop]: Abstraction has 50700 states and 155587 transitions. [2022-11-23 15:14:22,887 INFO L496 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-11-23 15:14:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 50700 states and 155587 transitions. [2022-11-23 15:14:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:14:22,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:14:22,897 INFO L195 NwaCegarLoop]: 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-11-23 15:14:22,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-23 15:14:23,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-23 15:14:23,098 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:14:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:14:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash 291811779, now seen corresponding path program 2 times [2022-11-23 15:14:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:14:23,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087514701] [2022-11-23 15:14:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:14:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:14:23,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:14:23,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1685433308] [2022-11-23 15:14:23,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:14:23,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:14:23,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:14:23,120 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:14:23,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-23 15:14:23,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 15:14:23,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:14:23,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 15:14:23,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:14:24,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:14:24,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:24,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:24,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:14:24,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:24,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:14:24,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 15:14:24,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:14:24,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:24,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:24,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:24,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:24,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:24,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:24,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:24,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:25,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:25,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:25,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:25,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:14:25,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:14:25,375 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-11-23 15:14:25,467 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)))) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-11-23 15:14:25,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-11-23 15:14:25,879 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse1 (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)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))))) is different from false [2022-11-23 15:14:25,944 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (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) .cse3 0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0))))))) is different from false [2022-11-23 15:14:26,009 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (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|) .cse2 0) .cse4 0) .cse3 0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= 0 (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2))))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (forall ((v_ArrVal_4053 (Array Int Int)) (v_ArrVal_4048 (Array Int Int)) (v_ArrVal_4052 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4048) c_~F~0.base v_ArrVal_4052) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4053) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0))))))) is different from false [2022-11-23 15:14:26,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:26,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2022-11-23 15:14:26,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:26,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 304 treesize of output 270 [2022-11-23 15:14:26,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 222 [2022-11-23 15:14:26,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 214 [2022-11-23 15:14:26,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 182 [2022-11-23 15:14:26,216 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:14:26,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:14:26,225 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:14:26,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2022-11-23 15:14:26,233 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:14:26,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:14:26,347 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (forall ((v_ArrVal_4036 (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_4036) c_~B~0.base) c_~B~0.offset))))) is different from false [2022-11-23 15:14:26,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:26,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-23 15:14:26,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:26,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-11-23 15:14:26,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-23 15:14:26,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-11-23 15:14:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:14:26,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:14:26,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087514701] [2022-11-23 15:14:26,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:14:26,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685433308] [2022-11-23 15:14:26,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685433308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:14:26,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [682437178] [2022-11-23 15:14:26,823 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:14:26,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:14:26,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-23 15:14:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759269131] [2022-11-23 15:14:26,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:14:26,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 15:14:26,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:14:26,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 15:14:26,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=553, Unknown=17, NotChecked=378, Total=1056 [2022-11-23 15:14:26,825 INFO L87 Difference]: Start difference. First operand 50700 states and 155587 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-11-23 15:14:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:14:36,523 INFO L93 Difference]: Finished difference Result 61023 states and 182821 transitions. [2022-11-23 15:14:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 15:14:36,523 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-11-23 15:14:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:14:36,677 INFO L225 Difference]: With dead ends: 61023 [2022-11-23 15:14:36,677 INFO L226 Difference]: Without dead ends: 61022 [2022-11-23 15:14:36,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=404, Invalid=1410, Unknown=20, NotChecked=616, Total=2450 [2022-11-23 15:14:36,678 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 657 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 3565 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 5195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 3565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1404 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:14:36,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 239 Invalid, 5195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 3565 Invalid, 0 Unknown, 1404 Unchecked, 7.2s Time] [2022-11-23 15:14:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61022 states. [2022-11-23 15:14:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61022 to 50700. [2022-11-23 15:14:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50700 states, 50678 states have (on average 3.0701093176526304) internal successors, (155587), 50699 states have internal predecessors, (155587), 0 states have call successors, (0), 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-11-23 15:14:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50700 states to 50700 states and 155587 transitions. [2022-11-23 15:14:37,968 INFO L78 Accepts]: Start accepts. Automaton has 50700 states and 155587 transitions. Word has length 34 [2022-11-23 15:14:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:14:37,968 INFO L495 AbstractCegarLoop]: Abstraction has 50700 states and 155587 transitions. [2022-11-23 15:14:37,968 INFO L496 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-11-23 15:14:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50700 states and 155587 transitions. [2022-11-23 15:14:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:14:37,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:14:37,977 INFO L195 NwaCegarLoop]: 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-11-23 15:14:37,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-23 15:14:38,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-23 15:14:38,178 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:14:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:14:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 525676119, now seen corresponding path program 3 times [2022-11-23 15:14:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:14:38,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619984187] [2022-11-23 15:14:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:14:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:14:38,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:14:38,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206160973] [2022-11-23 15:14:38,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 15:14:38,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:14:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:14:38,200 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:14:38,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-23 15:14:39,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 15:14:39,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:14:39,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-23 15:14:39,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:14:39,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:39,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:39,283 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:14:39,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 16 [2022-11-23 15:14:39,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:39,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:39,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:39,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:39,383 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 15:14:39,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 22 treesize of output 30 [2022-11-23 15:14:39,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:39,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:39,542 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-23 15:14:39,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-11-23 15:14:39,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:14:39,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 15:14:39,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-23 15:14:40,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:14:40,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 15:14:40,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 15:14:40,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:14:40,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:14:40,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-23 15:14:40,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-23 15:14:40,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-23 15:14:40,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-23 15:14:40,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:40,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:40,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:40,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:40,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:41,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:14:41,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:14:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:14:41,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:14:41,227 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4286 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4286 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4286 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4286 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-11-23 15:14:51,793 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-11-23 15:14:51,819 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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) .cse1 0)))) (and (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2))) (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-11-23 15:14:51,876 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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) .cse3 0))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse2))))))) is different from false [2022-11-23 15:14:51,933 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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|) .cse2 0) .cse4 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_173| Int)) (or (forall ((v_ArrVal_4285 (Array Int Int)) (v_ArrVal_4286 (Array Int Int)) (v_ArrVal_4281 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4281) c_~F~0.base v_ArrVal_4285) |v_thread2Thread1of1ForFork1_#t~mem6.base_173| v_ArrVal_4286) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_173| .cse1))))))) is different from false [2022-11-23 15:14:51,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:51,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2022-11-23 15:14:51,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:51,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1132 treesize of output 1062 [2022-11-23 15:14:52,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 982 treesize of output 950 [2022-11-23 15:14:52,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 950 treesize of output 886 [2022-11-23 15:14:52,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 886 treesize of output 758 [2022-11-23 15:14:53,362 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:14:53,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:14:53,372 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:14:53,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2022-11-23 15:14:53,382 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:14:53,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:14:53,525 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (forall ((v_ArrVal_4269 (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_4269) c_~B~0.base) c_~B~0.offset)))) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-23 15:14:53,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:53,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-23 15:14:53,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:14:53,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-11-23 15:14:53,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-23 15:14:53,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-11-23 15:14:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:14:54,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:14:54,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619984187] [2022-11-23 15:14:54,227 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:14:54,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206160973] [2022-11-23 15:14:54,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206160973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:14:54,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1579492743] [2022-11-23 15:14:54,228 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:14:54,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:14:54,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-23 15:14:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998901618] [2022-11-23 15:14:54,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:14:54,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 15:14:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:14:54,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 15:14:54,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=597, Unknown=27, NotChecked=330, Total=1056 [2022-11-23 15:14:54,231 INFO L87 Difference]: Start difference. First operand 50700 states and 155587 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-11-23 15:15:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:15:05,386 INFO L93 Difference]: Finished difference Result 61947 states and 185582 transitions. [2022-11-23 15:15:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 15:15:05,387 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-11-23 15:15:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:15:05,541 INFO L225 Difference]: With dead ends: 61947 [2022-11-23 15:15:05,541 INFO L226 Difference]: Without dead ends: 61946 [2022-11-23 15:15:05,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=436, Invalid=1629, Unknown=29, NotChecked=558, Total=2652 [2022-11-23 15:15:05,542 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 862 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 3576 mSolverCounterSat, 325 mSolverCounterUnsat, 110 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 6688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 3576 IncrementalHoareTripleChecker+Invalid, 110 IncrementalHoareTripleChecker+Unknown, 2677 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-23 15:15:05,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 242 Invalid, 6688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 3576 Invalid, 110 Unknown, 2677 Unchecked, 7.8s Time] [2022-11-23 15:15:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61946 states. [2022-11-23 15:15:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61946 to 51024. [2022-11-23 15:15:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51024 states, 51002 states have (on average 3.070683502607741) internal successors, (156611), 51023 states have internal predecessors, (156611), 0 states have call successors, (0), 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-11-23 15:15:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51024 states to 51024 states and 156611 transitions. [2022-11-23 15:15:06,874 INFO L78 Accepts]: Start accepts. Automaton has 51024 states and 156611 transitions. Word has length 34 [2022-11-23 15:15:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:15:06,874 INFO L495 AbstractCegarLoop]: Abstraction has 51024 states and 156611 transitions. [2022-11-23 15:15:06,874 INFO L496 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-11-23 15:15:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 51024 states and 156611 transitions. [2022-11-23 15:15:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:15:06,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:06,884 INFO L195 NwaCegarLoop]: 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-11-23 15:15:06,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-23 15:15:07,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-23 15:15:07,085 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:15:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:07,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1977522497, now seen corresponding path program 4 times [2022-11-23 15:15:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:07,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907311044] [2022-11-23 15:15:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:07,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:15:07,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217314528] [2022-11-23 15:15:07,106 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 15:15:07,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:07,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:15:07,107 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:15:07,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-23 15:15:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:15:07,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-23 15:15:07,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:15:07,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:15:07,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:07,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:07,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:07,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:07,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:15:08,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 15:15:08,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:15:08,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:15:08,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:08,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:15:08,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:15:08,846 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4513 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (forall ((v_ArrVal_4513 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4513 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4513 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-11-23 15:15:08,891 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-11-23 15:15:13,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-11-23 15:15:13,498 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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) .cse1 0)))) (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0))))) is different from false [2022-11-23 15:15:13,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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|) .cse3 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3)))))) is different from false [2022-11-23 15:15:13,549 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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|) .cse2 0) .cse3 0) .cse4 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) .cse1 v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) .cse1 v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) .cse1 v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3))) (forall ((v_ArrVal_4512 (Array Int Int)) (v_ArrVal_4513 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4508) c_~F~0.base v_ArrVal_4512) .cse1 v_ArrVal_4513) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0))))) is different from false [2022-11-23 15:15:13,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:15:13,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 65 [2022-11-23 15:15:13,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:15:13,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 202 [2022-11-23 15:15:13,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 154 [2022-11-23 15:15:13,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2022-11-23 15:15:13,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 142 [2022-11-23 15:15:13,943 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:15:13,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 1 [2022-11-23 15:15:13,951 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:15:13,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 1 [2022-11-23 15:15:13,960 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:15:13,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 1 [2022-11-23 15:15:14,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:15:14,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-23 15:15:14,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:15:14,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:15:14,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-23 15:15:14,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-23 15:15:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:15:14,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:15:14,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907311044] [2022-11-23 15:15:14,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:15:14,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217314528] [2022-11-23 15:15:14,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217314528] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:15:14,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1154706055] [2022-11-23 15:15:14,533 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:15:14,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:15:14,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-23 15:15:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519248892] [2022-11-23 15:15:14,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:15:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 15:15:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:15:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 15:15:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=596, Unknown=28, NotChecked=330, Total=1056 [2022-11-23 15:15:14,536 INFO L87 Difference]: Start difference. First operand 51024 states and 156611 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-11-23 15:15:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:15:23,788 INFO L93 Difference]: Finished difference Result 61352 states and 183797 transitions. [2022-11-23 15:15:23,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 15:15:23,789 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-11-23 15:15:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:15:23,937 INFO L225 Difference]: With dead ends: 61352 [2022-11-23 15:15:23,937 INFO L226 Difference]: Without dead ends: 61351 [2022-11-23 15:15:23,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=466, Invalid=1676, Unknown=44, NotChecked=570, Total=2756 [2022-11-23 15:15:23,938 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 942 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 3385 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 5473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 3385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1785 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:15:23,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 217 Invalid, 5473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 3385 Invalid, 0 Unknown, 1785 Unchecked, 6.4s Time] [2022-11-23 15:15:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61351 states. [2022-11-23 15:15:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61351 to 51024. [2022-11-23 15:15:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51024 states, 51002 states have (on average 3.070683502607741) internal successors, (156611), 51023 states have internal predecessors, (156611), 0 states have call successors, (0), 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-11-23 15:15:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51024 states to 51024 states and 156611 transitions. [2022-11-23 15:15:25,238 INFO L78 Accepts]: Start accepts. Automaton has 51024 states and 156611 transitions. Word has length 34 [2022-11-23 15:15:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:15:25,238 INFO L495 AbstractCegarLoop]: Abstraction has 51024 states and 156611 transitions. [2022-11-23 15:15:25,238 INFO L496 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-11-23 15:15:25,238 INFO L276 IsEmpty]: Start isEmpty. Operand 51024 states and 156611 transitions. [2022-11-23 15:15:25,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:15:25,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:25,248 INFO L195 NwaCegarLoop]: 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-11-23 15:15:25,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-23 15:15:25,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 15:15:25,448 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:15:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1217333769, now seen corresponding path program 5 times [2022-11-23 15:15:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:25,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710160855] [2022-11-23 15:15:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:25,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:25,469 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:15:25,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035763139] [2022-11-23 15:15:25,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:15:25,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:25,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:15:25,470 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:15:25,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-23 15:15:26,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 15:15:26,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:15:26,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 15:15:26,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:15:26,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:15:26,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:26,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:26,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:26,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:26,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:15:26,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:26,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:26,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:26,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:26,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:15:27,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:15:27,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 15:15:27,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:27,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:27,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:27,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:27,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:27,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:27,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:27,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:27,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:15:27,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:15:27,842 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4740 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4740 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4740 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4740 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-23 15:15:27,886 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4739) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4739) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4739) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4739) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-11-23 15:15:32,298 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))))) is different from false [2022-11-23 15:15:32,707 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))))) is different from false [2022-11-23 15:15:32,789 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset)) (.cse0 (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)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse1)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse1)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0))))))) is different from false [2022-11-23 15:15:33,244 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (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|) .cse2 0) .cse3 0) .cse4 0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)) (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4740 (Array Int Int)) (v_ArrVal_4735 (Array Int Int)) (v_ArrVal_4739 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4735) c_~F~0.base v_ArrVal_4739) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4740) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0))))))) is different from false [2022-11-23 15:15:33,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:15:33,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2022-11-23 15:15:33,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:15:33,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 138 [2022-11-23 15:15:33,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 98 [2022-11-23 15:15:33,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2022-11-23 15:15:33,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-11-23 15:15:33,371 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:15:33,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2022-11-23 15:15:33,379 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:15:33,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:15:33,387 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:15:33,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:15:33,468 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (forall ((v_ArrVal_4723 (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_4723) c_~B~0.base) c_~B~0.offset))))) is different from false [2022-11-23 15:15:33,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:15:33,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-23 15:15:33,583 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:15:33,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-11-23 15:15:33,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118 [2022-11-23 15:15:33,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-11-23 15:15:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:15:33,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:15:33,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710160855] [2022-11-23 15:15:33,934 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:15:33,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035763139] [2022-11-23 15:15:33,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035763139] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:15:33,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1398656820] [2022-11-23 15:15:33,935 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:15:33,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:15:33,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-23 15:15:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743115740] [2022-11-23 15:15:33,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:15:33,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 15:15:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:15:33,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 15:15:33,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=532, Unknown=31, NotChecked=378, Total=1056 [2022-11-23 15:15:33,938 INFO L87 Difference]: Start difference. First operand 51024 states and 156611 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-11-23 15:15:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:15:48,670 INFO L93 Difference]: Finished difference Result 58951 states and 176466 transitions. [2022-11-23 15:15:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 15:15:48,671 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-11-23 15:15:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:15:48,821 INFO L225 Difference]: With dead ends: 58951 [2022-11-23 15:15:48,821 INFO L226 Difference]: Without dead ends: 58950 [2022-11-23 15:15:48,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=368, Invalid=1189, Unknown=31, NotChecked=574, Total=2162 [2022-11-23 15:15:48,822 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 605 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 5016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1950 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:15:48,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 229 Invalid, 5016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2885 Invalid, 0 Unknown, 1950 Unchecked, 6.6s Time] [2022-11-23 15:15:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58950 states. [2022-11-23 15:15:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58950 to 51043. [2022-11-23 15:15:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51043 states, 51021 states have (on average 3.07067678014935) internal successors, (156669), 51042 states have internal predecessors, (156669), 0 states have call successors, (0), 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-11-23 15:15:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51043 states to 51043 states and 156669 transitions. [2022-11-23 15:15:50,155 INFO L78 Accepts]: Start accepts. Automaton has 51043 states and 156669 transitions. Word has length 34 [2022-11-23 15:15:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:15:50,155 INFO L495 AbstractCegarLoop]: Abstraction has 51043 states and 156669 transitions. [2022-11-23 15:15:50,155 INFO L496 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-11-23 15:15:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 51043 states and 156669 transitions. [2022-11-23 15:15:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:15:50,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:15:50,167 INFO L195 NwaCegarLoop]: 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-11-23 15:15:50,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-23 15:15:50,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:50,375 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:15:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:15:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash -45121111, now seen corresponding path program 6 times [2022-11-23 15:15:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:15:50,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852907771] [2022-11-23 15:15:50,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:15:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:15:50,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:15:50,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126072655] [2022-11-23 15:15:50,400 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 15:15:50,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:15:50,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:15:50,401 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:15:50,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-23 15:15:51,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 15:15:51,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:15:51,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 15:15:51,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:15:51,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:15:51,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:51,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:51,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:51,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:51,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:15:51,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:51,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:51,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:51,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:51,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:15:52,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:15:52,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 15:15:52,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:52,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:52,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:52,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:52,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:52,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:52,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:52,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:52,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:15:52,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:15:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:15:52,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:15:52,797 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4967 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4967 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4967 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4967 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-23 15:16:03,267 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-23 15:16:03,375 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse0)))))) is different from false [2022-11-23 15:16:03,765 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)) (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)) (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))))))) is different from false [2022-11-23 15:16:03,827 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1))))))) is different from false [2022-11-23 15:16:03,884 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1))))))) is different from false [2022-11-23 15:16:03,934 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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|) .cse4 0) .cse3 0) .cse1 0))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= 0 (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1))) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4962 (Array Int Int)) (v_ArrVal_4966 (Array Int Int)) (v_ArrVal_4967 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4962) c_~F~0.base v_ArrVal_4966) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4967) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2))))))) is different from false [2022-11-23 15:16:03,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:16:03,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2022-11-23 15:16:03,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:16:03,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 304 treesize of output 270 [2022-11-23 15:16:03,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 222 [2022-11-23 15:16:03,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 190 [2022-11-23 15:16:04,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 91 [2022-11-23 15:16:04,138 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:16:04,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2022-11-23 15:16:04,147 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:16:04,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:16:04,156 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:16:04,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:16:04,224 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (forall ((v_ArrVal_4950 (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_4950) c_~B~0.base) c_~B~0.offset))))) is different from false [2022-11-23 15:16:04,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:16:04,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-23 15:16:04,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:16:04,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2022-11-23 15:16:04,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-11-23 15:16:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:16:04,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:16:04,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852907771] [2022-11-23 15:16:04,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:16:04,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126072655] [2022-11-23 15:16:04,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126072655] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:16:04,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247952088] [2022-11-23 15:16:04,687 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:16:04,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:16:04,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-23 15:16:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628633705] [2022-11-23 15:16:04,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:16:04,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 15:16:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:16:04,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 15:16:04,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=491, Unknown=31, NotChecked=424, Total=1056 [2022-11-23 15:16:04,689 INFO L87 Difference]: Start difference. First operand 51043 states and 156669 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-11-23 15:16:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:16:18,740 INFO L93 Difference]: Finished difference Result 60059 states and 179508 transitions. [2022-11-23 15:16:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 15:16:18,741 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-11-23 15:16:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:16:18,891 INFO L225 Difference]: With dead ends: 60059 [2022-11-23 15:16:18,891 INFO L226 Difference]: Without dead ends: 60058 [2022-11-23 15:16:18,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=354, Invalid=1117, Unknown=43, NotChecked=648, Total=2162 [2022-11-23 15:16:18,892 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 447 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 5545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2425 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:16:18,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 225 Invalid, 5545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2893 Invalid, 0 Unknown, 2425 Unchecked, 5.5s Time] [2022-11-23 15:16:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60058 states. [2022-11-23 15:16:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60058 to 51081. [2022-11-23 15:16:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51081 states, 51059 states have (on average 3.0708396169137666) internal successors, (156794), 51080 states have internal predecessors, (156794), 0 states have call successors, (0), 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-11-23 15:16:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51081 states to 51081 states and 156794 transitions. [2022-11-23 15:16:20,185 INFO L78 Accepts]: Start accepts. Automaton has 51081 states and 156794 transitions. Word has length 34 [2022-11-23 15:16:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:16:20,185 INFO L495 AbstractCegarLoop]: Abstraction has 51081 states and 156794 transitions. [2022-11-23 15:16:20,185 INFO L496 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-11-23 15:16:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 51081 states and 156794 transitions. [2022-11-23 15:16:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:16:20,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:16:20,198 INFO L195 NwaCegarLoop]: 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-11-23 15:16:20,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-23 15:16:20,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-23 15:16:20,407 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:16:20,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:16:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2143002393, now seen corresponding path program 7 times [2022-11-23 15:16:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:16:20,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714674465] [2022-11-23 15:16:20,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:16:20,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:16:20,429 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:16:20,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245630804] [2022-11-23 15:16:20,429 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 15:16:20,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:16:20,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:16:20,430 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:16:20,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-23 15:16:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:16:20,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-23 15:16:20,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:16:21,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:16:21,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:21,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:21,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:16:21,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:21,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:16:21,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-23 15:16:21,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:16:21,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:21,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:21,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:21,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:21,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:21,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:21,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:22,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:22,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:22,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:22,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:22,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:22,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:16:22,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:16:29,558 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-11-23 15:16:29,912 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-11-23 15:16:29,936 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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|) .cse2 0) .cse4 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5189 (Array Int Int)) (v_ArrVal_5194 (Array Int Int)) (v_ArrVal_5193 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5189) c_~F~0.base v_ArrVal_5193) .cse1 v_ArrVal_5194) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0))))) is different from false [2022-11-23 15:16:29,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:16:29,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 61 [2022-11-23 15:16:29,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:16:29,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 660 treesize of output 614 [2022-11-23 15:16:29,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 550 [2022-11-23 15:16:29,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 550 treesize of output 486 [2022-11-23 15:16:29,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 486 treesize of output 454 [2022-11-23 15:16:30,699 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:16:30,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 1 [2022-11-23 15:16:30,706 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:16:30,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 1 [2022-11-23 15:16:30,713 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:16:30,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 1 [2022-11-23 15:16:30,805 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (forall ((v_ArrVal_5177 (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_5177) c_~B~0.base) c_~B~0.offset))))) is different from false [2022-11-23 15:16:30,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:16:30,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-23 15:16:30,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:16:30,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:16:30,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-23 15:16:30,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-23 15:16:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:16:31,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:16:31,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714674465] [2022-11-23 15:16:31,350 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:16:31,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245630804] [2022-11-23 15:16:31,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245630804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:16:31,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316258344] [2022-11-23 15:16:31,351 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:16:31,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:16:31,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-23 15:16:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071448794] [2022-11-23 15:16:31,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:16:31,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 15:16:31,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:16:31,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 15:16:31,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=647, Unknown=70, NotChecked=228, Total=1056 [2022-11-23 15:16:31,354 INFO L87 Difference]: Start difference. First operand 51081 states and 156794 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-11-23 15:16:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:16:42,993 INFO L93 Difference]: Finished difference Result 60249 states and 180400 transitions. [2022-11-23 15:16:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 15:16:42,994 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-11-23 15:16:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:16:43,137 INFO L225 Difference]: With dead ends: 60249 [2022-11-23 15:16:43,137 INFO L226 Difference]: Without dead ends: 60248 [2022-11-23 15:16:43,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=445, Invalid=1642, Unknown=91, NotChecked=372, Total=2550 [2022-11-23 15:16:43,138 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1033 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 4789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 733 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-23 15:16:43,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 268 Invalid, 4789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 3677 Invalid, 0 Unknown, 733 Unchecked, 8.8s Time] [2022-11-23 15:16:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60248 states. [2022-11-23 15:16:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60248 to 51043. [2022-11-23 15:16:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51043 states, 51021 states have (on average 3.07067678014935) internal successors, (156669), 51042 states have internal predecessors, (156669), 0 states have call successors, (0), 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-11-23 15:16:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51043 states to 51043 states and 156669 transitions. [2022-11-23 15:16:44,491 INFO L78 Accepts]: Start accepts. Automaton has 51043 states and 156669 transitions. Word has length 34 [2022-11-23 15:16:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:16:44,491 INFO L495 AbstractCegarLoop]: Abstraction has 51043 states and 156669 transitions. [2022-11-23 15:16:44,491 INFO L496 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-11-23 15:16:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 51043 states and 156669 transitions. [2022-11-23 15:16:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:16:44,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:16:44,505 INFO L195 NwaCegarLoop]: 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-11-23 15:16:44,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-23 15:16:44,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:16:44,712 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:16:44,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:16:44,713 INFO L85 PathProgramCache]: Analyzing trace with hash 80373335, now seen corresponding path program 8 times [2022-11-23 15:16:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:16:44,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218408789] [2022-11-23 15:16:44,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:16:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:16:44,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:16:44,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029014231] [2022-11-23 15:16:44,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:16:44,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:16:44,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:16:44,736 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:16:44,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-23 15:16:45,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 15:16:45,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:16:45,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-23 15:16:45,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:16:45,722 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-23 15:16:45,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2022-11-23 15:16:45,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:45,786 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 15:16:45,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2022-11-23 15:16:45,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:45,869 INFO L321 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2022-11-23 15:16:45,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 25 [2022-11-23 15:16:46,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:16:46,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-11-23 15:16:46,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-11-23 15:16:46,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:16:46,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:46,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 15:16:46,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:46,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:46,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:16:46,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:46,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:46,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:46,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:16:47,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-11-23 15:16:47,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:47,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:47,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:47,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:47,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:47,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:47,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:47,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:47,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:47,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:47,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:47,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:47,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:16:47,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:16:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:16:47,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:16:48,024 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5427 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5427 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_5427 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|))) (forall ((v_ArrVal_5427 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-11-23 15:17:07,824 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (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))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0))))))) is different from false [2022-11-23 15:17:07,889 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))))) is different from false [2022-11-23 15:17:07,955 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0))))))) is different from false [2022-11-23 15:17:08,020 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset)) (.cse1 (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|) .cse3 0) .cse2 0) .cse4 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_183| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_183| .cse0)) (forall ((v_ArrVal_5422 (Array Int Int)) (v_ArrVal_5426 (Array Int Int)) (v_ArrVal_5427 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_5422) c_~F~0.base v_ArrVal_5426) |v_thread2Thread1of1ForFork1_#t~mem6.base_183| v_ArrVal_5427) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0))))))) is different from false [2022-11-23 15:17:08,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:08,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2022-11-23 15:17:08,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:08,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 272 treesize of output 242 [2022-11-23 15:17:08,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2022-11-23 15:17:08,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 186 [2022-11-23 15:17:08,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 182 [2022-11-23 15:17:08,180 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:17:08,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:17:08,188 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:17:08,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:17:08,196 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-23 15:17:08,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-11-23 15:17:08,271 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (forall ((v_ArrVal_5410 (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_5410) c_~B~0.base) c_~B~0.offset)))) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-11-23 15:17:08,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:08,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-23 15:17:08,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:08,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-11-23 15:17:08,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118 [2022-11-23 15:17:08,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-11-23 15:17:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:17:08,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:17:08,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218408789] [2022-11-23 15:17:08,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:17:08,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029014231] [2022-11-23 15:17:08,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029014231] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:17:08,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1141629827] [2022-11-23 15:17:08,958 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:17:08,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:17:08,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-11-23 15:17:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241864969] [2022-11-23 15:17:08,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:17:08,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 15:17:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:17:08,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 15:17:08,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=564, Unknown=52, NotChecked=330, Total=1056 [2022-11-23 15:17:08,959 INFO L87 Difference]: Start difference. First operand 51043 states and 156669 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-11-23 15:17:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:17:31,640 INFO L93 Difference]: Finished difference Result 59350 states and 177412 transitions. [2022-11-23 15:17:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 15:17:31,642 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-11-23 15:17:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:17:31,784 INFO L225 Difference]: With dead ends: 59350 [2022-11-23 15:17:31,784 INFO L226 Difference]: Without dead ends: 59349 [2022-11-23 15:17:31,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=345, Invalid=1251, Unknown=68, NotChecked=498, Total=2162 [2022-11-23 15:17:31,785 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 490 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 187 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 5182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 1126 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:17:31,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 267 Invalid, 5182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 3806 Invalid, 63 Unknown, 1126 Unchecked, 9.0s Time] [2022-11-23 15:17:31,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59349 states. [2022-11-23 15:17:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59349 to 51119. [2022-11-23 15:17:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51119 states, 51097 states have (on average 3.071002211480126) internal successors, (156919), 51118 states have internal predecessors, (156919), 0 states have call successors, (0), 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-11-23 15:17:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51119 states to 51119 states and 156919 transitions. [2022-11-23 15:17:33,227 INFO L78 Accepts]: Start accepts. Automaton has 51119 states and 156919 transitions. Word has length 34 [2022-11-23 15:17:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:17:33,228 INFO L495 AbstractCegarLoop]: Abstraction has 51119 states and 156919 transitions. [2022-11-23 15:17:33,228 INFO L496 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-11-23 15:17:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 51119 states and 156919 transitions. [2022-11-23 15:17:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 15:17:33,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:17:33,238 INFO L195 NwaCegarLoop]: 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-11-23 15:17:33,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-23 15:17:33,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:17:33,439 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-23 15:17:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:17:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2017507947, now seen corresponding path program 9 times [2022-11-23 15:17:33,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:17:33,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741213538] [2022-11-23 15:17:33,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:17:33,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:17:33,459 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 15:17:33,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093649276] [2022-11-23 15:17:33,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 15:17:33,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:17:33,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:17:33,461 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:17:33,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3266fb8-dac5-4d04-bae8-d47699e25ac5/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-23 15:17:36,555 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 15:17:36,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:17:36,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-23 15:17:36,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:17:36,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-23 15:17:36,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:36,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:36,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:36,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:36,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 15:17:37,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 15:17:37,242 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:37,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 15:17:37,464 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-23 15:17:37,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-23 15:17:37,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:37,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 15:17:37,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:37,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:37,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:37,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:37,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:37,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:37,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:37,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:37,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:37,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:37,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:37,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:37,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:37,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:37,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:37,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:38,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:17:38,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-11-23 15:17:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:17:38,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:17:38,110 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5654 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_5654 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_5654 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5654 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-11-23 15:17:51,831 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_thread2Thread1of1ForFork1_~i~1 c_~N~0)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (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) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) .cse1 v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) .cse1 v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) .cse1 v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_5653 (Array Int Int)) (v_ArrVal_5654 (Array Int Int)) (v_ArrVal_5649 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_5649) c_~F~0.base v_ArrVal_5653) .cse1 v_ArrVal_5654) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))))) is different from false [2022-11-23 15:17:52,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:52,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 63 [2022-11-23 15:17:52,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:52,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2412 treesize of output 2326 [2022-11-23 15:17:52,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1091 treesize of output 1059 [2022-11-23 15:17:52,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2150 treesize of output 2086 [2022-11-23 15:17:52,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2086 treesize of output 1958 [2022-11-23 15:17:55,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:55,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 50 [2022-11-23 15:17:55,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:17:55,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 100 [2022-11-23 15:17:55,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2022-11-23 15:17:55,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2022-11-23 15:17:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:17:56,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:17:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741213538] [2022-11-23 15:17:56,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 15:17:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093649276] [2022-11-23 15:17:56,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093649276] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:17:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [467460858] [2022-11-23 15:17:56,241 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:1621) 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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-11-23 15:17:56,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 15:17:56,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2022-11-23 15:17:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274969898] [2022-11-23 15:17:56,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 15:17:56,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 15:17:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:17:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 15:17:56,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=72, NotChecked=126, Total=1190 [2022-11-23 15:17:56,244 INFO L87 Difference]: Start difference. First operand 51119 states and 156919 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)