./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI --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 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 --- 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-5e519f3 [2022-11-03 03:37:00,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:37:00,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:37:00,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:37:00,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:37:00,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:37:00,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:37:00,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:37:00,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:37:00,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:37:00,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:37:00,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:37:00,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:37:00,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:37:00,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:37:00,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:37:00,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:37:00,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:37:00,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:37:00,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:37:00,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:37:00,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:37:00,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:37:00,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:37:00,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:37:00,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:37:00,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:37:00,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:37:00,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:37:00,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:37:00,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:37:00,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:37:00,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:37:00,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:37:00,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:37:00,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:37:00,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:37:00,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:37:00,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:37:00,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:37:00,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:37:00,936 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-03 03:37:00,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:37:00,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:37:00,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:37:00,982 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:37:00,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:37:00,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:37:00,984 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:37:00,984 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:37:00,984 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:37:00,984 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:37:00,986 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:37:00,986 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:37:00,986 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:37:00,986 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:37:00,987 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:37:00,987 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:37:00,987 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:37:00,988 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:37:00,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:37:00,989 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:37:00,989 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:37:00,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:37:00,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:37:00,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:37:00,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:37:00,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:37:00,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:37:00,991 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-03 03:37:00,991 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:37:00,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:37:00,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:37:00,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:37:00,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:37:00,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:37:00,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:37:00,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:37:00,994 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:37:00,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:37:00,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:37:00,995 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:37:00,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:37:00,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:37:00,996 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:37:00,996 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_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/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_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI 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 -> 8259c4061eb15e4ed63bc06f98acbb6dc3f9862bbe262b5cabdd3ad4658d3239 [2022-11-03 03:37:01,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:37:01,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:37:01,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:37:01,364 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:37:01,366 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:37:01,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-11-03 03:37:01,454 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/data/4364d4100/ef84b3a64fb54f70b587b54de9f3d3dd/FLAG708a2e775 [2022-11-03 03:37:02,193 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:37:02,194 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-11-03 03:37:02,214 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/data/4364d4100/ef84b3a64fb54f70b587b54de9f3d3dd/FLAG708a2e775 [2022-11-03 03:37:02,426 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/data/4364d4100/ef84b3a64fb54f70b587b54de9f3d3dd [2022-11-03 03:37:02,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:37:02,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:37:02,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:37:02,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:37:02,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:37:02,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:37:02" (1/1) ... [2022-11-03 03:37:02,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693252cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:02, skipping insertion in model container [2022-11-03 03:37:02,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:37:02" (1/1) ... [2022-11-03 03:37:02,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:37:02,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:37:03,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:37:03,287 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:37:03,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:37:03,436 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:37:03,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03 WrapperNode [2022-11-03 03:37:03,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:37:03,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:37:03,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:37:03,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:37:03,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,535 INFO L138 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-11-03 03:37:03,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:37:03,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:37:03,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:37:03,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:37:03,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,608 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:37:03,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:37:03,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:37:03,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:37:03,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (1/1) ... [2022-11-03 03:37:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:37:03,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:03,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:37:03,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:37:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:37:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:37:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:37:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:37:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 03:37:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:37:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-03 03:37:03,728 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-03 03:37:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:37:03,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:37:03,730 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:37:03,877 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:37:03,880 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:37:04,318 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:37:04,337 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:37:04,338 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 03:37:04,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:37:04 BoogieIcfgContainer [2022-11-03 03:37:04,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:37:04,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:37:04,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:37:04,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:37:04,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:37:02" (1/3) ... [2022-11-03 03:37:04,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e1e1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:37:04, skipping insertion in model container [2022-11-03 03:37:04,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:37:03" (2/3) ... [2022-11-03 03:37:04,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e1e1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:37:04, skipping insertion in model container [2022-11-03 03:37:04,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:37:04" (3/3) ... [2022-11-03 03:37:04,366 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-11-03 03:37:04,376 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:37:04,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:37:04,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-03 03:37:04,388 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:37:04,490 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 03:37:04,560 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:37:04,579 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 125 transitions, 255 flow [2022-11-03 03:37:04,591 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 125 transitions, 255 flow [2022-11-03 03:37:04,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 125 transitions, 255 flow [2022-11-03 03:37:04,747 INFO L130 PetriNetUnfolder]: 6/124 cut-off events. [2022-11-03 03:37:04,748 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 03:37:04,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 124 events. 6/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 221 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-03 03:37:04,760 INFO L118 LiptonReduction]: Number of co-enabled transitions 4636 [2022-11-03 03:37:07,758 INFO L133 LiptonReduction]: Checked pairs total: 13984 [2022-11-03 03:37:07,759 INFO L135 LiptonReduction]: Total number of compositions: 74 [2022-11-03 03:37:07,771 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 54 transitions, 113 flow [2022-11-03 03:37:07,844 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 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-03 03:37:07,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:37:07,892 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;@28e8779f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:37:07,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-03 03:37:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 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-03 03:37:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 03:37:07,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:07,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:07,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash -932955283, now seen corresponding path program 1 times [2022-11-03 03:37:07,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:07,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665401418] [2022-11-03 03:37:07,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:08,281 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-03 03:37:08,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:08,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665401418] [2022-11-03 03:37:08,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665401418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:08,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:08,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:37:08,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286137122] [2022-11-03 03:37:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:08,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:37:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:08,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:37:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:37:08,321 INFO L87 Difference]: Start difference. First operand has 560 states, 546 states have (on average 2.0476190476190474) internal successors, (1118), 559 states have internal predecessors, (1118), 0 states have call successors, (0), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-03 03:37:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:08,448 INFO L93 Difference]: Finished difference Result 561 states and 1119 transitions. [2022-11-03 03:37:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:37:08,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-03 03:37:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:08,479 INFO L225 Difference]: With dead ends: 561 [2022-11-03 03:37:08,480 INFO L226 Difference]: Without dead ends: 561 [2022-11-03 03:37:08,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:37:08,486 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:08,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-11-03 03:37:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2022-11-03 03:37:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 547 states have (on average 2.045703839122486) internal successors, (1119), 560 states have internal predecessors, (1119), 0 states have call successors, (0), 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-03 03:37:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1119 transitions. [2022-11-03 03:37:08,609 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1119 transitions. Word has length 10 [2022-11-03 03:37:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:08,610 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 1119 transitions. [2022-11-03 03:37:08,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-03 03:37:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1119 transitions. [2022-11-03 03:37:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 03:37:08,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:08,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:08,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:37:08,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:08,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:08,614 INFO L85 PathProgramCache]: Analyzing trace with hash -159638791, now seen corresponding path program 1 times [2022-11-03 03:37:08,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:08,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114134248] [2022-11-03 03:37:08,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:08,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:08,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114134248] [2022-11-03 03:37:08,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114134248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:08,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370699461] [2022-11-03 03:37:08,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:08,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:08,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:08,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:08,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:37:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:08,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 03:37:08,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:37:08,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:37:08,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370699461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:08,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:37:08,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-11-03 03:37:08,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951628573] [2022-11-03 03:37:08,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:08,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:37:08,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:37:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:37:08,945 INFO L87 Difference]: Start difference. First operand 561 states and 1119 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-03 03:37:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:09,025 INFO L93 Difference]: Finished difference Result 849 states and 1695 transitions. [2022-11-03 03:37:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:37:09,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-03 03:37:09,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:09,045 INFO L225 Difference]: With dead ends: 849 [2022-11-03 03:37:09,045 INFO L226 Difference]: Without dead ends: 849 [2022-11-03 03:37:09,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:37:09,047 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 33 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:09,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 75 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:09,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-11-03 03:37:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 579. [2022-11-03 03:37:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 565 states have (on average 2.0442477876106193) internal successors, (1155), 578 states have internal predecessors, (1155), 0 states have call successors, (0), 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-03 03:37:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1155 transitions. [2022-11-03 03:37:09,085 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1155 transitions. Word has length 11 [2022-11-03 03:37:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:09,086 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 1155 transitions. [2022-11-03 03:37:09,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-03 03:37:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1155 transitions. [2022-11-03 03:37:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:37:09,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:09,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:09,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:09,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-03 03:37:09,327 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1905081537, now seen corresponding path program 1 times [2022-11-03 03:37:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:09,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546589330] [2022-11-03 03:37:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:09,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:09,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:09,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546589330] [2022-11-03 03:37:09,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546589330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:09,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153592909] [2022-11-03 03:37:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:09,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:09,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:09,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:09,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:37:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:09,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:37:09,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:09,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:09,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153592909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:09,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1969217878] [2022-11-03 03:37:09,655 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-03 03:37:09,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:09,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-03 03:37:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937993846] [2022-11-03 03:37:09,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:09,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:37:09,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:37:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:37:09,672 INFO L87 Difference]: Start difference. First operand 579 states and 1155 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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-03 03:37:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:09,775 INFO L93 Difference]: Finished difference Result 582 states and 1158 transitions. [2022-11-03 03:37:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:09,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 12 [2022-11-03 03:37:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:09,780 INFO L225 Difference]: With dead ends: 582 [2022-11-03 03:37:09,781 INFO L226 Difference]: Without dead ends: 582 [2022-11-03 03:37:09,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:37:09,793 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:09,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-03 03:37:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2022-11-03 03:37:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 568 states have (on average 2.038732394366197) internal successors, (1158), 581 states have internal predecessors, (1158), 0 states have call successors, (0), 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-03 03:37:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1158 transitions. [2022-11-03 03:37:09,832 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1158 transitions. Word has length 12 [2022-11-03 03:37:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:09,833 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1158 transitions. [2022-11-03 03:37:09,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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-03 03:37:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1158 transitions. [2022-11-03 03:37:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:37:09,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:09,837 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:09,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:10,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:10,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:10,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash 452824651, now seen corresponding path program 2 times [2022-11-03 03:37:10,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:10,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317894556] [2022-11-03 03:37:10,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:10,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:10,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:10,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317894556] [2022-11-03 03:37:10,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317894556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:10,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548317945] [2022-11-03 03:37:10,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:37:10,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:10,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:10,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:10,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:37:10,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 03:37:10,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:37:10,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 03:37:10,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:10,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:37:10,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:10,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:37:10,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:10,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:10,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:10,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:37:10,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:10,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:10,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:10,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:10,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:37:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 03:37:10,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:37:10,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548317945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:10,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:37:10,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2022-11-03 03:37:10,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387710208] [2022-11-03 03:37:10,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:10,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:37:10,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:10,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:37:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:37:10,697 INFO L87 Difference]: Start difference. First operand 582 states and 1158 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-03 03:37:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:11,381 INFO L93 Difference]: Finished difference Result 1222 states and 2438 transitions. [2022-11-03 03:37:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:37:11,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-03 03:37:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:11,388 INFO L225 Difference]: With dead ends: 1222 [2022-11-03 03:37:11,388 INFO L226 Difference]: Without dead ends: 1222 [2022-11-03 03:37:11,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-03 03:37:11,392 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 204 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:11,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 112 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:37:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-11-03 03:37:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 690. [2022-11-03 03:37:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 676 states have (on average 2.032544378698225) internal successors, (1374), 689 states have internal predecessors, (1374), 0 states have call successors, (0), 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-03 03:37:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1374 transitions. [2022-11-03 03:37:11,422 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1374 transitions. Word has length 15 [2022-11-03 03:37:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:11,423 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1374 transitions. [2022-11-03 03:37:11,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-03 03:37:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1374 transitions. [2022-11-03 03:37:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:37:11,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:11,429 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:11,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:11,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:11,651 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1105225257, now seen corresponding path program 1 times [2022-11-03 03:37:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:11,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387154411] [2022-11-03 03:37:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:11,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:11,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387154411] [2022-11-03 03:37:11,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387154411] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:11,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730055963] [2022-11-03 03:37:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:11,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:11,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:11,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:37:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:11,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:37:11,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:11,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:37:12,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730055963] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [84251930] [2022-11-03 03:37:12,070 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-03 03:37:12,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:12,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-03 03:37:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954520201] [2022-11-03 03:37:12,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:12,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:37:12,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:12,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:37:12,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:37:12,073 INFO L87 Difference]: Start difference. First operand 690 states and 1374 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-03 03:37:12,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:12,162 INFO L93 Difference]: Finished difference Result 696 states and 1380 transitions. [2022-11-03 03:37:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:37:12,163 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-03 03:37:12,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:12,167 INFO L225 Difference]: With dead ends: 696 [2022-11-03 03:37:12,167 INFO L226 Difference]: Without dead ends: 696 [2022-11-03 03:37:12,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:37:12,168 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:12,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-03 03:37:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2022-11-03 03:37:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 682 states have (on average 2.0234604105571847) internal successors, (1380), 695 states have internal predecessors, (1380), 0 states have call successors, (0), 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-03 03:37:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1380 transitions. [2022-11-03 03:37:12,194 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1380 transitions. Word has length 15 [2022-11-03 03:37:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:12,194 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 1380 transitions. [2022-11-03 03:37:12,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 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-03 03:37:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1380 transitions. [2022-11-03 03:37:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:37:12,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:12,198 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:12,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:12,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:12,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1383314775, now seen corresponding path program 2 times [2022-11-03 03:37:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:12,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801026742] [2022-11-03 03:37:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:12,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:12,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801026742] [2022-11-03 03:37:12,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801026742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:12,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:12,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:37:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820040258] [2022-11-03 03:37:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:12,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:12,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:12,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:12,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:37:12,922 INFO L87 Difference]: Start difference. First operand 696 states and 1380 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-03 03:37:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:13,376 INFO L93 Difference]: Finished difference Result 868 states and 1724 transitions. [2022-11-03 03:37:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-03 03:37:13,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:13,382 INFO L225 Difference]: With dead ends: 868 [2022-11-03 03:37:13,382 INFO L226 Difference]: Without dead ends: 868 [2022-11-03 03:37:13,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03 03:37:13,383 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 66 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:13,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 46 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:37:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-11-03 03:37:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 808. [2022-11-03 03:37:13,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 794 states have (on average 2.0201511335012596) internal successors, (1604), 807 states have internal predecessors, (1604), 0 states have call successors, (0), 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-03 03:37:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1604 transitions. [2022-11-03 03:37:13,416 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1604 transitions. Word has length 21 [2022-11-03 03:37:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:13,417 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1604 transitions. [2022-11-03 03:37:13,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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-03 03:37:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1604 transitions. [2022-11-03 03:37:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:37:13,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:13,420 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:13,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:37:13,420 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:13,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1269643912, now seen corresponding path program 1 times [2022-11-03 03:37:13,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:13,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622755048] [2022-11-03 03:37:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:13,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:13,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:13,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622755048] [2022-11-03 03:37:13,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622755048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:13,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:13,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:37:13,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936553936] [2022-11-03 03:37:13,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:13,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:13,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:13,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:13,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:37:13,887 INFO L87 Difference]: Start difference. First operand 808 states and 1604 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-03 03:37:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:14,142 INFO L93 Difference]: Finished difference Result 874 states and 1736 transitions. [2022-11-03 03:37:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:14,143 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 27 [2022-11-03 03:37:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:14,148 INFO L225 Difference]: With dead ends: 874 [2022-11-03 03:37:14,148 INFO L226 Difference]: Without dead ends: 874 [2022-11-03 03:37:14,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03 03:37:14,149 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 40 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:14,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 51 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:37:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-11-03 03:37:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2022-11-03 03:37:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 860 states have (on average 2.0186046511627906) internal successors, (1736), 873 states have internal predecessors, (1736), 0 states have call successors, (0), 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-03 03:37:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1736 transitions. [2022-11-03 03:37:14,175 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1736 transitions. Word has length 27 [2022-11-03 03:37:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:14,176 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 1736 transitions. [2022-11-03 03:37:14,176 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-03 03:37:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1736 transitions. [2022-11-03 03:37:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:37:14,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:14,177 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:14,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:37:14,178 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:14,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1665845093, now seen corresponding path program 1 times [2022-11-03 03:37:14,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:14,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067899387] [2022-11-03 03:37:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:14,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:14,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067899387] [2022-11-03 03:37:14,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067899387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:14,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:14,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:37:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846221555] [2022-11-03 03:37:14,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:14,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:37:14,630 INFO L87 Difference]: Start difference. First operand 874 states and 1736 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-03 03:37:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:15,111 INFO L93 Difference]: Finished difference Result 1026 states and 2040 transitions. [2022-11-03 03:37:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:15,112 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 27 [2022-11-03 03:37:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:15,116 INFO L225 Difference]: With dead ends: 1026 [2022-11-03 03:37:15,117 INFO L226 Difference]: Without dead ends: 1010 [2022-11-03 03:37:15,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03 03:37:15,118 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 62 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:15,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 48 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:37:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-11-03 03:37:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 974. [2022-11-03 03:37:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 960 states have (on average 2.0145833333333334) internal successors, (1934), 973 states have internal predecessors, (1934), 0 states have call successors, (0), 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-03 03:37:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1934 transitions. [2022-11-03 03:37:15,146 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1934 transitions. Word has length 27 [2022-11-03 03:37:15,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:15,146 INFO L495 AbstractCegarLoop]: Abstraction has 974 states and 1934 transitions. [2022-11-03 03:37:15,147 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-03 03:37:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1934 transitions. [2022-11-03 03:37:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 03:37:15,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:15,148 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:15,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:37:15,149 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1323529639, now seen corresponding path program 1 times [2022-11-03 03:37:15,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:15,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904044287] [2022-11-03 03:37:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 03:37:15,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:15,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904044287] [2022-11-03 03:37:15,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904044287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:15,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652756423] [2022-11-03 03:37:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:15,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:15,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:15,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:15,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:37:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:15,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 03:37:15,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:15,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:37:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:16,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:37:16,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652756423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:16,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:37:16,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-03 03:37:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446330274] [2022-11-03 03:37:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:16,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:37:16,011 INFO L87 Difference]: Start difference. First operand 974 states and 1934 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-03 03:37:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:16,234 INFO L93 Difference]: Finished difference Result 1728 states and 3429 transitions. [2022-11-03 03:37:16,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:16,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2022-11-03 03:37:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:16,246 INFO L225 Difference]: With dead ends: 1728 [2022-11-03 03:37:16,246 INFO L226 Difference]: Without dead ends: 1728 [2022-11-03 03:37:16,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:37:16,247 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 140 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:16,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 154 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:37:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-11-03 03:37:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 994. [2022-11-03 03:37:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 980 states have (on average 2.0010204081632654) internal successors, (1961), 993 states have internal predecessors, (1961), 0 states have call successors, (0), 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-03 03:37:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1961 transitions. [2022-11-03 03:37:16,291 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1961 transitions. Word has length 31 [2022-11-03 03:37:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:16,291 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1961 transitions. [2022-11-03 03:37:16,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-03 03:37:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1961 transitions. [2022-11-03 03:37:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 03:37:16,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:16,293 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:16,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:16,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:16,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:16,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash 578718625, now seen corresponding path program 2 times [2022-11-03 03:37:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:16,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236793014] [2022-11-03 03:37:16,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:16,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 03:37:17,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:17,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236793014] [2022-11-03 03:37:17,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236793014] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:17,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102650433] [2022-11-03 03:37:17,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:37:17,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:17,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:17,263 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:17,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:37:17,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 03:37:17,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:37:17,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 03:37:17,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:17,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:37:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:17,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:37:17,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102650433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:17,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:37:17,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-03 03:37:17,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913203613] [2022-11-03 03:37:17,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:17,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:17,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:37:17,489 INFO L87 Difference]: Start difference. First operand 994 states and 1961 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-03 03:37:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:17,659 INFO L93 Difference]: Finished difference Result 1755 states and 3457 transitions. [2022-11-03 03:37:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:37:17,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2022-11-03 03:37:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:17,668 INFO L225 Difference]: With dead ends: 1755 [2022-11-03 03:37:17,668 INFO L226 Difference]: Without dead ends: 1755 [2022-11-03 03:37:17,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:37:17,669 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 151 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:17,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 136 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2022-11-03 03:37:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1008. [2022-11-03 03:37:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 994 states have (on average 1.987927565392354) internal successors, (1976), 1007 states have internal predecessors, (1976), 0 states have call successors, (0), 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-03 03:37:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1976 transitions. [2022-11-03 03:37:17,705 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1976 transitions. Word has length 31 [2022-11-03 03:37:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:17,705 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1976 transitions. [2022-11-03 03:37:17,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-03 03:37:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1976 transitions. [2022-11-03 03:37:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 03:37:17,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:17,707 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:17,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:17,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:17,921 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash -960069817, now seen corresponding path program 3 times [2022-11-03 03:37:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:17,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537446594] [2022-11-03 03:37:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 03:37:18,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:18,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537446594] [2022-11-03 03:37:18,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537446594] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:18,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121486939] [2022-11-03 03:37:18,607 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:37:18,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:18,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:18,608 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:18,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:37:18,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:37:18,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:37:18,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 03:37:18,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:18,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:37:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:18,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:37:18,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121486939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:18,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:37:18,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-03 03:37:18,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759304520] [2022-11-03 03:37:18,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:18,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:18,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:37:18,958 INFO L87 Difference]: Start difference. First operand 1008 states and 1976 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-03 03:37:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:19,153 INFO L93 Difference]: Finished difference Result 2168 states and 4268 transitions. [2022-11-03 03:37:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:19,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2022-11-03 03:37:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:19,163 INFO L225 Difference]: With dead ends: 2168 [2022-11-03 03:37:19,164 INFO L226 Difference]: Without dead ends: 2168 [2022-11-03 03:37:19,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:37:19,165 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 169 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:19,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 135 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:37:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2022-11-03 03:37:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 1037. [2022-11-03 03:37:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1023 states have (on average 1.9882697947214076) internal successors, (2034), 1036 states have internal predecessors, (2034), 0 states have call successors, (0), 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-03 03:37:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 2034 transitions. [2022-11-03 03:37:19,207 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 2034 transitions. Word has length 31 [2022-11-03 03:37:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:19,207 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 2034 transitions. [2022-11-03 03:37:19,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-03 03:37:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 2034 transitions. [2022-11-03 03:37:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 03:37:19,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:19,209 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:19,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:19,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 03:37:19,433 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1203338905, now seen corresponding path program 4 times [2022-11-03 03:37:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:19,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553459546] [2022-11-03 03:37:19,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:19,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 03:37:19,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:19,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553459546] [2022-11-03 03:37:19,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553459546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:19,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625091513] [2022-11-03 03:37:19,862 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:37:19,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:19,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:19,867 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:19,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:37:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:20,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 03:37:20,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:20,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:37:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:20,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:37:20,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625091513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:20,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:37:20,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-03 03:37:20,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568766913] [2022-11-03 03:37:20,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:20,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:20,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:20,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:20,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:37:20,131 INFO L87 Difference]: Start difference. First operand 1037 states and 2034 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-03 03:37:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:20,373 INFO L93 Difference]: Finished difference Result 2403 states and 4739 transitions. [2022-11-03 03:37:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:20,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 31 [2022-11-03 03:37:20,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:20,386 INFO L225 Difference]: With dead ends: 2403 [2022-11-03 03:37:20,386 INFO L226 Difference]: Without dead ends: 2403 [2022-11-03 03:37:20,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:37:20,387 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 166 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:20,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 139 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:37:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2022-11-03 03:37:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1050. [2022-11-03 03:37:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1036 states have (on average 1.9884169884169884) internal successors, (2060), 1049 states have internal predecessors, (2060), 0 states have call successors, (0), 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-03 03:37:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2060 transitions. [2022-11-03 03:37:20,435 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2060 transitions. Word has length 31 [2022-11-03 03:37:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:20,435 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 2060 transitions. [2022-11-03 03:37:20,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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-03 03:37:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2060 transitions. [2022-11-03 03:37:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 03:37:20,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:20,437 INFO L195 NwaCegarLoop]: trace histogram [10, 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-03 03:37:20,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:20,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 03:37:20,655 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2125899233, now seen corresponding path program 1 times [2022-11-03 03:37:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:20,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741902372] [2022-11-03 03:37:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:20,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:20,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741902372] [2022-11-03 03:37:20,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741902372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:20,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436773135] [2022-11-03 03:37:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:20,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:20,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:20,733 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:20,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:37:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:20,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 03:37:20,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:20,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:20,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436773135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:20,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1811065538] [2022-11-03 03:37:20,978 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-03 03:37:20,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:20,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-03 03:37:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033062549] [2022-11-03 03:37:20,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:20,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:37:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:20,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:37:20,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:37:20,982 INFO L87 Difference]: Start difference. First operand 1050 states and 2060 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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-03 03:37:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:21,136 INFO L93 Difference]: Finished difference Result 2424 states and 4808 transitions. [2022-11-03 03:37:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:21,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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-03 03:37:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:21,150 INFO L225 Difference]: With dead ends: 2424 [2022-11-03 03:37:21,150 INFO L226 Difference]: Without dead ends: 2424 [2022-11-03 03:37:21,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:37:21,151 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 178 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:21,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 192 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:37:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2022-11-03 03:37:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2275. [2022-11-03 03:37:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2275 states, 2261 states have (on average 2.060592658115878) internal successors, (4659), 2274 states have internal predecessors, (4659), 0 states have call successors, (0), 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-03 03:37:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 4659 transitions. [2022-11-03 03:37:21,233 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 4659 transitions. Word has length 34 [2022-11-03 03:37:21,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:21,234 INFO L495 AbstractCegarLoop]: Abstraction has 2275 states and 4659 transitions. [2022-11-03 03:37:21,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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-03 03:37:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 4659 transitions. [2022-11-03 03:37:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 03:37:21,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:21,236 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:21,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:21,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:21,451 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash 227120471, now seen corresponding path program 1 times [2022-11-03 03:37:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:21,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320342875] [2022-11-03 03:37:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-03 03:37:21,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:21,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320342875] [2022-11-03 03:37:21,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320342875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:21,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:21,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:37:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117588105] [2022-11-03 03:37:21,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:21,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:21,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:21,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:21,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:37:21,830 INFO L87 Difference]: Start difference. First operand 2275 states and 4659 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-03 03:37:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:22,156 INFO L93 Difference]: Finished difference Result 2609 states and 5313 transitions. [2022-11-03 03:37:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:22,157 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 35 [2022-11-03 03:37:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:22,180 INFO L225 Difference]: With dead ends: 2609 [2022-11-03 03:37:22,180 INFO L226 Difference]: Without dead ends: 2609 [2022-11-03 03:37:22,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03 03:37:22,181 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:22,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:37:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-11-03 03:37:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2457. [2022-11-03 03:37:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2444 states have (on average 2.049509001636661) internal successors, (5009), 2456 states have internal predecessors, (5009), 0 states have call successors, (0), 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-03 03:37:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 5009 transitions. [2022-11-03 03:37:22,256 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 5009 transitions. Word has length 35 [2022-11-03 03:37:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:22,256 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 5009 transitions. [2022-11-03 03:37:22,256 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-03 03:37:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 5009 transitions. [2022-11-03 03:37:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:37:22,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:22,258 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 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] [2022-11-03 03:37:22,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 03:37:22,259 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:22,260 INFO L85 PathProgramCache]: Analyzing trace with hash 160846879, now seen corresponding path program 1 times [2022-11-03 03:37:22,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:22,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020785542] [2022-11-03 03:37:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:22,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:23,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:23,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020785542] [2022-11-03 03:37:23,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020785542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:23,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502665036] [2022-11-03 03:37:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:23,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:23,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:23,267 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:23,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:37:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:23,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 03:37:23,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:23,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:37:24,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:37:24,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:37:24,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:37:24,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:24,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:37:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:24,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:25,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502665036] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:25,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1118881756] [2022-11-03 03:37:25,789 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-03 03:37:25,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:25,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 03:37:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367399936] [2022-11-03 03:37:25,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:25,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:37:25,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:25,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:37:25,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2022-11-03 03:37:25,791 INFO L87 Difference]: Start difference. First operand 2457 states and 5009 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:37:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:33,186 INFO L93 Difference]: Finished difference Result 14698 states and 29790 transitions. [2022-11-03 03:37:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-03 03:37:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:37:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:33,241 INFO L225 Difference]: With dead ends: 14698 [2022-11-03 03:37:33,241 INFO L226 Difference]: Without dead ends: 14696 [2022-11-03 03:37:33,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1296, Invalid=4866, Unknown=0, NotChecked=0, Total=6162 [2022-11-03 03:37:33,243 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 1705 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3297 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 4418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 3297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 902 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:33,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 307 Invalid, 4418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 3297 Invalid, 0 Unknown, 902 Unchecked, 3.7s Time] [2022-11-03 03:37:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14696 states. [2022-11-03 03:37:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14696 to 6748. [2022-11-03 03:37:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6748 states, 6735 states have (on average 2.143578322197476) internal successors, (14437), 6747 states have internal predecessors, (14437), 0 states have call successors, (0), 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-03 03:37:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6748 states to 6748 states and 14437 transitions. [2022-11-03 03:37:33,621 INFO L78 Accepts]: Start accepts. Automaton has 6748 states and 14437 transitions. Word has length 45 [2022-11-03 03:37:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:33,623 INFO L495 AbstractCegarLoop]: Abstraction has 6748 states and 14437 transitions. [2022-11-03 03:37:33,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:37:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6748 states and 14437 transitions. [2022-11-03 03:37:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:37:33,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:33,627 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 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] [2022-11-03 03:37:33,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:33,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 03:37:33,840 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:33,840 INFO L85 PathProgramCache]: Analyzing trace with hash 112427359, now seen corresponding path program 2 times [2022-11-03 03:37:33,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:33,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451926691] [2022-11-03 03:37:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:34,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:34,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451926691] [2022-11-03 03:37:34,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451926691] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:34,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459199087] [2022-11-03 03:37:34,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:37:34,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:34,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:34,775 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:34,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:37:35,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:37:35,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:37:35,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:37:35,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:35,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:37:35,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:37:35,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 03:37:35,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:37:35,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:37:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:35,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:36,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459199087] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:36,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [830781816] [2022-11-03 03:37:36,360 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-03 03:37:36,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:36,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-03 03:37:36,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114123252] [2022-11-03 03:37:36,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:36,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 03:37:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:36,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 03:37:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2022-11-03 03:37:36,362 INFO L87 Difference]: Start difference. First operand 6748 states and 14437 transitions. Second operand has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 03:37:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:41,268 INFO L93 Difference]: Finished difference Result 14611 states and 29667 transitions. [2022-11-03 03:37:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-03 03:37:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 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 45 [2022-11-03 03:37:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:41,323 INFO L225 Difference]: With dead ends: 14611 [2022-11-03 03:37:41,323 INFO L226 Difference]: Without dead ends: 14607 [2022-11-03 03:37:41,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=749, Invalid=3033, Unknown=0, NotChecked=0, Total=3782 [2022-11-03 03:37:41,326 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 1397 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 3120 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 3120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:41,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 367 Invalid, 3641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 3120 Invalid, 0 Unknown, 256 Unchecked, 3.3s Time] [2022-11-03 03:37:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14607 states. [2022-11-03 03:37:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14607 to 6796. [2022-11-03 03:37:41,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6796 states, 6783 states have (on average 2.142562288073124) internal successors, (14533), 6795 states have internal predecessors, (14533), 0 states have call successors, (0), 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-03 03:37:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6796 states to 6796 states and 14533 transitions. [2022-11-03 03:37:41,692 INFO L78 Accepts]: Start accepts. Automaton has 6796 states and 14533 transitions. Word has length 45 [2022-11-03 03:37:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:41,693 INFO L495 AbstractCegarLoop]: Abstraction has 6796 states and 14533 transitions. [2022-11-03 03:37:41,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 03:37:41,694 INFO L276 IsEmpty]: Start isEmpty. Operand 6796 states and 14533 transitions. [2022-11-03 03:37:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:37:41,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:41,697 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 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-03 03:37:41,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:41,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 03:37:41,919 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash 401152003, now seen corresponding path program 1 times [2022-11-03 03:37:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:41,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040878829] [2022-11-03 03:37:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:42,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040878829] [2022-11-03 03:37:42,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040878829] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126157546] [2022-11-03 03:37:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:42,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:42,897 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:42,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:37:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:43,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 03:37:43,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:43,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:37:43,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:37:43,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:37:43,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:37:43,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:43,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:43,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:43,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:43,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:37:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:43,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:45,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126157546] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1594890996] [2022-11-03 03:37:45,023 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-03 03:37:45,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:45,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 03:37:45,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866070643] [2022-11-03 03:37:45,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:45,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:37:45,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:45,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:37:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-11-03 03:37:45,025 INFO L87 Difference]: Start difference. First operand 6796 states and 14533 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:37:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:50,650 INFO L93 Difference]: Finished difference Result 16886 states and 34208 transitions. [2022-11-03 03:37:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-03 03:37:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:37:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:50,709 INFO L225 Difference]: With dead ends: 16886 [2022-11-03 03:37:50,709 INFO L226 Difference]: Without dead ends: 16886 [2022-11-03 03:37:50,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2397 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1598, Invalid=6058, Unknown=0, NotChecked=0, Total=7656 [2022-11-03 03:37:50,712 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1643 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 2296 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 3535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 825 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:50,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 325 Invalid, 3535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2296 Invalid, 0 Unknown, 825 Unchecked, 2.6s Time] [2022-11-03 03:37:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16886 states. [2022-11-03 03:37:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16886 to 7191. [2022-11-03 03:37:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7191 states, 7178 states have (on average 2.1411256617442183) internal successors, (15369), 7190 states have internal predecessors, (15369), 0 states have call successors, (0), 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-03 03:37:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7191 states to 7191 states and 15369 transitions. [2022-11-03 03:37:51,019 INFO L78 Accepts]: Start accepts. Automaton has 7191 states and 15369 transitions. Word has length 45 [2022-11-03 03:37:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:51,019 INFO L495 AbstractCegarLoop]: Abstraction has 7191 states and 15369 transitions. [2022-11-03 03:37:51,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:37:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 7191 states and 15369 transitions. [2022-11-03 03:37:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:37:51,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:51,023 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 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-03 03:37:51,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:51,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:37:51,239 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:37:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash -113094947, now seen corresponding path program 2 times [2022-11-03 03:37:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:51,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448647171] [2022-11-03 03:37:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:51,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:52,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:52,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448647171] [2022-11-03 03:37:52,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448647171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:52,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565876843] [2022-11-03 03:37:52,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:37:52,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:52,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:52,133 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:52,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 03:37:52,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:37:52,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:37:52,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 03:37:52,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:52,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:37:52,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:37:52,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:37:53,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:37:53,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:53,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:53,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:53,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:53,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:37:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:53,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:37:54,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565876843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:54,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1296439246] [2022-11-03 03:37:54,383 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-03 03:37:54,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:54,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 03:37:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140905751] [2022-11-03 03:37:54,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:54,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:37:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:54,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:37:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2022-11-03 03:37:54,386 INFO L87 Difference]: Start difference. First operand 7191 states and 15369 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:38:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:00,010 INFO L93 Difference]: Finished difference Result 14833 states and 30081 transitions. [2022-11-03 03:38:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-03 03:38:00,011 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:38:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:00,053 INFO L225 Difference]: With dead ends: 14833 [2022-11-03 03:38:00,053 INFO L226 Difference]: Without dead ends: 14833 [2022-11-03 03:38:00,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1232, Invalid=4930, Unknown=0, NotChecked=0, Total=6162 [2022-11-03 03:38:00,056 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1079 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 5396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1559 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:00,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 396 Invalid, 5396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 3642 Invalid, 0 Unknown, 1559 Unchecked, 3.1s Time] [2022-11-03 03:38:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14833 states. [2022-11-03 03:38:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14833 to 7230. [2022-11-03 03:38:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7230 states, 7217 states have (on average 2.140363031730636) internal successors, (15447), 7229 states have internal predecessors, (15447), 0 states have call successors, (0), 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-03 03:38:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 15447 transitions. [2022-11-03 03:38:00,332 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 15447 transitions. Word has length 45 [2022-11-03 03:38:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:00,333 INFO L495 AbstractCegarLoop]: Abstraction has 7230 states and 15447 transitions. [2022-11-03 03:38:00,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:38:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 15447 transitions. [2022-11-03 03:38:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:38:00,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:00,336 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 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-03 03:38:00,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:00,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 03:38:00,551 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:38:00,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash -112921967, now seen corresponding path program 3 times [2022-11-03 03:38:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:00,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751362864] [2022-11-03 03:38:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:01,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:01,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751362864] [2022-11-03 03:38:01,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751362864] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:01,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454813793] [2022-11-03 03:38:01,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:38:01,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:01,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:01,348 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:01,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 03:38:01,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:38:01,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:38:01,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 03:38:01,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:02,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:38:02,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:38:02,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:38:02,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:02,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:02,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:02,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 03:38:02,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:38:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:02,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:03,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454813793] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:03,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2127322443] [2022-11-03 03:38:03,066 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-03 03:38:03,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:03,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 03:38:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359273779] [2022-11-03 03:38:03,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:03,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 03:38:03,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:03,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 03:38:03,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-11-03 03:38:03,070 INFO L87 Difference]: Start difference. First operand 7230 states and 15447 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 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-03 03:38:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:08,172 INFO L93 Difference]: Finished difference Result 13518 states and 27519 transitions. [2022-11-03 03:38:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-03 03:38:08,173 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 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 45 [2022-11-03 03:38:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:08,205 INFO L225 Difference]: With dead ends: 13518 [2022-11-03 03:38:08,205 INFO L226 Difference]: Without dead ends: 13518 [2022-11-03 03:38:08,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1284, Invalid=5036, Unknown=0, NotChecked=0, Total=6320 [2022-11-03 03:38:08,208 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1425 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 2977 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 4119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 824 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:08,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1425 Valid, 293 Invalid, 4119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2977 Invalid, 0 Unknown, 824 Unchecked, 2.8s Time] [2022-11-03 03:38:08,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13518 states. [2022-11-03 03:38:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13518 to 8430. [2022-11-03 03:38:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8430 states, 8417 states have (on average 2.1406676963288582) internal successors, (18018), 8429 states have internal predecessors, (18018), 0 states have call successors, (0), 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-03 03:38:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8430 states to 8430 states and 18018 transitions. [2022-11-03 03:38:08,516 INFO L78 Accepts]: Start accepts. Automaton has 8430 states and 18018 transitions. Word has length 45 [2022-11-03 03:38:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:08,516 INFO L495 AbstractCegarLoop]: Abstraction has 8430 states and 18018 transitions. [2022-11-03 03:38:08,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 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-03 03:38:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 8430 states and 18018 transitions. [2022-11-03 03:38:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:38:08,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:08,520 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:08,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:08,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:08,747 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:38:08,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2098085773, now seen corresponding path program 1 times [2022-11-03 03:38:08,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:08,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48373912] [2022-11-03 03:38:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:08,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:10,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48373912] [2022-11-03 03:38:10,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48373912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856945211] [2022-11-03 03:38:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:10,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:10,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:10,455 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:10,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 03:38:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:10,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 03:38:10,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:10,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:38:11,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:38:11,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:38:11,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:38:11,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:38:11,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:38:11,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:38:11,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:38:11,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:11,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:38:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:11,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:13,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856945211] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:13,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2046781159] [2022-11-03 03:38:13,550 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-03 03:38:13,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:13,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-11-03 03:38:13,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078003805] [2022-11-03 03:38:13,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:13,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 03:38:13,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:13,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 03:38:13,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 03:38:13,553 INFO L87 Difference]: Start difference. First operand 8430 states and 18018 transitions. Second operand has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:38:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:19,438 INFO L93 Difference]: Finished difference Result 13961 states and 28479 transitions. [2022-11-03 03:38:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-03 03:38:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:38:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:19,471 INFO L225 Difference]: With dead ends: 13961 [2022-11-03 03:38:19,471 INFO L226 Difference]: Without dead ends: 13957 [2022-11-03 03:38:19,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=724, Invalid=3058, Unknown=0, NotChecked=0, Total=3782 [2022-11-03 03:38:19,473 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 1121 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 4102 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 6038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 4102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1630 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:19,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 416 Invalid, 6038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 4102 Invalid, 0 Unknown, 1630 Unchecked, 4.1s Time] [2022-11-03 03:38:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13957 states. [2022-11-03 03:38:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13957 to 8859. [2022-11-03 03:38:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8859 states, 8846 states have (on average 2.1341849423468235) internal successors, (18879), 8858 states have internal predecessors, (18879), 0 states have call successors, (0), 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-03 03:38:19,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8859 states to 8859 states and 18879 transitions. [2022-11-03 03:38:19,803 INFO L78 Accepts]: Start accepts. Automaton has 8859 states and 18879 transitions. Word has length 45 [2022-11-03 03:38:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:19,804 INFO L495 AbstractCegarLoop]: Abstraction has 8859 states and 18879 transitions. [2022-11-03 03:38:19,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:38:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 8859 states and 18879 transitions. [2022-11-03 03:38:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:38:19,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:19,808 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 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-03 03:38:19,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:20,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:20,026 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:38:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:20,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1450694435, now seen corresponding path program 4 times [2022-11-03 03:38:20,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:20,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83110997] [2022-11-03 03:38:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:20,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:20,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83110997] [2022-11-03 03:38:20,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83110997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:20,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493827777] [2022-11-03 03:38:20,953 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:38:20,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:20,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:20,954 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:20,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 03:38:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:21,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 03:38:21,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:21,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:38:21,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:38:21,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:38:21,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:38:21,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:21,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:21,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:21,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:21,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:38:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:21,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:22,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493827777] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:22,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [442223248] [2022-11-03 03:38:22,872 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-03 03:38:22,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:22,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 03:38:22,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552233370] [2022-11-03 03:38:22,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:22,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:38:22,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:38:22,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-11-03 03:38:22,875 INFO L87 Difference]: Start difference. First operand 8859 states and 18879 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:38:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:28,649 INFO L93 Difference]: Finished difference Result 17136 states and 34742 transitions. [2022-11-03 03:38:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-03 03:38:28,650 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:38:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:28,680 INFO L225 Difference]: With dead ends: 17136 [2022-11-03 03:38:28,681 INFO L226 Difference]: Without dead ends: 17136 [2022-11-03 03:38:28,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2357 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1598, Invalid=6058, Unknown=0, NotChecked=0, Total=7656 [2022-11-03 03:38:28,683 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 1571 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 3437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 513 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:28,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 320 Invalid, 3437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 2566 Invalid, 0 Unknown, 513 Unchecked, 2.8s Time] [2022-11-03 03:38:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17136 states. [2022-11-03 03:38:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17136 to 8638. [2022-11-03 03:38:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8638 states, 8625 states have (on average 2.1349565217391304) internal successors, (18414), 8637 states have internal predecessors, (18414), 0 states have call successors, (0), 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-03 03:38:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8638 states to 8638 states and 18414 transitions. [2022-11-03 03:38:29,099 INFO L78 Accepts]: Start accepts. Automaton has 8638 states and 18414 transitions. Word has length 45 [2022-11-03 03:38:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:29,101 INFO L495 AbstractCegarLoop]: Abstraction has 8638 states and 18414 transitions. [2022-11-03 03:38:29,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:38:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 8638 states and 18414 transitions. [2022-11-03 03:38:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:38:29,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:29,105 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:29,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:29,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:29,315 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:38:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2134931796, now seen corresponding path program 1 times [2022-11-03 03:38:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:29,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585437653] [2022-11-03 03:38:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:30,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:30,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585437653] [2022-11-03 03:38:30,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585437653] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:30,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082118365] [2022-11-03 03:38:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:30,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:30,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:30,111 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:30,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 03:38:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:30,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 03:38:30,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:30,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:38:30,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:38:30,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:38:30,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:30,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:30,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:30,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 03:38:30,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:38:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:30,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:31,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082118365] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:31,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [727877807] [2022-11-03 03:38:31,677 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-03 03:38:31,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:31,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 03:38:31,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878510659] [2022-11-03 03:38:31,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:31,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 03:38:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:31,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 03:38:31,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-11-03 03:38:31,680 INFO L87 Difference]: Start difference. First operand 8638 states and 18414 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 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-03 03:38:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:36,199 INFO L93 Difference]: Finished difference Result 12909 states and 26303 transitions. [2022-11-03 03:38:36,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-03 03:38:36,203 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 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 45 [2022-11-03 03:38:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:36,227 INFO L225 Difference]: With dead ends: 12909 [2022-11-03 03:38:36,227 INFO L226 Difference]: Without dead ends: 12909 [2022-11-03 03:38:36,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1130, Invalid=3982, Unknown=0, NotChecked=0, Total=5112 [2022-11-03 03:38:36,229 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 1154 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:36,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 285 Invalid, 3643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 3046 Invalid, 0 Unknown, 385 Unchecked, 2.6s Time] [2022-11-03 03:38:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states. [2022-11-03 03:38:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 8677. [2022-11-03 03:38:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8677 states, 8664 states have (on average 2.1350415512465375) internal successors, (18498), 8676 states have internal predecessors, (18498), 0 states have call successors, (0), 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-03 03:38:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8677 states to 8677 states and 18498 transitions. [2022-11-03 03:38:36,504 INFO L78 Accepts]: Start accepts. Automaton has 8677 states and 18498 transitions. Word has length 45 [2022-11-03 03:38:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:36,504 INFO L495 AbstractCegarLoop]: Abstraction has 8677 states and 18498 transitions. [2022-11-03 03:38:36,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 states have internal predecessors, (102), 0 states have call successors, (0), 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-03 03:38:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8677 states and 18498 transitions. [2022-11-03 03:38:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:38:36,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:36,508 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:36,553 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:36,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 03:38:36,731 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:38:36,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2136488616, now seen corresponding path program 2 times [2022-11-03 03:38:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:36,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719253554] [2022-11-03 03:38:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:37,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:37,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719253554] [2022-11-03 03:38:37,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719253554] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:37,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331999821] [2022-11-03 03:38:37,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:38:37,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:37,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:37,419 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:37,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 03:38:37,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:38:37,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:38:37,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 03:38:37,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:38,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:38:38,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:38:38,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:38,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:38,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 03:38:38,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:38:38,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:38:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:38,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:38,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331999821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:38,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1075129472] [2022-11-03 03:38:38,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-03 03:38:38,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:38,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-03 03:38:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436365978] [2022-11-03 03:38:38,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:38,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 03:38:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 03:38:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2022-11-03 03:38:38,830 INFO L87 Difference]: Start difference. First operand 8677 states and 18498 transitions. Second operand has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 03:38:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:43,152 INFO L93 Difference]: Finished difference Result 15255 states and 31026 transitions. [2022-11-03 03:38:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-03 03:38:43,152 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 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 45 [2022-11-03 03:38:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:43,177 INFO L225 Difference]: With dead ends: 15255 [2022-11-03 03:38:43,177 INFO L226 Difference]: Without dead ends: 15255 [2022-11-03 03:38:43,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1247, Invalid=4453, Unknown=0, NotChecked=0, Total=5700 [2022-11-03 03:38:43,179 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1464 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:43,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 303 Invalid, 2966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2514 Invalid, 0 Unknown, 219 Unchecked, 2.2s Time] [2022-11-03 03:38:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15255 states. [2022-11-03 03:38:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15255 to 8731. [2022-11-03 03:38:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8731 states, 8718 states have (on average 2.127781601284698) internal successors, (18550), 8730 states have internal predecessors, (18550), 0 states have call successors, (0), 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-03 03:38:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 18550 transitions. [2022-11-03 03:38:43,456 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 18550 transitions. Word has length 45 [2022-11-03 03:38:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:43,456 INFO L495 AbstractCegarLoop]: Abstraction has 8731 states and 18550 transitions. [2022-11-03 03:38:43,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 03:38:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 18550 transitions. [2022-11-03 03:38:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:38:43,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:43,461 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:43,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:43,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:43,674 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:38:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:43,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1602257071, now seen corresponding path program 2 times [2022-11-03 03:38:43,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:43,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618472516] [2022-11-03 03:38:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:43,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:45,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:45,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618472516] [2022-11-03 03:38:45,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618472516] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:45,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921967497] [2022-11-03 03:38:45,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:38:45,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:45,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:45,197 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:45,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 03:38:45,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:38:45,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:38:45,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-03 03:38:45,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:45,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:38:45,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:45,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:38:45,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:45,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:45,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:38:45,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:45,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:45,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:45,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:38:46,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:38:46,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:38:46,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:38:46,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:38:46,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:46,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2022-11-03 03:38:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:38:52,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:39:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:39:01,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921967497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:39:01,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [226309907] [2022-11-03 03:39:01,198 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-03 03:39:01,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:39:01,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 37 [2022-11-03 03:39:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180220659] [2022-11-03 03:39:01,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:39:01,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:39:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:39:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:39:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1185, Unknown=2, NotChecked=0, Total=1406 [2022-11-03 03:39:01,201 INFO L87 Difference]: Start difference. First operand 8731 states and 18550 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:39:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:39:12,590 INFO L93 Difference]: Finished difference Result 15943 states and 32553 transitions. [2022-11-03 03:39:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-03 03:39:12,590 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:39:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:39:12,616 INFO L225 Difference]: With dead ends: 15943 [2022-11-03 03:39:12,616 INFO L226 Difference]: Without dead ends: 15940 [2022-11-03 03:39:12,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=884, Invalid=3803, Unknown=5, NotChecked=0, Total=4692 [2022-11-03 03:39:12,617 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 891 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 2886 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 5227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2086 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:39:12,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 498 Invalid, 5227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2886 Invalid, 0 Unknown, 2086 Unchecked, 2.8s Time] [2022-11-03 03:39:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2022-11-03 03:39:12,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 8832. [2022-11-03 03:39:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8832 states, 8819 states have (on average 2.126771742827985) internal successors, (18756), 8831 states have internal predecessors, (18756), 0 states have call successors, (0), 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-03 03:39:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8832 states to 8832 states and 18756 transitions. [2022-11-03 03:39:12,853 INFO L78 Accepts]: Start accepts. Automaton has 8832 states and 18756 transitions. Word has length 45 [2022-11-03 03:39:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:39:12,853 INFO L495 AbstractCegarLoop]: Abstraction has 8832 states and 18756 transitions. [2022-11-03 03:39:12,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:39:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 8832 states and 18756 transitions. [2022-11-03 03:39:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:39:12,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:39:12,857 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:39:12,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 03:39:13,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 03:39:13,083 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:39:13,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:39:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash -386836769, now seen corresponding path program 3 times [2022-11-03 03:39:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:39:13,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739844955] [2022-11-03 03:39:13,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:39:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:39:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:39:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:39:14,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:39:14,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739844955] [2022-11-03 03:39:14,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739844955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:39:14,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434705279] [2022-11-03 03:39:14,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:39:14,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:39:14,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:39:14,346 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:39:14,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 03:39:14,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:39:14,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:39:14,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 03:39:14,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:39:15,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:39:15,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:39:15,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:39:15,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:39:15,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:39:15,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:39:15,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:39:15,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:39:15,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:39:15,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:39:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:39:15,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:39:29,647 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse11 |c_~#cache~0.base| (store (select .cse11 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))))) is different from false [2022-11-03 03:40:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-11-03 03:40:44,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434705279] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:40:44,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [723447526] [2022-11-03 03:40:44,473 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-03 03:40:44,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:40:44,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 34 [2022-11-03 03:40:44,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363034227] [2022-11-03 03:40:44,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:40:44,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:40:44,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:40:44,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:40:44,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=940, Unknown=1, NotChecked=64, Total=1190 [2022-11-03 03:40:44,476 INFO L87 Difference]: Start difference. First operand 8832 states and 18756 transitions. Second operand has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:40:47,092 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse11 |c_~#cache~0.base| (store (select .cse11 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) is different from false [2022-11-03 03:40:50,978 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (+ .cse13 |c_~#cache~0.offset|))) (and (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse11 |c_~#cache~0.base| (store (select .cse11 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse13)))) is different from false [2022-11-03 03:40:55,248 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (+ .cse13 |c_~#cache~0.offset|))) (and (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse11 |c_~#cache~0.base| (store (select .cse11 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse13)))) is different from false [2022-11-03 03:40:57,651 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (+ .cse13 |c_~#cache~0.offset|))) (and (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse9 |c_~#cache~0.base| (store (select .cse9 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| Int)) (or (forall ((v_ArrVal_2553 Int) (v_ArrVal_2555 Int) (v_ArrVal_2565 Int) (v_ArrVal_2557 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| 1) v_ArrVal_2553) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2555) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311|) v_ArrVal_2557)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0) .cse3 0) .cse4 0))))) (store .cse11 |c_~#cache~0.base| (store (select .cse11 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| v_ArrVal_2565))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_311| .cse6))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse13)))) is different from false [2022-11-03 03:40:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:40:58,274 INFO L93 Difference]: Finished difference Result 27953 states and 58559 transitions. [2022-11-03 03:40:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-03 03:40:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:40:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:40:58,347 INFO L225 Difference]: With dead ends: 27953 [2022-11-03 03:40:58,347 INFO L226 Difference]: Without dead ends: 27953 [2022-11-03 03:40:58,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=531, Invalid=3390, Unknown=5, NotChecked=630, Total=4556 [2022-11-03 03:40:58,349 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 820 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 4834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1647 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:40:58,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 671 Invalid, 4834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 3047 Invalid, 0 Unknown, 1647 Unchecked, 3.1s Time] [2022-11-03 03:40:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27953 states. [2022-11-03 03:40:58,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27953 to 14318. [2022-11-03 03:40:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14318 states, 14305 states have (on average 2.139461726668997) internal successors, (30605), 14317 states have internal predecessors, (30605), 0 states have call successors, (0), 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-03 03:40:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14318 states to 14318 states and 30605 transitions. [2022-11-03 03:40:58,777 INFO L78 Accepts]: Start accepts. Automaton has 14318 states and 30605 transitions. Word has length 45 [2022-11-03 03:40:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:40:58,778 INFO L495 AbstractCegarLoop]: Abstraction has 14318 states and 30605 transitions. [2022-11-03 03:40:58,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:40:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 14318 states and 30605 transitions. [2022-11-03 03:40:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:40:58,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:40:58,782 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:40:58,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 03:40:58,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:40:58,999 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:40:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:40:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash -441693749, now seen corresponding path program 4 times [2022-11-03 03:40:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:40:59,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475234822] [2022-11-03 03:40:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:40:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:40:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:41:00,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:00,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475234822] [2022-11-03 03:41:00,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475234822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:00,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12362096] [2022-11-03 03:41:00,096 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:41:00,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:00,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:00,098 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:00,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 03:41:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:00,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 03:41:00,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:00,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:41:00,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:00,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:41:00,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:00,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:41:00,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:00,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:41:00,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:00,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:41:00,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:00,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:41:00,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:00,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:00,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:41:01,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:01,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:01,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:01,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:01,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:01,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 03:41:01,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:01,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:01,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:41:01,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:41:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:41:01,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:57,849 WARN L234 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 53 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:42:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:42:01,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12362096] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:01,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [282470482] [2022-11-03 03:42:01,100 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-03 03:42:01,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:01,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 33 [2022-11-03 03:42:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714670897] [2022-11-03 03:42:01,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:01,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 03:42:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 03:42:01,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=940, Unknown=19, NotChecked=0, Total=1122 [2022-11-03 03:42:01,103 INFO L87 Difference]: Start difference. First operand 14318 states and 30605 transitions. Second operand has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 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-03 03:42:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:09,716 INFO L93 Difference]: Finished difference Result 20277 states and 42274 transitions. [2022-11-03 03:42:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-03 03:42:09,716 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 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 45 [2022-11-03 03:42:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:09,752 INFO L225 Difference]: With dead ends: 20277 [2022-11-03 03:42:09,752 INFO L226 Difference]: Without dead ends: 20277 [2022-11-03 03:42:09,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 63.2s TimeCoverageRelationStatistics Valid=737, Invalid=3024, Unknown=21, NotChecked=0, Total=3782 [2022-11-03 03:42:09,754 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 881 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 838 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:09,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 389 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2308 Invalid, 0 Unknown, 838 Unchecked, 2.4s Time] [2022-11-03 03:42:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20277 states. [2022-11-03 03:42:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20277 to 14517. [2022-11-03 03:42:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14517 states, 14504 states have (on average 2.1375482625482625) internal successors, (31003), 14516 states have internal predecessors, (31003), 0 states have call successors, (0), 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-03 03:42:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14517 states to 14517 states and 31003 transitions. [2022-11-03 03:42:10,225 INFO L78 Accepts]: Start accepts. Automaton has 14517 states and 31003 transitions. Word has length 45 [2022-11-03 03:42:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:10,225 INFO L495 AbstractCegarLoop]: Abstraction has 14517 states and 31003 transitions. [2022-11-03 03:42:10,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 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-03 03:42:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 14517 states and 31003 transitions. [2022-11-03 03:42:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:42:10,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:10,229 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:10,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 03:42:10,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 03:42:10,432 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:42:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2113631939, now seen corresponding path program 5 times [2022-11-03 03:42:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:10,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431727082] [2022-11-03 03:42:10,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:42:11,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:11,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431727082] [2022-11-03 03:42:11,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431727082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:11,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359155297] [2022-11-03 03:42:11,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:42:11,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:11,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:11,419 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:11,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 03:42:11,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:42:11,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:11,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 03:42:11,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:12,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:42:12,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:42:12,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:42:12,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:42:12,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:42:12,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:42:12,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 03:42:12,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:42:12,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:12,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:42:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:42:12,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:15,835 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse0) (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse4 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse4 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse0))))) is different from false [2022-11-03 03:42:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-11-03 03:42:16,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359155297] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:16,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [838713838] [2022-11-03 03:42:16,227 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-03 03:42:16,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:16,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 32 [2022-11-03 03:42:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330525827] [2022-11-03 03:42:16,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:16,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 03:42:16,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:16,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 03:42:16,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=850, Unknown=1, NotChecked=60, Total=1056 [2022-11-03 03:42:16,231 INFO L87 Difference]: Start difference. First operand 14517 states and 31003 transitions. Second operand has 33 states, 32 states have (on average 3.15625) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 03:42:18,929 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse0) (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse4 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse4 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse0))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))) is different from false [2022-11-03 03:42:23,460 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ .cse0 |c_~#cache~0.offset|))) (and (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 1) .cse0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse1) (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse1))) (= |c_~#cache~0.offset| 0) (<= 0 |c_ULTIMATE.start_main_~i~2#1|)))) is different from false [2022-11-03 03:42:27,259 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ .cse0 |c_~#cache~0.offset|))) (and (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 1) .cse0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse1) (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse1)))))) is different from false [2022-11-03 03:42:28,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ .cse0 |c_~#cache~0.offset|))) (and (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 1) .cse0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse1) (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| Int)) (or (forall ((v_ArrVal_2881 Int) (v_ArrVal_2873 Int) (v_ArrVal_2875 Int) (v_ArrVal_2877 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store |c_#race| |c_~#cache~0.base| (store (store (store .cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| 1) v_ArrVal_2873) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2875) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315|) v_ArrVal_2877)))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| v_ArrVal_2881))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_315| .cse1))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1))))) is different from false [2022-11-03 03:42:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:29,094 INFO L93 Difference]: Finished difference Result 29129 states and 60822 transitions. [2022-11-03 03:42:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-03 03:42:29,094 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.15625) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 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 45 [2022-11-03 03:42:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:29,150 INFO L225 Difference]: With dead ends: 29129 [2022-11-03 03:42:29,150 INFO L226 Difference]: Without dead ends: 29125 [2022-11-03 03:42:29,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=857, Invalid=4708, Unknown=5, NotChecked=750, Total=6320 [2022-11-03 03:42:29,152 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1146 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 4726 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 6598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 4726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1502 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:29,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 721 Invalid, 6598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 4726 Invalid, 0 Unknown, 1502 Unchecked, 4.8s Time] [2022-11-03 03:42:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29125 states. [2022-11-03 03:42:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29125 to 14285. [2022-11-03 03:42:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14285 states, 14272 states have (on average 2.1399243273542603) internal successors, (30541), 14284 states have internal predecessors, (30541), 0 states have call successors, (0), 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-03 03:42:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14285 states to 14285 states and 30541 transitions. [2022-11-03 03:42:29,668 INFO L78 Accepts]: Start accepts. Automaton has 14285 states and 30541 transitions. Word has length 45 [2022-11-03 03:42:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:29,668 INFO L495 AbstractCegarLoop]: Abstraction has 14285 states and 30541 transitions. [2022-11-03 03:42:29,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.15625) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 03:42:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 14285 states and 30541 transitions. [2022-11-03 03:42:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:42:29,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:29,671 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:29,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-03 03:42:29,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 03:42:29,872 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:42:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash -965790217, now seen corresponding path program 6 times [2022-11-03 03:42:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:29,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472575880] [2022-11-03 03:42:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:42:31,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:31,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472575880] [2022-11-03 03:42:31,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472575880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:31,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693711507] [2022-11-03 03:42:31,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:42:31,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:31,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:31,219 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:31,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 03:42:32,132 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:42:32,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:42:32,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 03:42:32,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:32,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:42:32,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:42:32,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:42:32,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:42:32,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:42:32,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:42:32,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:42:32,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:32,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:42:33,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:42:33,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2022-11-03 03:42:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:42:39,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:43:04,378 WARN L234 SmtUtils]: Spent 10.43s on a formula simplification. DAG size of input: 54 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:43:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:43:15,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693711507] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:43:15,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [98635897] [2022-11-03 03:43:15,271 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-03 03:43:15,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:43:15,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 37 [2022-11-03 03:43:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45335974] [2022-11-03 03:43:15,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:43:15,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:43:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:43:15,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:43:15,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1190, Unknown=9, NotChecked=0, Total=1406 [2022-11-03 03:43:15,274 INFO L87 Difference]: Start difference. First operand 14285 states and 30541 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:43:44,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) .cse3 0))) (.cse4 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse0 (+ .cse4 |c_~#cache~0.offset|)) (.cse2 (select .cse1 |c_~#cache~0.base|))) (and (= |c_~#cache~0.base| 1) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| .cse0) (forall ((v_ArrVal_3045 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| 1) 0) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317|) 0) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| v_ArrVal_3045)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| .cse0) (forall ((v_ArrVal_3045 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| 1) 0) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317|) 0) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| v_ArrVal_3045)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| .cse0) (forall ((v_ArrVal_3045 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store .cse2 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| 1) 0) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317|) 0) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_317| v_ArrVal_3045)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse4))))) is different from false [2022-11-03 03:43:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:43:52,184 INFO L93 Difference]: Finished difference Result 35698 states and 75309 transitions. [2022-11-03 03:43:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-03 03:43:52,185 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:43:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:43:52,248 INFO L225 Difference]: With dead ends: 35698 [2022-11-03 03:43:52,249 INFO L226 Difference]: Without dead ends: 35695 [2022-11-03 03:43:52,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3063 ImplicationChecksByTransitivity, 73.9s TimeCoverageRelationStatistics Valid=1507, Invalid=7035, Unknown=18, NotChecked=182, Total=8742 [2022-11-03 03:43:52,250 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1145 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 4190 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 8857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 4190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4248 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:43:52,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 806 Invalid, 8857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 4190 Invalid, 0 Unknown, 4248 Unchecked, 4.8s Time] [2022-11-03 03:43:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35695 states. [2022-11-03 03:43:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35695 to 24551. [2022-11-03 03:43:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24551 states, 24538 states have (on average 2.175401418208493) internal successors, (53380), 24550 states have internal predecessors, (53380), 0 states have call successors, (0), 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-03 03:43:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24551 states to 24551 states and 53380 transitions. [2022-11-03 03:43:52,822 INFO L78 Accepts]: Start accepts. Automaton has 24551 states and 53380 transitions. Word has length 45 [2022-11-03 03:43:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:43:52,822 INFO L495 AbstractCegarLoop]: Abstraction has 24551 states and 53380 transitions. [2022-11-03 03:43:52,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:43:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24551 states and 53380 transitions. [2022-11-03 03:43:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:43:52,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:43:52,825 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:43:52,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 03:43:53,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 03:43:53,026 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:43:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:43:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2067266257, now seen corresponding path program 7 times [2022-11-03 03:43:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:43:53,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999513876] [2022-11-03 03:43:53,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:43:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:43:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:43:54,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:43:54,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999513876] [2022-11-03 03:43:54,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999513876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:43:54,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003412465] [2022-11-03 03:43:54,252 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:43:54,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:43:54,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:43:54,253 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:43:54,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 03:43:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:43:54,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 03:43:54,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:43:54,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:43:54,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:54,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:43:54,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:54,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:54,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:43:55,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:43:55,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:43:55,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:43:55,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:43:55,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:43:55,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:43:55,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:43:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:43:55,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:06,076 WARN L234 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:44:28,720 WARN L234 SmtUtils]: Spent 13.87s on a formula simplification. DAG size of input: 51 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:44:41,910 WARN L234 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 47 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:44:42,179 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:44:42,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003412465] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:44:42,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [879940525] [2022-11-03 03:44:42,179 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-03 03:44:42,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:44:42,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-11-03 03:44:42,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788928981] [2022-11-03 03:44:42,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:44:42,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 03:44:42,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:44:42,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 03:44:42,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=889, Unknown=5, NotChecked=0, Total=1056 [2022-11-03 03:44:42,182 INFO L87 Difference]: Start difference. First operand 24551 states and 53380 transitions. Second operand has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:44:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:44:46,218 INFO L93 Difference]: Finished difference Result 30909 states and 65947 transitions. [2022-11-03 03:44:46,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-03 03:44:46,218 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:44:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:44:46,271 INFO L225 Difference]: With dead ends: 30909 [2022-11-03 03:44:46,271 INFO L226 Difference]: Without dead ends: 30905 [2022-11-03 03:44:46,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=669, Invalid=2748, Unknown=5, NotChecked=0, Total=3422 [2022-11-03 03:44:46,279 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 912 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 4301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1437 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:44:46,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 448 Invalid, 4301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 2635 Invalid, 0 Unknown, 1437 Unchecked, 2.4s Time] [2022-11-03 03:44:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30905 states. [2022-11-03 03:44:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30905 to 24749. [2022-11-03 03:44:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24749 states, 24736 states have (on average 2.174280401034929) internal successors, (53783), 24748 states have internal predecessors, (53783), 0 states have call successors, (0), 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-03 03:44:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24749 states to 24749 states and 53783 transitions. [2022-11-03 03:44:46,753 INFO L78 Accepts]: Start accepts. Automaton has 24749 states and 53783 transitions. Word has length 45 [2022-11-03 03:44:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:44:46,754 INFO L495 AbstractCegarLoop]: Abstraction has 24749 states and 53783 transitions. [2022-11-03 03:44:46,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.21875) internal successors, (103), 33 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:44:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 24749 states and 53783 transitions. [2022-11-03 03:44:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:44:46,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:44:46,757 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:44:46,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-03 03:44:46,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 03:44:46,975 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:44:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:44:46,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1648383071, now seen corresponding path program 8 times [2022-11-03 03:44:46,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:44:46,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103201498] [2022-11-03 03:44:46,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:44:46,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:44:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:44:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:44:47,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:44:47,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103201498] [2022-11-03 03:44:47,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103201498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:44:47,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840831879] [2022-11-03 03:44:47,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:44:47,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:44:47,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:44:47,982 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:44:47,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 03:44:48,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:44:48,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:44:48,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 03:44:48,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:44:48,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:44:48,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:44:48,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:44:48,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 03:44:48,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:44:48,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:44:48,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:44:48,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:48,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:44:49,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:44:49,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-03 03:44:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:44:53,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:44:59,332 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse5 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse3 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse0 (let ((.cse4 (store |c_#race| |c_~#cache~0.base| (store (store .cse5 .cse3 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (not (= (select .cse1 .cse3) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse6))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse8 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse9 (let ((.cse10 (store |c_#race| |c_~#cache~0.base| (store (store .cse5 .cse8 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (let ((.cse7 (select .cse9 |c_~#cache~0.base|))) (or (not (= (select .cse7 .cse8) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse9 |c_~#cache~0.base| (store .cse7 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse6))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse6) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse13 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse11 (let ((.cse14 (store |c_#race| |c_~#cache~0.base| (store (store .cse5 .cse13 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (let ((.cse12 (select .cse11 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse11 |c_~#cache~0.base| (store .cse12 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (not (= (select .cse12 .cse13) 0))))))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse6) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse17 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse15 (let ((.cse18 (store |c_#race| |c_~#cache~0.base| (store (store .cse5 .cse17 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse18 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse18 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (let ((.cse16 (select .cse15 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse15 |c_~#cache~0.base| (store .cse16 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (not (= (select .cse16 .cse17) 0))))))))))) is different from false [2022-11-03 03:45:01,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse7 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0)))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (select .cse7 |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse0) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse3 (let ((.cse5 (store .cse7 |c_~#cache~0.base| (store (store .cse8 .cse2 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse3 |c_~#cache~0.base|))) (or (not (= (select .cse1 .cse2) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse3 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0))))))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse10 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse11 (let ((.cse12 (store .cse7 |c_~#cache~0.base| (store (store .cse8 .cse10 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse11 |c_~#cache~0.base|))) (or (not (= (select .cse9 .cse10) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse11 |c_~#cache~0.base| (store .cse9 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse0) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse14 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse15 (let ((.cse16 (store .cse7 |c_~#cache~0.base| (store (store .cse8 .cse14 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse13 (select .cse15 |c_~#cache~0.base|))) (or (not (= (select .cse13 .cse14) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse15 |c_~#cache~0.base| (store .cse13 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0))))))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse0) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse19 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse17 (let ((.cse20 (store .cse7 |c_~#cache~0.base| (store (store .cse8 .cse19 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse20 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse20 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse18 (select .cse17 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse17 |c_~#cache~0.base| (store .cse18 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse18 .cse19) 0))))))))))))) is different from false [2022-11-03 03:45:32,055 WARN L234 SmtUtils]: Spent 16.11s on a formula simplification. DAG size of input: 70 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:45:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-11-03 03:45:34,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840831879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:45:34,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [506352363] [2022-11-03 03:45:34,562 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-03 03:45:34,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:45:34,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2022-11-03 03:45:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660572104] [2022-11-03 03:45:34,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:45:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 03:45:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:45:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 03:45:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=948, Unknown=6, NotChecked=130, Total=1260 [2022-11-03 03:45:34,564 INFO L87 Difference]: Start difference. First operand 24749 states and 53783 transitions. Second operand has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:45:37,420 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse8 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 .cse5 0)))) (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse9 (select .cse8 |c_~#cache~0.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse3 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse4 (let ((.cse6 (store .cse8 |c_~#cache~0.base| (store (store .cse9 .cse3 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 0))))) (let ((.cse2 (select .cse4 |c_~#cache~0.base|))) (or (not (= (select .cse2 .cse3) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse4 |c_~#cache~0.base| (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5) 0))))))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= (select .cse0 .cse10) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse12 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse13 (let ((.cse14 (store .cse8 |c_~#cache~0.base| (store (store .cse9 .cse12 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 0))))) (let ((.cse11 (select .cse13 |c_~#cache~0.base|))) (or (not (= (select .cse11 .cse12) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse13 |c_~#cache~0.base| (store .cse11 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse10) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse16 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse17 (let ((.cse18 (store .cse8 |c_~#cache~0.base| (store (store .cse9 .cse16 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse18 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse18 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 0))))) (let ((.cse15 (select .cse17 |c_~#cache~0.base|))) (or (not (= (select .cse15 .cse16) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse17 |c_~#cache~0.base| (store .cse15 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7) 0))))))))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse21 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse19 (let ((.cse22 (store .cse8 |c_~#cache~0.base| (store (store .cse9 .cse21 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 0))))) (let ((.cse20 (select .cse19 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse19 |c_~#cache~0.base| (store .cse20 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse20 .cse21) 0))))))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))))) is different from false [2022-11-03 03:45:39,683 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse7 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (select |c_#race| |c_~#cache~0.base|)) (.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse19 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse4 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse1 (let ((.cse5 (store |c_#race| |c_~#cache~0.base| (store (store .cse6 .cse4 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse1 |c_~#cache~0.base| (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (not (= (select .cse2 .cse4) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse7))) (= |c_~#cache~0.base| 1) (= (select .cse0 .cse8) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse10 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#cache~0.base| (store (store .cse6 .cse10 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (let ((.cse9 (select .cse11 |c_~#cache~0.base|))) (or (not (= (select .cse9 .cse10) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse11 |c_~#cache~0.base| (store .cse9 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse7))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse7) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse15 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse13 (let ((.cse16 (store |c_#race| |c_~#cache~0.base| (store (store .cse6 .cse15 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (let ((.cse14 (select .cse13 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse13 |c_~#cache~0.base| (store .cse14 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse8) 0)) (not (= (select .cse14 .cse15) 0))))))))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse7) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse20 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse17 (let ((.cse21 (store |c_#race| |c_~#cache~0.base| (store (store .cse6 .cse20 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (let ((.cse18 (select .cse17 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse17 |c_~#cache~0.base| (store .cse18 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse19) 0)) (not (= (select .cse18 .cse20) 0))))))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= (select .cse0 .cse19) 0))) is different from false [2022-11-03 03:45:45,462 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse8 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 .cse5 0))) (.cse23 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ .cse23 |c_~#cache~0.offset|)) (.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse9 (select .cse8 |c_~#cache~0.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse3 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse4 (let ((.cse6 (store .cse8 |c_~#cache~0.base| (store (store .cse9 .cse3 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 0))))) (let ((.cse2 (select .cse4 |c_~#cache~0.base|))) (or (not (= (select .cse2 .cse3) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse4 |c_~#cache~0.base| (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5) 0))))))))) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= (select .cse0 .cse10) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse12 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse13 (let ((.cse14 (store .cse8 |c_~#cache~0.base| (store (store .cse9 .cse12 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 0))))) (let ((.cse11 (select .cse13 |c_~#cache~0.base|))) (or (not (= (select .cse11 .cse12) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse13 |c_~#cache~0.base| (store .cse11 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse10) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse16 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse17 (let ((.cse18 (store .cse8 |c_~#cache~0.base| (store (store .cse9 .cse16 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse18 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse18 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 0))))) (let ((.cse15 (select .cse17 |c_~#cache~0.base|))) (or (not (= (select .cse15 .cse16) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse17 |c_~#cache~0.base| (store .cse15 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7) 0))))))))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse21 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse19 (let ((.cse22 (store .cse8 |c_~#cache~0.base| (store (store .cse9 .cse21 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 0))))) (let ((.cse20 (select .cse19 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse19 |c_~#cache~0.base| (store .cse20 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse20 .cse21) 0))))))))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse23))))) is different from false [2022-11-03 03:45:47,796 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse7 (select |c_#race| |c_~#cache~0.base|)) (.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse19 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse5 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse2 (let ((.cse6 (store |c_#race| |c_~#cache~0.base| (store (store .cse7 .cse5 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse3 (select .cse2 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store .cse3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (not (= (select .cse3 .cse5) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1))) (= (select .cse0 .cse8) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse10 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse11 (let ((.cse12 (store |c_#race| |c_~#cache~0.base| (store (store .cse7 .cse10 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse9 (select .cse11 |c_~#cache~0.base|))) (or (not (= (select .cse9 .cse10) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse11 |c_~#cache~0.base| (store .cse9 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse15 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse13 (let ((.cse16 (store |c_#race| |c_~#cache~0.base| (store (store .cse7 .cse15 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse14 (select .cse13 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse13 |c_~#cache~0.base| (store .cse14 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse8) 0)) (not (= (select .cse14 .cse15) 0))))))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse20 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse17 (let ((.cse21 (store |c_#race| |c_~#cache~0.base| (store (store .cse7 .cse20 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse21 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (let ((.cse18 (select .cse17 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse17 |c_~#cache~0.base| (store .cse18 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse19) 0)) (not (= (select .cse18 .cse20) 0))))))))) (= (select .cse0 .cse19) 0))) is different from false [2022-11-03 03:46:41,482 WARN L234 SmtUtils]: Spent 23.73s on a formula simplification. DAG size of input: 71 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:46:43,565 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse7 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))) (.cse21 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse0 (+ .cse21 |c_~#cache~0.offset|)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse8 (select .cse7 |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse0) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse3 (let ((.cse5 (store .cse7 |c_~#cache~0.base| (store (store .cse8 .cse2 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse1 (select .cse3 |c_~#cache~0.base|))) (or (not (= (select .cse1 .cse2) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse3 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0))))))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse10 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse11 (let ((.cse12 (store .cse7 |c_~#cache~0.base| (store (store .cse8 .cse10 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse9 (select .cse11 |c_~#cache~0.base|))) (or (not (= (select .cse9 .cse10) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse11 |c_~#cache~0.base| (store .cse9 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0))))))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse0) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse14 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse15 (let ((.cse16 (store .cse7 |c_~#cache~0.base| (store (store .cse8 .cse14 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse13 (select .cse15 |c_~#cache~0.base|))) (or (not (= (select .cse13 .cse14) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse15 |c_~#cache~0.base| (store .cse13 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0))))))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse0) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse19 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse17 (let ((.cse20 (store .cse7 |c_~#cache~0.base| (store (store .cse8 .cse19 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse20 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse20 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 0))))) (let ((.cse18 (select .cse17 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse17 |c_~#cache~0.base| (store .cse18 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse18 .cse19) 0))))))))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse21))))) is different from false [2022-11-03 03:46:59,099 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (let ((.cse6 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse10 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0))) (.cse17 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ .cse17 |c_~#cache~0.offset|)) (.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse7 (select .cse6 |c_~#cache~0.base|))) (and (or (< .cse0 .cse1) (not (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse3 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse4 (let ((.cse5 (store .cse6 |c_~#cache~0.base| (store (store .cse7 .cse3 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 0))))) (let ((.cse2 (select .cse4 |c_~#cache~0.base|))) (or (not (= (select .cse2 .cse3) 0)) (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse4 |c_~#cache~0.base| (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))))))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse11 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse8 (let ((.cse12 (store .cse6 |c_~#cache~0.base| (store (store .cse7 .cse11 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 0))))) (let ((.cse9 (select .cse8 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= 0 (select (select (store .cse8 |c_~#cache~0.base| (store .cse9 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse10))) (not (= (select .cse9 .cse11) 0))))))))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| .cse1) (forall ((v_ArrVal_3356 Int) (v_ArrVal_3361 Int)) (let ((.cse15 (+ |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| 1))) (let ((.cse13 (let ((.cse16 (store .cse6 |c_~#cache~0.base| (store (store .cse7 .cse15 v_ArrVal_3356) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321|) v_ArrVal_3361)))) (store .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 0))))) (let ((.cse14 (select .cse13 |c_~#cache~0.base|))) (or (forall ((v_ArrVal_3364 Int)) (= (select (select (store .cse13 |c_~#cache~0.base| (store .cse14 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_321| v_ArrVal_3364)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0) 0)) (not (= (select .cse14 .cse15) 0))))))))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse17))))) is different from false [2022-11-03 03:47:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:00,196 INFO L93 Difference]: Finished difference Result 77004 states and 165657 transitions. [2022-11-03 03:47:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-11-03 03:47:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:47:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:00,345 INFO L225 Difference]: With dead ends: 77004 [2022-11-03 03:47:00,345 INFO L226 Difference]: Without dead ends: 77004 [2022-11-03 03:47:00,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 80 SyntacticMatches, 11 SemanticMatches, 79 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 126.3s TimeCoverageRelationStatistics Valid=875, Invalid=4388, Unknown=25, NotChecked=1192, Total=6480 [2022-11-03 03:47:00,347 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 1080 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 3792 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 9206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 3792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5117 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:00,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 802 Invalid, 9206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 3792 Invalid, 0 Unknown, 5117 Unchecked, 4.0s Time] [2022-11-03 03:47:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77004 states. [2022-11-03 03:47:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77004 to 46648. [2022-11-03 03:47:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46648 states, 46635 states have (on average 2.181709016832851) internal successors, (101744), 46647 states have internal predecessors, (101744), 0 states have call successors, (0), 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-03 03:47:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46648 states to 46648 states and 101744 transitions. [2022-11-03 03:47:01,704 INFO L78 Accepts]: Start accepts. Automaton has 46648 states and 101744 transitions. Word has length 45 [2022-11-03 03:47:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:01,704 INFO L495 AbstractCegarLoop]: Abstraction has 46648 states and 101744 transitions. [2022-11-03 03:47:01,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.942857142857143) internal successors, (103), 36 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:47:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 46648 states and 101744 transitions. [2022-11-03 03:47:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:47:01,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:01,709 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:47:01,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-03 03:47:01,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:01,935 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:47:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:01,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1065970195, now seen corresponding path program 9 times [2022-11-03 03:47:01,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:01,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337401514] [2022-11-03 03:47:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:01,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:47:02,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:02,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337401514] [2022-11-03 03:47:02,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337401514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:47:02,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734205710] [2022-11-03 03:47:02,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:47:02,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:02,990 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:47:02,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 03:47:03,463 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:47:03,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:47:03,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 03:47:03,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:47:03,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:47:03,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:03,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:47:03,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:03,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:03,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:47:04,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 03:47:04,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:47:04,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:47:04,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:47:04,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 03:47:04,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:04,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-03 03:47:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:47:08,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:47:13,905 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse3 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#race| |c_~#cache~0.base| (store .cse3 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse4))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse5 (let ((.cse6 (store |c_#race| |c_~#cache~0.base| (store .cse3 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse5 |c_~#cache~0.base| (store (store (select .cse5 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse4))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store .cse3 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse7 |c_~#cache~0.base| (store (store (select .cse7 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse4))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store |c_#race| |c_~#cache~0.base| (store .cse3 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse9 |c_~#cache~0.base| (store (store (select .cse9 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse4))))) is different from false [2022-11-03 03:47:16,172 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse10 0)))) (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse5 (select .cse4 |c_~#cache~0.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse0) (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store .cse4 |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store .cse4 |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse6 |c_~#cache~0.base| (store (store (select .cse6 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse4 |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse8 |c_~#cache~0.base| (store (store (select .cse8 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse10) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse0))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse4 |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse11 |c_~#cache~0.base| (store (store (select .cse11 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse0))))))) is different from false [2022-11-03 03:47:18,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse8 0) .cse13 0)))) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (select .cse3 |c_~#cache~0.base|)) (.cse5 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store .cse3 |c_~#cache~0.base| (store .cse4 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse5))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse6 (let ((.cse7 (store .cse3 |c_~#cache~0.base| (store .cse4 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse6 |c_~#cache~0.base| (store (store (select .cse6 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse8) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse5))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse9 (let ((.cse10 (store .cse3 |c_~#cache~0.base| (store .cse4 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse9 |c_~#cache~0.base| (store (store (select .cse9 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse5))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse11 (let ((.cse12 (store .cse3 |c_~#cache~0.base| (store .cse4 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 0))))) (store .cse11 |c_~#cache~0.base| (store (store (select .cse11 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse13) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse5))))))) is different from false [2022-11-03 03:47:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2022-11-03 03:47:19,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734205710] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:47:19,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [598595696] [2022-11-03 03:47:19,021 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-03 03:47:19,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:47:19,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 34 [2022-11-03 03:47:19,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418235048] [2022-11-03 03:47:19,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:47:19,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:47:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:47:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:47:19,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=838, Unknown=4, NotChecked=186, Total=1190 [2022-11-03 03:47:19,026 INFO L87 Difference]: Start difference. First operand 46648 states and 101744 transitions. Second operand has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:47:21,436 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse9 0) .cse14 0)))) (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse5 (select .cse4 |c_~#cache~0.base|)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store .cse4 |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse6))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store .cse4 |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse7 |c_~#cache~0.base| (store (store (select .cse7 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse6))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse4 |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse10 |c_~#cache~0.base| (store (store (select .cse10 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse6))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse4 |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse12 |c_~#cache~0.base| (store (store (select .cse12 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse14) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse6))) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))))) is different from false [2022-11-03 03:47:23,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 .cse12 0)))) (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (select .cse5 |c_~#cache~0.base|)) (.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1) (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= (select .cse0 .cse7) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse8 |c_~#cache~0.base| (store (store (select .cse8 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse10 |c_~#cache~0.base| (store (store (select .cse10 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse13 |c_~#cache~0.base| (store (store (select .cse13 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|))))) is different from false [2022-11-03 03:47:26,007 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse4 (select |c_#race| |c_~#cache~0.base|)) (.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#race| |c_~#cache~0.base| (store .cse4 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse6))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store .cse4 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse7 |c_~#cache~0.base| (store (store (select .cse7 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse6))) (= |c_~#cache~0.base| 1) (= (select .cse0 .cse9) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_~#cache~0.base| (store .cse4 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse10 |c_~#cache~0.base| (store (store (select .cse10 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse6))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store |c_#race| |c_~#cache~0.base| (store .cse4 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 0))))) (store .cse12 |c_~#cache~0.base| (store (store (select .cse12 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse6))) (= (select .cse0 .cse5) 0))) is different from false [2022-11-03 03:47:28,810 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse15 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse9 0) .cse14 0)))) (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (select .cse5 |c_~#cache~0.base|)) (.cse1 (+ .cse15 |c_~#cache~0.offset|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse7 |c_~#cache~0.base| (store (store (select .cse7 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse10 |c_~#cache~0.base| (store (store (select .cse10 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse12 |c_~#cache~0.base| (store (store (select .cse12 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse14) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse15))))) is different from false [2022-11-03 03:47:31,015 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 .cse12 0)))) (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (select .cse5 |c_~#cache~0.base|)) (.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1) (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (select .cse0 .cse7) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse8 (let ((.cse9 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse8 |c_~#cache~0.base| (store (store (select .cse8 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse10 |c_~#cache~0.base| (store (store (select .cse10 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse14 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse13 |c_~#cache~0.base| (store (store (select .cse13 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))))))) is different from false [2022-11-03 03:47:33,168 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#race| |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#race| |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse7 |c_~#cache~0.base| (store (store (select .cse7 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (= (select .cse0 .cse9) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store |c_#race| |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse10 |c_~#cache~0.base| (store (store (select .cse10 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store |c_#race| |c_~#cache~0.base| (store .cse5 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse12 |c_~#cache~0.base| (store (store (select .cse12 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (= (select .cse0 .cse6) 0))) is different from false [2022-11-03 03:47:35,850 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse15 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse9 0) .cse14 0)))) (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (select .cse5 |c_~#cache~0.base|)) (.cse1 (+ .cse15 |c_~#cache~0.offset|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse7 |c_~#cache~0.base| (store (store (select .cse7 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse10 |c_~#cache~0.base| (store (store (select .cse10 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse12 |c_~#cache~0.base| (store (store (select .cse12 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse14) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse15))))) is different from false [2022-11-03 03:47:40,495 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (let ((.cse15 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse5 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store .cse0 .cse9 0) .cse14 0)))) (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse6 (select .cse5 |c_~#cache~0.base|)) (.cse1 (+ .cse15 |c_~#cache~0.offset|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse2 (let ((.cse3 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse7 (let ((.cse8 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse7 |c_~#cache~0.base| (store (store (select .cse7 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse10 (let ((.cse11 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse10 |c_~#cache~0.base| (store (store (select .cse10 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| Int)) (or (forall ((v_ArrVal_3524 Int) (v_ArrVal_3519 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store .cse5 |c_~#cache~0.base| (store .cse6 (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) v_ArrVal_3519)))) (store .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 0))))) (store .cse12 |c_~#cache~0.base| (store (store (select .cse12 |c_~#cache~0.base|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323|) 0) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| v_ArrVal_3524))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse14) 0)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_323| .cse1))) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse15))))) is different from false [2022-11-03 03:47:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:47:40,879 INFO L93 Difference]: Finished difference Result 70258 states and 151880 transitions. [2022-11-03 03:47:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-03 03:47:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:47:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:47:41,022 INFO L225 Difference]: With dead ends: 70258 [2022-11-03 03:47:41,022 INFO L226 Difference]: Without dead ends: 70258 [2022-11-03 03:47:41,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=295, Invalid=1542, Unknown=13, NotChecked=1012, Total=2862 [2022-11-03 03:47:41,023 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 679 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 4364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2619 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:47:41,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 718 Invalid, 4364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1690 Invalid, 0 Unknown, 2619 Unchecked, 1.7s Time] [2022-11-03 03:47:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70258 states. [2022-11-03 03:47:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70258 to 46711. [2022-11-03 03:47:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46711 states, 46698 states have (on average 2.1817850871557667) internal successors, (101885), 46710 states have internal predecessors, (101885), 0 states have call successors, (0), 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-03 03:47:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46711 states to 46711 states and 101885 transitions. [2022-11-03 03:47:42,335 INFO L78 Accepts]: Start accepts. Automaton has 46711 states and 101885 transitions. Word has length 45 [2022-11-03 03:47:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:47:42,336 INFO L495 AbstractCegarLoop]: Abstraction has 46711 states and 101885 transitions. [2022-11-03 03:47:42,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0294117647058822) internal successors, (103), 35 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:47:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46711 states and 101885 transitions. [2022-11-03 03:47:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:47:42,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:47:42,339 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 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] [2022-11-03 03:47:42,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 03:47:42,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-03 03:47:42,547 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:47:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:47:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1076204497, now seen corresponding path program 3 times [2022-11-03 03:47:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:47:42,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099988643] [2022-11-03 03:47:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:47:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:47:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:47:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:47:43,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:47:43,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099988643] [2022-11-03 03:47:43,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099988643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:47:43,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734709531] [2022-11-03 03:47:43,296 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:47:43,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:47:43,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:43,298 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:47:43,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 03:47:43,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:47:43,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:47:43,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 03:47:43,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:47:44,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:47:44,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:47:44,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:47:44,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:47:44,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:47:44,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:47:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:47:44,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:47:55,231 WARN L234 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:48:05,414 WARN L234 SmtUtils]: Spent 9.88s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:48:26,821 WARN L234 SmtUtils]: Spent 18.50s on a formula simplification. DAG size of input: 48 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:48:40,743 WARN L234 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 44 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:48:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:48:43,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734709531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:48:43,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1549608204] [2022-11-03 03:48:43,134 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-03 03:48:43,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:48:43,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 03:48:43,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062494228] [2022-11-03 03:48:43,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:48:43,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:48:43,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:48:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:48:43,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=806, Unknown=6, NotChecked=0, Total=992 [2022-11-03 03:48:43,139 INFO L87 Difference]: Start difference. First operand 46711 states and 101885 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:48:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:48:49,774 INFO L93 Difference]: Finished difference Result 55367 states and 119481 transitions. [2022-11-03 03:48:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 03:48:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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 45 [2022-11-03 03:48:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:48:49,906 INFO L225 Difference]: With dead ends: 55367 [2022-11-03 03:48:49,906 INFO L226 Difference]: Without dead ends: 55362 [2022-11-03 03:48:49,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 61.8s TimeCoverageRelationStatistics Valid=628, Invalid=2445, Unknown=7, NotChecked=0, Total=3080 [2022-11-03 03:48:49,907 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 841 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 3044 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 4871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 3044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1619 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:48:49,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 484 Invalid, 4871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 3044 Invalid, 0 Unknown, 1619 Unchecked, 3.2s Time] [2022-11-03 03:48:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55362 states. [2022-11-03 03:48:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55362 to 46607. [2022-11-03 03:48:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46607 states, 46594 states have (on average 2.1817186762244067) internal successors, (101655), 46606 states have internal predecessors, (101655), 0 states have call successors, (0), 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-03 03:48:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46607 states to 46607 states and 101655 transitions. [2022-11-03 03:48:51,076 INFO L78 Accepts]: Start accepts. Automaton has 46607 states and 101655 transitions. Word has length 45 [2022-11-03 03:48:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:48:51,077 INFO L495 AbstractCegarLoop]: Abstraction has 46607 states and 101655 transitions. [2022-11-03 03:48:51,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:48:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 46607 states and 101655 transitions. [2022-11-03 03:48:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 03:48:51,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:48:51,080 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 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] [2022-11-03 03:48:51,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 03:48:51,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:51,281 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-03 03:48:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:48:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1002918637, now seen corresponding path program 4 times [2022-11-03 03:48:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:48:51,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089726125] [2022-11-03 03:48:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:48:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:48:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:51,848 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:48:51,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:48:51,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089726125] [2022-11-03 03:48:51,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089726125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:48:51,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135065873] [2022-11-03 03:48:51,849 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:48:51,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:48:51,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:48:51,850 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:48:51,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4794c0db-8de5-4665-950f-2c3a56637ec0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 03:48:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:48:52,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 03:48:52,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:48:52,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:48:52,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:52,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 03:48:52,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:52,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:52,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 03:48:52,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:52,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:52,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:52,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 03:48:53,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:53,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:53,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:53,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:53,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:53,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:53,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:48:53,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-03 03:48:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:48:53,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:49:09,941 WARN L234 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:49:40,116 WARN L234 SmtUtils]: Spent 19.74s on a formula simplification. DAG size of input: 48 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:49:42,162 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))))))) is different from false [2022-11-03 03:49:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-03 03:49:42,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135065873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:49:42,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [424646588] [2022-11-03 03:49:42,407 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-03 03:49:42,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:49:42,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-03 03:49:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022173917] [2022-11-03 03:49:42,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:49:42,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:49:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:49:42,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:49:42,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=775, Unknown=9, NotChecked=58, Total=992 [2022-11-03 03:49:42,409 INFO L87 Difference]: Start difference. First operand 46607 states and 101655 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 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-03 03:49:46,208 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store .cse5 .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (= (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))))))) is different from false [2022-11-03 03:49:51,724 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ .cse5 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (<= 0 |c_ULTIMATE.start_main_~i~2#1|) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse5) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))))))) is different from false [2022-11-03 03:49:53,857 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse5 (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))))) is different from false [2022-11-03 03:49:57,056 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse2))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse2))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse2))))))) is different from false [2022-11-03 03:49:59,100 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse2))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse2))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse2))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse2))))))) is different from false [2022-11-03 03:50:35,098 WARN L234 SmtUtils]: Spent 15.90s on a formula simplification. DAG size of input: 48 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 03:50:37,119 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ .cse5 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))) (< 0 (+ |c_ULTIMATE.start_main_~i~2#1| 1)) (< (+ 3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) .cse5) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| Int)) (or (forall ((v_ArrVal_3829 Int)) (= (select (select (store .cse0 |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| v_ArrVal_3829)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_327| .cse3))))))) is different from false [2022-11-03 03:51:08,438 WARN L234 SmtUtils]: Spent 10.11s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)