./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/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_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 02:18:19,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:18:19,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:18:19,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:18:19,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:18:19,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:18:19,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:18:19,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:18:19,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:18:19,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:18:19,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:18:19,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:18:19,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:18:19,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:18:19,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:18:19,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:18:19,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:18:19,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:18:19,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:18:19,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:18:19,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:18:19,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:18:19,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:18:19,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:18:19,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:18:19,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:18:19,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:18:19,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:18:19,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:18:19,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:18:19,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:18:19,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:18:19,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:18:19,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:18:19,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:18:19,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:18:19,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:18:19,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:18:19,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:18:19,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:18:19,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:18:19,938 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-22 02:18:19,965 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:18:19,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:18:19,966 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:18:19,966 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:18:19,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:18:19,967 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:18:19,967 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:18:19,967 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:18:19,968 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:18:19,968 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:18:19,968 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:18:19,968 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:18:19,968 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:18:19,969 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:18:19,969 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:18:19,969 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:18:19,969 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:18:19,969 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:18:19,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:18:19,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:18:19,970 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:18:19,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:18:19,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:18:19,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:18:19,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:18:19,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:18:19,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:18:19,972 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-22 02:18:19,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:18:19,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:18:19,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:18:19,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:18:19,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:18:19,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:18:19,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:18:19,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:18:19,974 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:18:19,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:18:19,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:18:19,974 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:18:19,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:18:19,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:18:19,975 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:18:19,975 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_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/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_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba 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-22 02:18:20,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:18:20,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:18:20,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:18:20,283 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:18:20,283 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:18:20,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-11-22 02:18:23,338 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:18:23,606 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:18:23,607 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/sv-benchmarks/c/goblint-regression/06-symbeq_03-funloop_simple.i [2022-11-22 02:18:23,625 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/data/a0a9005e8/28cf9fb5eba04e6599eec351810d6547/FLAG55ec71288 [2022-11-22 02:18:23,640 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/data/a0a9005e8/28cf9fb5eba04e6599eec351810d6547 [2022-11-22 02:18:23,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:18:23,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:18:23,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:18:23,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:18:23,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:18:23,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:18:23" (1/1) ... [2022-11-22 02:18:23,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6a468b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:23, skipping insertion in model container [2022-11-22 02:18:23,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:18:23" (1/1) ... [2022-11-22 02:18:23,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:18:23,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:18:24,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:18:24,282 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:18:24,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:18:24,428 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:18:24,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24 WrapperNode [2022-11-22 02:18:24,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:18:24,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:18:24,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:18:24,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:18:24,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,521 INFO L138 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-11-22 02:18:24,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:18:24,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:18:24,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:18:24,525 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:18:24,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,586 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:18:24,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:18:24,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:18:24,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:18:24,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (1/1) ... [2022-11-22 02:18:24,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:18:24,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:24,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:18:24,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:18:24,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 02:18:24,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:18:24,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:18:24,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:18:24,681 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 02:18:24,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:18:24,682 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-22 02:18:24,682 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-22 02:18:24,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:18:24,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:18:24,684 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 02:18:24,818 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:18:24,820 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:18:25,140 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:18:25,147 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:18:25,147 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-22 02:18:25,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:18:25 BoogieIcfgContainer [2022-11-22 02:18:25,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:18:25,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:18:25,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:18:25,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:18:25,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:18:23" (1/3) ... [2022-11-22 02:18:25,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6782c3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:18:25, skipping insertion in model container [2022-11-22 02:18:25,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:18:24" (2/3) ... [2022-11-22 02:18:25,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6782c3f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:18:25, skipping insertion in model container [2022-11-22 02:18:25,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:18:25" (3/3) ... [2022-11-22 02:18:25,169 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-11-22 02:18:25,177 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 02:18:25,190 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:18:25,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-22 02:18:25,190 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 02:18:25,313 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 02:18:25,367 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 02:18:25,394 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 125 transitions, 255 flow [2022-11-22 02:18:25,397 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 125 transitions, 255 flow [2022-11-22 02:18:25,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 125 transitions, 255 flow [2022-11-22 02:18:25,493 INFO L130 PetriNetUnfolder]: 6/124 cut-off events. [2022-11-22 02:18:25,493 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 02:18:25,500 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 217 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-22 02:18:25,511 INFO L119 LiptonReduction]: Number of co-enabled transitions 4636 [2022-11-22 02:18:28,167 INFO L134 LiptonReduction]: Checked pairs total: 13790 [2022-11-22 02:18:28,168 INFO L136 LiptonReduction]: Total number of compositions: 74 [2022-11-22 02:18:28,177 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 54 transitions, 113 flow [2022-11-22 02:18:28,247 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-22 02:18:28,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:18:28,273 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;@686d26ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:18:28,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-22 02:18:28,277 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-22 02:18:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:18:28,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:28,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:28,284 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-22 02:18:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:28,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1497299248, now seen corresponding path program 1 times [2022-11-22 02:18:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:28,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623841418] [2022-11-22 02:18:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:28,642 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-22 02:18:28,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:28,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623841418] [2022-11-22 02:18:28,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623841418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:28,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:28,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:18:28,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793247621] [2022-11-22 02:18:28,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:28,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:18:28,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:28,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:18:28,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:18:28,677 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-22 02:18:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:28,795 INFO L93 Difference]: Finished difference Result 561 states and 1119 transitions. [2022-11-22 02:18:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:18:28,798 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-22 02:18:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:28,823 INFO L225 Difference]: With dead ends: 561 [2022-11-22 02:18:28,824 INFO L226 Difference]: Without dead ends: 561 [2022-11-22 02:18:28,825 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-22 02:18:28,830 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:28,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:18:28,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-11-22 02:18:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2022-11-22 02:18:28,925 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-22 02:18:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1119 transitions. [2022-11-22 02:18:28,929 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1119 transitions. Word has length 10 [2022-11-22 02:18:28,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:28,930 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 1119 transitions. [2022-11-22 02:18:28,930 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-22 02:18:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1119 transitions. [2022-11-22 02:18:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:18:28,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:28,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:28,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:18:28,933 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-22 02:18:28,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1434811041, now seen corresponding path program 1 times [2022-11-22 02:18:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:28,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117102170] [2022-11-22 02:18:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:29,062 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-22 02:18:29,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:29,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117102170] [2022-11-22 02:18:29,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117102170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:29,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886586392] [2022-11-22 02:18:29,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:29,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:29,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:29,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:29,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:18:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:29,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 02:18:29,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:29,175 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-22 02:18:29,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:18:29,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886586392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:29,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:18:29,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-11-22 02:18:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222472032] [2022-11-22 02:18:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:29,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:18:29,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:29,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:18:29,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:18:29,179 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-22 02:18:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:29,243 INFO L93 Difference]: Finished difference Result 849 states and 1695 transitions. [2022-11-22 02:18:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:18:29,244 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-22 02:18:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:29,247 INFO L225 Difference]: With dead ends: 849 [2022-11-22 02:18:29,248 INFO L226 Difference]: Without dead ends: 849 [2022-11-22 02:18:29,248 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-22 02:18:29,249 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:29,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:18:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-11-22 02:18:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 579. [2022-11-22 02:18:29,266 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-22 02:18:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1155 transitions. [2022-11-22 02:18:29,268 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1155 transitions. Word has length 11 [2022-11-22 02:18:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:29,269 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 1155 transitions. [2022-11-22 02:18:29,269 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-22 02:18:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1155 transitions. [2022-11-22 02:18:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:18:29,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:29,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:29,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:29,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:29,476 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-22 02:18:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:29,477 INFO L85 PathProgramCache]: Analyzing trace with hash -146833731, now seen corresponding path program 1 times [2022-11-22 02:18:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:29,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249908173] [2022-11-22 02:18:29,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:29,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:29,542 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-22 02:18:29,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:29,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249908173] [2022-11-22 02:18:29,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249908173] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:29,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620075581] [2022-11-22 02:18:29,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:29,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:29,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:29,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:29,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:18:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:29,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:18:29,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:29,708 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-22 02:18:29,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:29,726 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-22 02:18:29,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620075581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:29,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1729873168] [2022-11-22 02:18:29,734 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-22 02:18:29,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:29,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-22 02:18:29,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137840515] [2022-11-22 02:18:29,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:18:29,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:18:29,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:29,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:18:29,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:18:29,753 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-22 02:18:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:29,827 INFO L93 Difference]: Finished difference Result 582 states and 1158 transitions. [2022-11-22 02:18:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:18:29,828 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-22 02:18:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:29,832 INFO L225 Difference]: With dead ends: 582 [2022-11-22 02:18:29,832 INFO L226 Difference]: Without dead ends: 582 [2022-11-22 02:18:29,832 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-22 02:18:29,836 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:29,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:18:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-22 02:18:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2022-11-22 02:18:29,858 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-22 02:18:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1158 transitions. [2022-11-22 02:18:29,861 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1158 transitions. Word has length 12 [2022-11-22 02:18:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:29,861 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1158 transitions. [2022-11-22 02:18:29,861 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-22 02:18:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1158 transitions. [2022-11-22 02:18:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:18:29,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:29,862 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:29,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 02:18:30,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:30,067 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-22 02:18:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash -74258100, now seen corresponding path program 2 times [2022-11-22 02:18:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:30,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545311581] [2022-11-22 02:18:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:30,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:30,266 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-22 02:18:30,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:30,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545311581] [2022-11-22 02:18:30,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545311581] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:30,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140536899] [2022-11-22 02:18:30,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:18:30,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:30,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:30,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:30,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:18:30,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:18:30,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:18:30,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-22 02:18:30,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:30,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:30,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:30,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:18:30,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:30,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:30,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:18:30,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:18:30,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:30,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:30,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:30,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:18:30,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:18:30,660 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-22 02:18:30,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:18:30,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140536899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:30,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:18:30,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 13 [2022-11-22 02:18:30,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300032070] [2022-11-22 02:18:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:30,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:18:30,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:30,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:18:30,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-22 02:18:30,666 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-22 02:18:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:31,334 INFO L93 Difference]: Finished difference Result 1222 states and 2438 transitions. [2022-11-22 02:18:31,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:18:31,335 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-22 02:18:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:31,340 INFO L225 Difference]: With dead ends: 1222 [2022-11-22 02:18:31,340 INFO L226 Difference]: Without dead ends: 1222 [2022-11-22 02:18:31,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-22 02:18:31,341 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 212 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:31,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 80 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:18:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-11-22 02:18:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 690. [2022-11-22 02:18:31,362 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-22 02:18:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1374 transitions. [2022-11-22 02:18:31,365 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1374 transitions. Word has length 15 [2022-11-22 02:18:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:31,365 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1374 transitions. [2022-11-22 02:18:31,365 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-22 02:18:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1374 transitions. [2022-11-22 02:18:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:18:31,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:31,366 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:31,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:31,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-11-22 02:18:31,572 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-22 02:18:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash 46789062, now seen corresponding path program 1 times [2022-11-22 02:18:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:31,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060507813] [2022-11-22 02:18:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:31,790 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-22 02:18:31,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:31,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060507813] [2022-11-22 02:18:31,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060507813] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:31,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292052660] [2022-11-22 02:18:31,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:31,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:31,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:31,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:31,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:18:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:31,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:18:31,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:31,939 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-22 02:18:31,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:32,002 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-22 02:18:32,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292052660] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:32,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [403706096] [2022-11-22 02:18:32,007 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-22 02:18:32,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:32,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-22 02:18:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241648313] [2022-11-22 02:18:32,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:18:32,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:18:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:18:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:18:32,009 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-22 02:18:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:32,082 INFO L93 Difference]: Finished difference Result 696 states and 1380 transitions. [2022-11-22 02:18:32,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 02:18:32,082 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-22 02:18:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:32,085 INFO L225 Difference]: With dead ends: 696 [2022-11-22 02:18:32,085 INFO L226 Difference]: Without dead ends: 696 [2022-11-22 02:18:32,086 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-22 02:18:32,086 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:32,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:18:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-22 02:18:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2022-11-22 02:18:32,107 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-22 02:18:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1380 transitions. [2022-11-22 02:18:32,110 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1380 transitions. Word has length 15 [2022-11-22 02:18:32,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:32,111 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 1380 transitions. [2022-11-22 02:18:32,111 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-22 02:18:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1380 transitions. [2022-11-22 02:18:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:18:32,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:32,113 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:18:32,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:32,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:32,319 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-22 02:18:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:32,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2059514842, now seen corresponding path program 2 times [2022-11-22 02:18:32,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:32,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095097525] [2022-11-22 02:18:32,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:32,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:32,730 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-22 02:18:32,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:32,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095097525] [2022-11-22 02:18:32,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095097525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:32,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:32,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:18:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271993522] [2022-11-22 02:18:32,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:32,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:18:32,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:18:32,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:18:32,732 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-22 02:18:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:33,096 INFO L93 Difference]: Finished difference Result 868 states and 1724 transitions. [2022-11-22 02:18:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:18:33,100 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-22 02:18:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:33,104 INFO L225 Difference]: With dead ends: 868 [2022-11-22 02:18:33,104 INFO L226 Difference]: Without dead ends: 868 [2022-11-22 02:18:33,104 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-22 02:18:33,105 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 66 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:33,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 35 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:18:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-11-22 02:18:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 808. [2022-11-22 02:18:33,123 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-22 02:18:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1604 transitions. [2022-11-22 02:18:33,126 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1604 transitions. Word has length 21 [2022-11-22 02:18:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:33,127 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1604 transitions. [2022-11-22 02:18:33,127 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-22 02:18:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1604 transitions. [2022-11-22 02:18:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-22 02:18:33,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:33,128 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-22 02:18:33,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:18:33,128 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-22 02:18:33,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:33,129 INFO L85 PathProgramCache]: Analyzing trace with hash -783456550, now seen corresponding path program 1 times [2022-11-22 02:18:33,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:33,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005675436] [2022-11-22 02:18:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:33,476 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-22 02:18:33,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:33,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005675436] [2022-11-22 02:18:33,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005675436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:33,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:33,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:18:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834727041] [2022-11-22 02:18:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:33,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:18:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:33,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:18:33,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:18:33,478 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-22 02:18:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:33,737 INFO L93 Difference]: Finished difference Result 894 states and 1776 transitions. [2022-11-22 02:18:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:18:33,737 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-22 02:18:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:33,741 INFO L225 Difference]: With dead ends: 894 [2022-11-22 02:18:33,741 INFO L226 Difference]: Without dead ends: 894 [2022-11-22 02:18:33,741 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-22 02:18:33,742 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:33,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 27 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:18:33,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-11-22 02:18:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 874. [2022-11-22 02:18:33,761 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-22 02:18:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1736 transitions. [2022-11-22 02:18:33,765 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1736 transitions. Word has length 27 [2022-11-22 02:18:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:33,765 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 1736 transitions. [2022-11-22 02:18:33,765 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-22 02:18:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1736 transitions. [2022-11-22 02:18:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-22 02:18:33,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:33,766 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-22 02:18:33,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:18:33,767 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-22 02:18:33,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash -566765859, now seen corresponding path program 1 times [2022-11-22 02:18:33,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:33,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808381389] [2022-11-22 02:18:33,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:33,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:34,124 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-22 02:18:34,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:34,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808381389] [2022-11-22 02:18:34,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808381389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:34,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:34,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:18:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530646324] [2022-11-22 02:18:34,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:34,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:18:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:34,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:18:34,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:18:34,127 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-22 02:18:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:34,692 INFO L93 Difference]: Finished difference Result 1026 states and 2040 transitions. [2022-11-22 02:18:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:18:34,692 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-22 02:18:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:34,697 INFO L225 Difference]: With dead ends: 1026 [2022-11-22 02:18:34,697 INFO L226 Difference]: Without dead ends: 1010 [2022-11-22 02:18:34,698 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-22 02:18:34,698 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 61 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:34,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 38 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:18:34,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-11-22 02:18:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 974. [2022-11-22 02:18:34,720 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-22 02:18:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1934 transitions. [2022-11-22 02:18:34,724 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1934 transitions. Word has length 27 [2022-11-22 02:18:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:34,725 INFO L495 AbstractCegarLoop]: Abstraction has 974 states and 1934 transitions. [2022-11-22 02:18:34,725 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-22 02:18:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1934 transitions. [2022-11-22 02:18:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 02:18:34,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:34,726 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-22 02:18:34,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:18:34,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:18:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash -263099645, now seen corresponding path program 1 times [2022-11-22 02:18:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:34,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257387862] [2022-11-22 02:18:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:35,238 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-22 02:18:35,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:35,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257387862] [2022-11-22 02:18:35,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257387862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:35,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485136613] [2022-11-22 02:18:35,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:35,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:35,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:35,242 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:35,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:18:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:35,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 02:18:35,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:35,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:18:35,490 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-22 02:18:35,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:18:35,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485136613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:35,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:18:35,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-22 02:18:35,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978777915] [2022-11-22 02:18:35,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:35,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:18:35,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:35,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:18:35,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:18:35,507 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-22 02:18:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:35,682 INFO L93 Difference]: Finished difference Result 1728 states and 3429 transitions. [2022-11-22 02:18:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:18:35,682 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-22 02:18:35,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:35,693 INFO L225 Difference]: With dead ends: 1728 [2022-11-22 02:18:35,693 INFO L226 Difference]: Without dead ends: 1728 [2022-11-22 02:18:35,694 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-22 02:18:35,695 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 143 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:35,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 139 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:18:35,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2022-11-22 02:18:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 994. [2022-11-22 02:18:35,734 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-22 02:18:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1961 transitions. [2022-11-22 02:18:35,737 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1961 transitions. Word has length 31 [2022-11-22 02:18:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:35,738 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1961 transitions. [2022-11-22 02:18:35,738 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-22 02:18:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1961 transitions. [2022-11-22 02:18:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 02:18:35,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:35,742 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-22 02:18:35,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:35,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:35,949 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:18:35,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:35,949 INFO L85 PathProgramCache]: Analyzing trace with hash 142174673, now seen corresponding path program 2 times [2022-11-22 02:18:35,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:35,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839986776] [2022-11-22 02:18:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:36,648 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-22 02:18:36,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:36,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839986776] [2022-11-22 02:18:36,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839986776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:36,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836065753] [2022-11-22 02:18:36,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:18:36,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:36,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:36,651 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:36,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:18:36,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:18:36,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:18:36,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 02:18:36,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:36,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:18:36,872 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-22 02:18:36,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:18:36,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836065753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:36,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:18:36,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-22 02:18:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581085260] [2022-11-22 02:18:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:36,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:18:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:18:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:18:36,876 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-22 02:18:37,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:37,036 INFO L93 Difference]: Finished difference Result 1376 states and 2699 transitions. [2022-11-22 02:18:37,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:18:37,037 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-22 02:18:37,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:37,042 INFO L225 Difference]: With dead ends: 1376 [2022-11-22 02:18:37,042 INFO L226 Difference]: Without dead ends: 1376 [2022-11-22 02:18:37,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:18:37,043 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 164 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:37,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 120 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:18:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2022-11-22 02:18:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1008. [2022-11-22 02:18:37,069 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-22 02:18:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1976 transitions. [2022-11-22 02:18:37,073 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1976 transitions. Word has length 31 [2022-11-22 02:18:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:37,073 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1976 transitions. [2022-11-22 02:18:37,073 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-22 02:18:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1976 transitions. [2022-11-22 02:18:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 02:18:37,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:37,075 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-22 02:18:37,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:37,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 02:18:37,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:18:37,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:37,281 INFO L85 PathProgramCache]: Analyzing trace with hash 869369507, now seen corresponding path program 3 times [2022-11-22 02:18:37,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:37,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741627767] [2022-11-22 02:18:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:37,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:37,661 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-22 02:18:37,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:37,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741627767] [2022-11-22 02:18:37,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741627767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:37,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001397117] [2022-11-22 02:18:37,662 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:18:37,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:37,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:37,664 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:37,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:18:37,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:18:37,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:18:37,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 02:18:37,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:37,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:18:37,929 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-22 02:18:37,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:18:37,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001397117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:37,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:18:37,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-22 02:18:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083495390] [2022-11-22 02:18:37,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:37,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:18:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:37,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:18:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:18:37,933 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-22 02:18:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:38,165 INFO L93 Difference]: Finished difference Result 2417 states and 4754 transitions. [2022-11-22 02:18:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:18:38,166 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-22 02:18:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:38,176 INFO L225 Difference]: With dead ends: 2417 [2022-11-22 02:18:38,176 INFO L226 Difference]: Without dead ends: 2417 [2022-11-22 02:18:38,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:18:38,177 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 177 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:38,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 144 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:18:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-11-22 02:18:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1050. [2022-11-22 02:18:38,219 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-22 02:18:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2060 transitions. [2022-11-22 02:18:38,224 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 2060 transitions. Word has length 31 [2022-11-22 02:18:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:38,224 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 2060 transitions. [2022-11-22 02:18:38,224 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-22 02:18:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 2060 transitions. [2022-11-22 02:18:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 02:18:38,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:38,227 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-22 02:18:38,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:38,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:38,439 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:18:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1901439507, now seen corresponding path program 1 times [2022-11-22 02:18:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:38,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385136050] [2022-11-22 02:18:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:38,520 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-22 02:18:38,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:38,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385136050] [2022-11-22 02:18:38,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385136050] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:38,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582652356] [2022-11-22 02:18:38,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:38,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:38,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:38,523 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:38,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:18:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:38,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:18:38,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:38,695 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-22 02:18:38,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:38,728 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-22 02:18:38,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582652356] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:38,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [282404999] [2022-11-22 02:18:38,730 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-22 02:18:38,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:38,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-22 02:18:38,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290895583] [2022-11-22 02:18:38,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:18:38,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:18:38,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:38,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:18:38,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:18:38,734 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-22 02:18:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:38,874 INFO L93 Difference]: Finished difference Result 2424 states and 4808 transitions. [2022-11-22 02:18:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:18:38,875 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-22 02:18:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:38,886 INFO L225 Difference]: With dead ends: 2424 [2022-11-22 02:18:38,886 INFO L226 Difference]: Without dead ends: 2424 [2022-11-22 02:18:38,887 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-22 02:18:38,887 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 254 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:38,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 122 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:18:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2022-11-22 02:18:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2275. [2022-11-22 02:18:38,965 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-22 02:18:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 4659 transitions. [2022-11-22 02:18:38,976 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 4659 transitions. Word has length 34 [2022-11-22 02:18:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:38,976 INFO L495 AbstractCegarLoop]: Abstraction has 2275 states and 4659 transitions. [2022-11-22 02:18:38,976 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-22 02:18:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 4659 transitions. [2022-11-22 02:18:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:18:38,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:38,978 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-22 02:18:38,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:39,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 02:18:39,183 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:18:39,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash 197718153, now seen corresponding path program 1 times [2022-11-22 02:18:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:39,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249747055] [2022-11-22 02:18:39,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:39,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:39,487 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-22 02:18:39,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:39,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249747055] [2022-11-22 02:18:39,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249747055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:18:39,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:18:39,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:18:39,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828934691] [2022-11-22 02:18:39,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:18:39,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:18:39,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:39,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:18:39,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:18:39,489 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-22 02:18:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:39,810 INFO L93 Difference]: Finished difference Result 2609 states and 5313 transitions. [2022-11-22 02:18:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:18:39,810 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-22 02:18:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:39,821 INFO L225 Difference]: With dead ends: 2609 [2022-11-22 02:18:39,821 INFO L226 Difference]: Without dead ends: 2609 [2022-11-22 02:18:39,822 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-22 02:18:39,822 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:39,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 27 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:18:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-11-22 02:18:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2457. [2022-11-22 02:18:39,915 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-22 02:18:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 5009 transitions. [2022-11-22 02:18:39,924 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 5009 transitions. Word has length 35 [2022-11-22 02:18:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:39,924 INFO L495 AbstractCegarLoop]: Abstraction has 2457 states and 5009 transitions. [2022-11-22 02:18:39,924 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-22 02:18:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 5009 transitions. [2022-11-22 02:18:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:18:39,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:39,926 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-22 02:18:39,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 02:18:39,926 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-22 02:18:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:39,927 INFO L85 PathProgramCache]: Analyzing trace with hash -363049338, now seen corresponding path program 1 times [2022-11-22 02:18:39,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:39,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014195349] [2022-11-22 02:18:39,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:39,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:40,759 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-22 02:18:40,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:40,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014195349] [2022-11-22 02:18:40,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014195349] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:40,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887548093] [2022-11-22 02:18:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:40,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:40,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:40,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 02:18:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:40,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 02:18:40,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:41,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:41,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:18:41,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:18:41,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:18:41,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:41,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:41,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:41,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:41,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:18:41,597 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-22 02:18:41,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:42,823 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-22 02:18:42,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887548093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:42,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1545115775] [2022-11-22 02:18:42,824 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-22 02:18:42,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:42,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:18:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351145092] [2022-11-22 02:18:42,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:18:42,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:18:42,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:42,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:18:42,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:18:42,827 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-22 02:18:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:18:51,684 INFO L93 Difference]: Finished difference Result 15060 states and 30516 transitions. [2022-11-22 02:18:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-22 02:18:51,689 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-22 02:18:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:18:51,765 INFO L225 Difference]: With dead ends: 15060 [2022-11-22 02:18:51,766 INFO L226 Difference]: Without dead ends: 15060 [2022-11-22 02:18:51,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1103, Invalid=4597, Unknown=0, NotChecked=0, Total=5700 [2022-11-22 02:18:51,768 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 1417 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 3658 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 3842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 3658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:18:51,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 308 Invalid, 3842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 3658 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-22 02:18:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15060 states. [2022-11-22 02:18:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15060 to 5122. [2022-11-22 02:18:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5122 states, 5109 states have (on average 2.1287923272656095) internal successors, (10876), 5121 states have internal predecessors, (10876), 0 states have call successors, (0), 0 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-22 02:18:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 10876 transitions. [2022-11-22 02:18:52,049 INFO L78 Accepts]: Start accepts. Automaton has 5122 states and 10876 transitions. Word has length 45 [2022-11-22 02:18:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:18:52,050 INFO L495 AbstractCegarLoop]: Abstraction has 5122 states and 10876 transitions. [2022-11-22 02:18:52,050 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-22 02:18:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5122 states and 10876 transitions. [2022-11-22 02:18:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:18:52,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:18:52,053 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-22 02:18:52,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:18:52,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 02:18:52,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-22 02:18:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:18:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1841113418, now seen corresponding path program 1 times [2022-11-22 02:18:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:18:52,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273918186] [2022-11-22 02:18:52,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:52,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:18:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:53,116 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-22 02:18:53,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:18:53,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273918186] [2022-11-22 02:18:53,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273918186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:18:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166081157] [2022-11-22 02:18:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:18:53,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:18:53,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:18:53,118 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:18:53,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:18:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:18:53,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-22 02:18:53,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:18:53,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:18:53,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:18:53,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:18:53,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:18:53,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:53,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:54,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:54,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:18:54,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:18:54,054 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-22 02:18:54,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:18:55,236 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-22 02:18:55,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166081157] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:18:55,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1956812325] [2022-11-22 02:18:55,238 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-22 02:18:55,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:18:55,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:18:55,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171093428] [2022-11-22 02:18:55,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:18:55,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:18:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:18:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:18:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:18:55,241 INFO L87 Difference]: Start difference. First operand 5122 states and 10876 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-22 02:19:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:08,502 INFO L93 Difference]: Finished difference Result 12586 states and 25533 transitions. [2022-11-22 02:19:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-22 02:19:08,507 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-22 02:19:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:08,546 INFO L225 Difference]: With dead ends: 12586 [2022-11-22 02:19:08,546 INFO L226 Difference]: Without dead ends: 12582 [2022-11-22 02:19:08,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=685, Invalid=3097, Unknown=0, NotChecked=0, Total=3782 [2022-11-22 02:19:08,550 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 975 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 4921 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 5050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 4921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:08,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 313 Invalid, 5050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 4921 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-11-22 02:19:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12582 states. [2022-11-22 02:19:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12582 to 6168. [2022-11-22 02:19:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6168 states, 6155 states have (on average 2.1301380991064174) internal successors, (13111), 6167 states have internal predecessors, (13111), 0 states have call successors, (0), 0 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-22 02:19:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 13111 transitions. [2022-11-22 02:19:08,790 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 13111 transitions. Word has length 45 [2022-11-22 02:19:08,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:08,790 INFO L495 AbstractCegarLoop]: Abstraction has 6168 states and 13111 transitions. [2022-11-22 02:19:08,791 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-22 02:19:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 13111 transitions. [2022-11-22 02:19:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:19:08,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:08,794 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-22 02:19:08,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:19:09,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 02:19:09,005 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:19:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash -206123706, now seen corresponding path program 1 times [2022-11-22 02:19:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:09,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235387475] [2022-11-22 02:19:09,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:09,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:10,557 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-22 02:19:10,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:10,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235387475] [2022-11-22 02:19:10,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235387475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:19:10,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847397047] [2022-11-22 02:19:10,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:10,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:19:10,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:19:10,560 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:19:10,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 02:19:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:10,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-22 02:19:10,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:19:11,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:19:11,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:19:11,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:19:11,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:19:11,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:19:11,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:19:11,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:19:11,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:19:11,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:11,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:19:11,613 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-22 02:19:11,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:19:13,631 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-22 02:19:13,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847397047] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:19:13,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [31697378] [2022-11-22 02:19:13,632 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-22 02:19:13,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:19:13,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-11-22 02:19:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553035340] [2022-11-22 02:19:13,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:19:13,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 02:19:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 02:19:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 02:19:13,634 INFO L87 Difference]: Start difference. First operand 6168 states and 13111 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-22 02:19:30,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:30,296 INFO L93 Difference]: Finished difference Result 11862 states and 24171 transitions. [2022-11-22 02:19:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-22 02:19:30,296 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-22 02:19:30,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:30,327 INFO L225 Difference]: With dead ends: 11862 [2022-11-22 02:19:30,328 INFO L226 Difference]: Without dead ends: 11858 [2022-11-22 02:19:30,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=659, Invalid=3001, Unknown=0, NotChecked=0, Total=3660 [2022-11-22 02:19:30,329 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1047 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 4510 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 4767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 4510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:30,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 270 Invalid, 4767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 4510 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2022-11-22 02:19:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2022-11-22 02:19:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 6622. [2022-11-22 02:19:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6622 states, 6609 states have (on average 2.121803601149947) internal successors, (14023), 6621 states have internal predecessors, (14023), 0 states have call successors, (0), 0 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-22 02:19:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6622 states to 6622 states and 14023 transitions. [2022-11-22 02:19:30,539 INFO L78 Accepts]: Start accepts. Automaton has 6622 states and 14023 transitions. Word has length 45 [2022-11-22 02:19:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:30,540 INFO L495 AbstractCegarLoop]: Abstraction has 6622 states and 14023 transitions. [2022-11-22 02:19:30,540 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-22 02:19:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6622 states and 14023 transitions. [2022-11-22 02:19:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:19:30,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:30,543 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-22 02:19:30,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-22 02:19:30,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 02:19:30,753 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:19:30,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash -730255193, now seen corresponding path program 1 times [2022-11-22 02:19:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:30,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278592486] [2022-11-22 02:19:30,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:31,429 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-22 02:19:31,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:31,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278592486] [2022-11-22 02:19:31,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278592486] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:19:31,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001896130] [2022-11-22 02:19:31,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:31,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:19:31,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:19:31,431 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:19:31,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 02:19:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:31,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 02:19:31,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:19:32,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:19:32,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:19:32,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:19:32,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:32,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:32,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:32,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-22 02:19:32,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:19:32,298 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-22 02:19:32,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:19:33,075 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-22 02:19:33,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001896130] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:19:33,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [128209888] [2022-11-22 02:19:33,076 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-22 02:19:33,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:19:33,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-22 02:19:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619043723] [2022-11-22 02:19:33,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:19:33,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:19:33,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:19:33,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:19:33,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2022-11-22 02:19:33,078 INFO L87 Difference]: Start difference. First operand 6622 states and 14023 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-22 02:19:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:19:40,352 INFO L93 Difference]: Finished difference Result 11632 states and 23689 transitions. [2022-11-22 02:19:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-22 02:19:40,353 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-22 02:19:40,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:19:40,384 INFO L225 Difference]: With dead ends: 11632 [2022-11-22 02:19:40,385 INFO L226 Difference]: Without dead ends: 11632 [2022-11-22 02:19:40,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=827, Invalid=3595, Unknown=0, NotChecked=0, Total=4422 [2022-11-22 02:19:40,387 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 924 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 3444 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 3605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 3444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:19:40,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 284 Invalid, 3605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 3444 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-22 02:19:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11632 states. [2022-11-22 02:19:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11632 to 6964. [2022-11-22 02:19:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6964 states, 6951 states have (on average 2.1196950079125307) internal successors, (14734), 6963 states have internal predecessors, (14734), 0 states have call successors, (0), 0 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-22 02:19:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6964 states to 6964 states and 14734 transitions. [2022-11-22 02:19:40,596 INFO L78 Accepts]: Start accepts. Automaton has 6964 states and 14734 transitions. Word has length 45 [2022-11-22 02:19:40,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:19:40,597 INFO L495 AbstractCegarLoop]: Abstraction has 6964 states and 14734 transitions. [2022-11-22 02:19:40,597 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-22 02:19:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6964 states and 14734 transitions. [2022-11-22 02:19:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:19:40,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:19:40,599 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-22 02:19:40,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 02:19:40,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 02:19:40,806 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-22 02:19:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:19:40,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1619955420, now seen corresponding path program 2 times [2022-11-22 02:19:40,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:19:40,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083852073] [2022-11-22 02:19:40,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:19:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:19:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:19:42,043 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-22 02:19:42,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:19:42,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083852073] [2022-11-22 02:19:42,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083852073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:19:42,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969422635] [2022-11-22 02:19:42,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:19:42,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:19:42,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:19:42,048 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:19:42,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 02:19:42,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:19:42,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:19:42,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-22 02:19:42,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:19:42,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:19:42,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:19:42,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:19:42,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:19:42,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:19:42,633 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:19:42,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-22 02:19:42,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:19:42,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 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-22 02:19:42,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 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-22 02:19:42,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:42,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 68 [2022-11-22 02:19:43,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:19:43,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 111 [2022-11-22 02:19:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:19:55,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:20:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:20:24,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969422635] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:20:24,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:20:24,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 11] total 32 [2022-11-22 02:20:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459745263] [2022-11-22 02:20:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:20:24,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:20:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:20:24,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:20:24,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=883, Unknown=12, NotChecked=0, Total=1056 [2022-11-22 02:20:24,666 INFO L87 Difference]: Start difference. First operand 6964 states and 14734 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-22 02:20:32,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:20:36,152 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store .cse16 .cse4 0) .cse12 0) .cse8 0))) (.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse16 .cse12 0) .cse8 0)))) (let ((.cse3 (select .cse2 |c_~#cache~0.base|)) (.cse6 (select .cse5 |c_~#cache~0.base|)) (.cse0 (select |c_#pthreadsMutex| |c_~#cache~0.base|))) (and (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse1 |c_~#cache~0.offset| 1) 0) (+ 2 .cse1 |c_~#cache~0.offset|) 0) (+ 3 .cse1 |c_~#cache~0.offset|) 0) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse7 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse5 |c_~#cache~0.base| (store (store (store (store .cse6 (+ .cse7 |c_~#cache~0.offset| 1) 0) (+ 2 .cse7 |c_~#cache~0.offset|) 0) (+ 3 .cse7 |c_~#cache~0.offset|) 0) (+ .cse7 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8) 0)) (not (= (select .cse0 (+ .cse7 |c_~#cache~0.offset| 4)) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse9 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse9 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse5 |c_~#cache~0.base| (store (store (store (store .cse6 (+ .cse9 |c_~#cache~0.offset| 1) 0) (+ 2 .cse9 |c_~#cache~0.offset|) 0) (+ 3 .cse9 |c_~#cache~0.offset|) 0) (+ .cse9 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse10 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse10 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse10 |c_~#cache~0.offset| 1) 0) (+ 2 .cse10 |c_~#cache~0.offset|) 0) (+ 3 .cse10 |c_~#cache~0.offset|) 0) (+ .cse10 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse11 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse11 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= 0 (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse11 |c_~#cache~0.offset| 1) 0) (+ 2 .cse11 |c_~#cache~0.offset|) 0) (+ 3 .cse11 |c_~#cache~0.offset|) 0) (+ .cse11 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12)))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse13 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse5 |c_~#cache~0.base| (store (store (store (store .cse6 (+ .cse13 |c_~#cache~0.offset| 1) 0) (+ 2 .cse13 |c_~#cache~0.offset|) 0) (+ 3 .cse13 |c_~#cache~0.offset|) 0) (+ .cse13 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0)) (not (= (select .cse0 (+ .cse13 |c_~#cache~0.offset| 4)) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse14 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse14 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse14 |c_~#cache~0.offset| 1) 0) (+ 2 .cse14 |c_~#cache~0.offset|) 0) (+ 3 .cse14 |c_~#cache~0.offset|) 0) (+ .cse14 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse15 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse5 |c_~#cache~0.base| (store (store (store (store .cse6 (+ .cse15 |c_~#cache~0.offset| 1) 0) (+ 2 .cse15 |c_~#cache~0.offset|) 0) (+ 3 .cse15 |c_~#cache~0.offset|) 0) (+ .cse15 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12) 0)) (not (= (select .cse0 (+ .cse15 |c_~#cache~0.offset| 4)) 0))))))))) is different from true [2022-11-22 02:20:37,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:20:38,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:20:40,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:20:44,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:20:45,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:20:46,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:20:48,300 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10 0) .cse8 0)))) (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (select .cse2 |c_~#cache~0.base|)) (.cse5 (select |c_#race| |c_~#cache~0.base|)) (.cse0 (select |c_#pthreadsMutex| |c_~#cache~0.base|))) (and (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse1 |c_~#cache~0.offset| 1) 0) (+ 2 .cse1 |c_~#cache~0.offset|) 0) (+ 3 .cse1 |c_~#cache~0.offset|) 0) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse6 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_1547 Int)) (= 0 (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store .cse5 (+ .cse6 |c_~#cache~0.offset| 1) 0) (+ 2 .cse6 |c_~#cache~0.offset|) 0) (+ 3 .cse6 |c_~#cache~0.offset|) 0) (+ .cse6 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4))) (not (= (select .cse0 (+ .cse6 |c_~#cache~0.offset| 4)) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse7 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse7 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse7 |c_~#cache~0.offset| 1) 0) (+ 2 .cse7 |c_~#cache~0.offset|) 0) (+ 3 .cse7 |c_~#cache~0.offset|) 0) (+ .cse7 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse9 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse9 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= 0 (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse9 |c_~#cache~0.offset| 1) 0) (+ 2 .cse9 |c_~#cache~0.offset|) 0) (+ 3 .cse9 |c_~#cache~0.offset|) 0) (+ .cse9 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10)))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse11 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_1547 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store .cse5 (+ .cse11 |c_~#cache~0.offset| 1) 0) (+ 2 .cse11 |c_~#cache~0.offset|) 0) (+ 3 .cse11 |c_~#cache~0.offset|) 0) (+ .cse11 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (not (= (select .cse0 (+ .cse11 |c_~#cache~0.offset| 4)) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse12 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse12 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store .cse5 (+ .cse12 |c_~#cache~0.offset| 1) 0) (+ 2 .cse12 |c_~#cache~0.offset|) 0) (+ 3 .cse12 |c_~#cache~0.offset|) 0) (+ .cse12 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse10) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse13 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse13 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse13 |c_~#cache~0.offset| 1) 0) (+ 2 .cse13 |c_~#cache~0.offset|) 0) (+ 3 .cse13 |c_~#cache~0.offset|) 0) (+ .cse13 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse14 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_1547 Int)) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store .cse5 (+ .cse14 |c_~#cache~0.offset| 1) 0) (+ 2 .cse14 |c_~#cache~0.offset|) 0) (+ 3 .cse14 |c_~#cache~0.offset|) 0) (+ .cse14 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8) 0)) (not (= (select .cse0 (+ .cse14 |c_~#cache~0.offset| 4)) 0))))))))) is different from true [2022-11-22 02:20:50,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:20:52,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:08,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:10,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:14,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:18,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:21,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:23,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:24,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:26,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:28,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:30,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:32,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:34,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:37,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:40,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:42,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:45,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:47,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:51,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:55,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:57,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:21:59,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:01,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:06,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:08,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:10,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:12,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:14,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:17,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:18,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:24,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:26,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:28,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:30,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:32,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:34,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:35,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:40,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:43,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:45,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:47,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:50,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:54,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:22:57,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:07,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:08,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:10,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:14,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:16,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:18,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:20,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:22,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:28,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:33,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:35,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:36,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:41,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:42,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:44,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:46,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:48,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:53,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:23:54,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:01,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:03,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:04,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:06,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:09,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:12,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:13,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:16,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:18,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:20,428 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse8 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store .cse16 .cse8 0) .cse6 0))) (.cse9 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse16 .cse6 0)))) (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse10 (select .cse9 |c_~#cache~0.base|)) (.cse0 (select |c_#pthreadsMutex| |c_~#cache~0.base|)) (.cse3 (select .cse2 |c_~#cache~0.base|))) (and (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse1 |c_~#cache~0.offset| 1) 0) (+ 2 .cse1 |c_~#cache~0.offset|) 0) (+ 3 .cse1 |c_~#cache~0.offset|) 0) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse5 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse5 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse5 |c_~#cache~0.offset| 1) 0) (+ 2 .cse5 |c_~#cache~0.offset|) 0) (+ 3 .cse5 |c_~#cache~0.offset|) 0) (+ .cse5 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse7 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse7 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= 0 (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse7 |c_~#cache~0.offset| 1) 0) (+ 2 .cse7 |c_~#cache~0.offset|) 0) (+ 3 .cse7 |c_~#cache~0.offset|) 0) (+ .cse7 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8)))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse11 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse9 |c_~#cache~0.base| (store (store (store (store .cse10 (+ .cse11 |c_~#cache~0.offset| 1) 0) (+ 2 .cse11 |c_~#cache~0.offset|) 0) (+ 3 .cse11 |c_~#cache~0.offset|) 0) (+ .cse11 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4) 0)) (not (= (select .cse0 (+ .cse11 |c_~#cache~0.offset| 4)) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse12 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse12 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= 0 (select (select (store .cse9 |c_~#cache~0.base| (store (store (store (store .cse10 (+ .cse12 |c_~#cache~0.offset| 1) 0) (+ 2 .cse12 |c_~#cache~0.offset|) 0) (+ 3 .cse12 |c_~#cache~0.offset|) 0) (+ .cse12 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse13 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse9 |c_~#cache~0.base| (store (store (store (store .cse10 (+ .cse13 |c_~#cache~0.offset| 1) 0) (+ 2 .cse13 |c_~#cache~0.offset|) 0) (+ 3 .cse13 |c_~#cache~0.offset|) 0) (+ .cse13 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse8) 0)) (not (= (select .cse0 (+ .cse13 |c_~#cache~0.offset| 4)) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse14 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_1547 Int)) (= 0 (select (select (store .cse9 |c_~#cache~0.base| (store (store (store (store .cse10 (+ .cse14 |c_~#cache~0.offset| 1) 0) (+ 2 .cse14 |c_~#cache~0.offset|) 0) (+ 3 .cse14 |c_~#cache~0.offset|) 0) (+ .cse14 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (not (= (select .cse0 (+ .cse14 |c_~#cache~0.offset| 4)) 0))))) (forall ((|t_funThread1of1ForFork0_~i~0#1| Int)) (let ((.cse15 (* |t_funThread1of1ForFork0_~i~0#1| 28))) (or (not (= (select .cse0 (+ .cse15 |c_~#cache~0.offset| 4)) 0)) (forall ((v_ArrVal_1547 Int)) (= (select (select (store .cse2 |c_~#cache~0.base| (store (store (store (store .cse3 (+ .cse15 |c_~#cache~0.offset| 1) 0) (+ 2 .cse15 |c_~#cache~0.offset|) 0) (+ 3 .cse15 |c_~#cache~0.offset|) 0) (+ .cse15 |c_~#cache~0.offset|) v_ArrVal_1547)) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))))))))) is different from true [2022-11-22 02:24:32,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:34,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:36,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:24:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:24:45,339 INFO L93 Difference]: Finished difference Result 9413 states and 19855 transitions. [2022-11-22 02:24:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 02:24:45,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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-22 02:24:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:24:45,363 INFO L225 Difference]: With dead ends: 9413 [2022-11-22 02:24:45,363 INFO L226 Difference]: Without dead ends: 9413 [2022-11-22 02:24:45,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 50.1s TimeCoverageRelationStatistics Valid=179, Invalid=940, Unknown=15, NotChecked=198, Total=1332 [2022-11-22 02:24:45,364 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 65 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 33 mSolverCounterUnsat, 55 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 250.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 55 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 251.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:24:45,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 44 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 715 Invalid, 55 Unknown, 39 Unchecked, 251.7s Time] [2022-11-22 02:24:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9413 states. [2022-11-22 02:24:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9413 to 7120. [2022-11-22 02:24:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7120 states, 7107 states have (on average 2.1229773462783172) internal successors, (15088), 7119 states have internal predecessors, (15088), 0 states have call successors, (0), 0 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-22 02:24:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7120 states to 7120 states and 15088 transitions. [2022-11-22 02:24:45,538 INFO L78 Accepts]: Start accepts. Automaton has 7120 states and 15088 transitions. Word has length 45 [2022-11-22 02:24:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:24:45,538 INFO L495 AbstractCegarLoop]: Abstraction has 7120 states and 15088 transitions. [2022-11-22 02:24:45,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-22 02:24:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 7120 states and 15088 transitions. [2022-11-22 02:24:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:24:45,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:24:45,541 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-22 02:24:45,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 02:24:45,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 02:24:45,747 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:24:45,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:24:45,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1046899879, now seen corresponding path program 2 times [2022-11-22 02:24:45,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:24:45,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850799136] [2022-11-22 02:24:45,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:24:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:24:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:24:46,406 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-22 02:24:46,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:24:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850799136] [2022-11-22 02:24:46,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850799136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:24:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458150540] [2022-11-22 02:24:46,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:24:46,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:24:46,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:24:46,410 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:24:46,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 02:24:46,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:24:46,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:24:46,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 02:24:46,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:24:46,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:24:46,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:24:46,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:24:46,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:24:47,015 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:24:47,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-22 02:24:47,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:24:47,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:24:47,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:24:47,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-11-22 02:24:47,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:24:47,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:24:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:24:47,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:24:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:24:48,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458150540] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:24:48,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:24:48,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 24 [2022-11-22 02:24:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564435264] [2022-11-22 02:24:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:24:48,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:24:48,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:24:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:24:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-11-22 02:24:48,754 INFO L87 Difference]: Start difference. First operand 7120 states and 15088 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-22 02:24:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:24:58,070 INFO L93 Difference]: Finished difference Result 10157 states and 21455 transitions. [2022-11-22 02:24:58,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:24:58,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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-22 02:24:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:24:58,088 INFO L225 Difference]: With dead ends: 10157 [2022-11-22 02:24:58,088 INFO L226 Difference]: Without dead ends: 10157 [2022-11-22 02:24:58,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2022-11-22 02:24:58,089 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 76 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:24:58,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 40 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-11-22 02:24:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10157 states. [2022-11-22 02:24:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10157 to 7188. [2022-11-22 02:24:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7188 states, 7175 states have (on average 2.1266898954703835) internal successors, (15259), 7187 states have internal predecessors, (15259), 0 states have call successors, (0), 0 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-22 02:24:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7188 states to 7188 states and 15259 transitions. [2022-11-22 02:24:58,322 INFO L78 Accepts]: Start accepts. Automaton has 7188 states and 15259 transitions. Word has length 45 [2022-11-22 02:24:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:24:58,323 INFO L495 AbstractCegarLoop]: Abstraction has 7188 states and 15259 transitions. [2022-11-22 02:24:58,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-22 02:24:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 7188 states and 15259 transitions. [2022-11-22 02:24:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:24:58,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:24:58,325 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-22 02:24:58,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-22 02:24:58,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:24:58,531 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:24:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:24:58,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1046875699, now seen corresponding path program 3 times [2022-11-22 02:24:58,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:24:58,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063906663] [2022-11-22 02:24:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:24:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:24:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:24:59,203 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-22 02:24:59,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:24:59,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063906663] [2022-11-22 02:24:59,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063906663] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:24:59,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495965002] [2022-11-22 02:24:59,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:24:59,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:24:59,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:24:59,205 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:24:59,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 02:24:59,593 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:24:59,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:24:59,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 02:24:59,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:24:59,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:25:00,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:25:00,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:25:00,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:25:00,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:00,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:00,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:00,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:00,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:25:00,341 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-22 02:25:00,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:25:01,787 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-22 02:25:01,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495965002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:25:01,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1531518376] [2022-11-22 02:25:01,788 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-22 02:25:01,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:25:01,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:25:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923075290] [2022-11-22 02:25:01,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:25:01,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:25:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:25:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:25:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:25:01,791 INFO L87 Difference]: Start difference. First operand 7188 states and 15259 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-22 02:25:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:25:12,689 INFO L93 Difference]: Finished difference Result 10600 states and 21666 transitions. [2022-11-22 02:25:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-22 02:25:12,689 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-22 02:25:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:25:12,704 INFO L225 Difference]: With dead ends: 10600 [2022-11-22 02:25:12,704 INFO L226 Difference]: Without dead ends: 10600 [2022-11-22 02:25:12,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=581, Invalid=2499, Unknown=0, NotChecked=0, Total=3080 [2022-11-22 02:25:12,705 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 710 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 3782 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 3847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:25:12,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 286 Invalid, 3847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3782 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-11-22 02:25:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2022-11-22 02:25:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 7238. [2022-11-22 02:25:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7238 states, 7225 states have (on average 2.126228373702422) internal successors, (15362), 7237 states have internal predecessors, (15362), 0 states have call successors, (0), 0 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-22 02:25:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 15362 transitions. [2022-11-22 02:25:12,914 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 15362 transitions. Word has length 45 [2022-11-22 02:25:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:25:12,914 INFO L495 AbstractCegarLoop]: Abstraction has 7238 states and 15362 transitions. [2022-11-22 02:25:12,914 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-22 02:25:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 15362 transitions. [2022-11-22 02:25:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:25:12,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:25:12,917 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-22 02:25:12,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-22 02:25:13,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:13,124 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:25:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:25:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash 963188343, now seen corresponding path program 4 times [2022-11-22 02:25:13,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:25:13,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307135950] [2022-11-22 02:25:13,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:25:13,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:25:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:25:13,755 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-22 02:25:13,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:25:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307135950] [2022-11-22 02:25:13,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307135950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:25:13,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520693944] [2022-11-22 02:25:13,755 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 02:25:13,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:13,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:25:13,757 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:25:13,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 02:25:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:25:13,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 02:25:13,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:25:14,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:25:14,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:25:14,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:25:14,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:14,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:14,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:14,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-22 02:25:14,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:25:14,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:25:14,529 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-22 02:25:14,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:25:17,615 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-22 02:25:17,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520693944] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:25:17,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367524249] [2022-11-22 02:25:17,616 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-22 02:25:17,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:25:17,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-22 02:25:17,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86450129] [2022-11-22 02:25:17,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:25:17,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 02:25:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:25:17,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 02:25:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=806, Unknown=1, NotChecked=0, Total=930 [2022-11-22 02:25:17,619 INFO L87 Difference]: Start difference. First operand 7238 states and 15362 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-22 02:25:36,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:25:46,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:25:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:25:48,721 INFO L93 Difference]: Finished difference Result 13847 states and 28238 transitions. [2022-11-22 02:25:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-22 02:25:48,721 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-22 02:25:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:25:48,747 INFO L225 Difference]: With dead ends: 13847 [2022-11-22 02:25:48,748 INFO L226 Difference]: Without dead ends: 13847 [2022-11-22 02:25:48,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=1024, Invalid=4086, Unknown=2, NotChecked=0, Total=5112 [2022-11-22 02:25:48,750 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1294 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 3156 mSolverCounterSat, 252 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 3156 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:25:48,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 327 Invalid, 3410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 3156 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2022-11-22 02:25:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13847 states. [2022-11-22 02:25:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13847 to 7258. [2022-11-22 02:25:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7258 states, 7245 states have (on average 2.125465838509317) internal successors, (15399), 7257 states have internal predecessors, (15399), 0 states have call successors, (0), 0 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-22 02:25:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7258 states to 7258 states and 15399 transitions. [2022-11-22 02:25:48,981 INFO L78 Accepts]: Start accepts. Automaton has 7258 states and 15399 transitions. Word has length 45 [2022-11-22 02:25:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:25:48,982 INFO L495 AbstractCegarLoop]: Abstraction has 7258 states and 15399 transitions. [2022-11-22 02:25:48,983 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-22 02:25:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7258 states and 15399 transitions. [2022-11-22 02:25:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:25:48,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:25:48,986 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-22 02:25:48,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-22 02:25:49,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:49,192 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-22 02:25:49,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:25:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1970276249, now seen corresponding path program 5 times [2022-11-22 02:25:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:25:49,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654181092] [2022-11-22 02:25:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:25:49,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:25:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:25:49,884 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-22 02:25:49,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:25:49,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654181092] [2022-11-22 02:25:49,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654181092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:25:49,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046404886] [2022-11-22 02:25:49,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:25:49,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:49,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:25:49,886 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:25:49,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-22 02:25:50,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:25:50,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:25:50,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 02:25:50,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:25:50,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:25:50,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:25:50,330 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:25:50,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-22 02:25:50,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:25:50,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:25:50,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:50,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:50,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:25:50,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-11-22 02:25:50,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:25:50,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:25:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:25:50,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:25:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:25:51,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046404886] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:25:51,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:25:51,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 24 [2022-11-22 02:25:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119382307] [2022-11-22 02:25:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:25:51,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:25:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:25:51,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:25:51,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-11-22 02:25:51,836 INFO L87 Difference]: Start difference. First operand 7258 states and 15399 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-22 02:25:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:25:58,022 INFO L93 Difference]: Finished difference Result 10387 states and 21922 transitions. [2022-11-22 02:25:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:25:58,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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-22 02:25:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:25:58,036 INFO L225 Difference]: With dead ends: 10387 [2022-11-22 02:25:58,036 INFO L226 Difference]: Without dead ends: 10387 [2022-11-22 02:25:58,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2022-11-22 02:25:58,037 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 79 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:25:58,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 40 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-22 02:25:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10387 states. [2022-11-22 02:25:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10387 to 7263. [2022-11-22 02:25:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7263 states, 7250 states have (on average 2.1248275862068966) internal successors, (15405), 7262 states have internal predecessors, (15405), 0 states have call successors, (0), 0 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-22 02:25:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7263 states to 7263 states and 15405 transitions. [2022-11-22 02:25:58,227 INFO L78 Accepts]: Start accepts. Automaton has 7263 states and 15405 transitions. Word has length 45 [2022-11-22 02:25:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:25:58,227 INFO L495 AbstractCegarLoop]: Abstraction has 7263 states and 15405 transitions. [2022-11-22 02:25:58,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-22 02:25:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7263 states and 15405 transitions. [2022-11-22 02:25:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:25:58,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:25:58,232 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-22 02:25:58,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-22 02:25:58,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:58,438 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-22 02:25:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:25:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1970300429, now seen corresponding path program 6 times [2022-11-22 02:25:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:25:58,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251164021] [2022-11-22 02:25:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:25:58,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:25:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:25:59,191 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-22 02:25:59,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:25:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251164021] [2022-11-22 02:25:59,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251164021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:25:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057546140] [2022-11-22 02:25:59,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:25:59,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:25:59,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:25:59,194 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:25:59,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-22 02:25:59,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:25:59,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:25:59,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-22 02:25:59,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:00,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:26:00,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:26:00,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:26:00,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:26:00,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:00,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:00,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:00,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:00,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:26:00,469 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-22 02:26:00,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:26:01,909 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-22 02:26:01,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057546140] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:26:01,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648106449] [2022-11-22 02:26:01,911 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-22 02:26:01,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:26:01,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-22 02:26:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610452783] [2022-11-22 02:26:01,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:26:01,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 02:26:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 02:26:01,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2022-11-22 02:26:01,913 INFO L87 Difference]: Start difference. First operand 7263 states and 15405 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-22 02:26:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:26:15,202 INFO L93 Difference]: Finished difference Result 10802 states and 22037 transitions. [2022-11-22 02:26:15,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-22 02:26:15,202 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-22 02:26:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:26:15,216 INFO L225 Difference]: With dead ends: 10802 [2022-11-22 02:26:15,216 INFO L226 Difference]: Without dead ends: 10802 [2022-11-22 02:26:15,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=612, Invalid=2694, Unknown=0, NotChecked=0, Total=3306 [2022-11-22 02:26:15,217 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 657 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 3624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 3457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:26:15,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 411 Invalid, 3624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 3457 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-11-22 02:26:15,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10802 states. [2022-11-22 02:26:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10802 to 7276. [2022-11-22 02:26:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7276 states, 7263 states have (on average 2.12198815916288) internal successors, (15412), 7275 states have internal predecessors, (15412), 0 states have call successors, (0), 0 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-22 02:26:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7276 states to 7276 states and 15412 transitions. [2022-11-22 02:26:15,372 INFO L78 Accepts]: Start accepts. Automaton has 7276 states and 15412 transitions. Word has length 45 [2022-11-22 02:26:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:26:15,373 INFO L495 AbstractCegarLoop]: Abstraction has 7276 states and 15412 transitions. [2022-11-22 02:26:15,373 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-22 02:26:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7276 states and 15412 transitions. [2022-11-22 02:26:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:26:15,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:26:15,376 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-22 02:26:15,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-22 02:26:15,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-22 02:26:15,582 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:26:15,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:26:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1322759466, now seen corresponding path program 3 times [2022-11-22 02:26:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:26:15,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15729175] [2022-11-22 02:26:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:26:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:26:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:26:16,837 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-22 02:26:16,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:26:16,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15729175] [2022-11-22 02:26:16,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15729175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:26:16,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408675642] [2022-11-22 02:26:16,838 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:26:16,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:26:16,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:26:16,842 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:26:16,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-22 02:26:17,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:26:17,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:26:17,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-22 02:26:17,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:26:17,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:26:17,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:26:17,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:26:17,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:26:17,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:26:17,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:26:17,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:26:17,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:26:17,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:26:17,932 INFO L350 Elim1Store]: Elim1 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-22 02:26:22,009 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-22 02:26:22,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:26:46,320 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-22 02:26:46,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408675642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:26:46,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1098480487] [2022-11-22 02:26:46,321 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-22 02:26:46,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:26:46,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2022-11-22 02:26:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146157806] [2022-11-22 02:26:46,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:26:46,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 02:26:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:26:46,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 02:26:46,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1088, Unknown=5, NotChecked=0, Total=1260 [2022-11-22 02:26:46,325 INFO L87 Difference]: Start difference. First operand 7276 states and 15412 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-22 02:26:59,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:02,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:04,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:06,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:08,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:12,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:16,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:19,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:21,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:28,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:30,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:34,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:36,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:38,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:40,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:43,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:45,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:47,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:49,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:27:51,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:28:04,869 WARN L233 SmtUtils]: Spent 12.33s on a formula simplification. DAG size of input: 55 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:28:15,821 WARN L233 SmtUtils]: Spent 10.53s on a formula simplification. DAG size of input: 59 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:28:23,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 02:28:36,412 WARN L233 SmtUtils]: Spent 12.42s on a formula simplification. DAG size of input: 66 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:28:43,283 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 80 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:28:44,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:46,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:48,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:55,342 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 80 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:28:57,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:28:59,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:29:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:09,805 INFO L93 Difference]: Finished difference Result 14173 states and 28863 transitions. [2022-11-22 02:29:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-22 02:29:09,806 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-22 02:29:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:09,830 INFO L225 Difference]: With dead ends: 14173 [2022-11-22 02:29:09,830 INFO L226 Difference]: Without dead ends: 14173 [2022-11-22 02:29:09,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=1011, Invalid=4235, Unknown=10, NotChecked=0, Total=5256 [2022-11-22 02:29:09,832 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 1183 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 3332 mSolverCounterSat, 314 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 3669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 3332 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.9s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:09,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 338 Invalid, 3669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 3332 Invalid, 23 Unknown, 0 Unchecked, 75.9s Time] [2022-11-22 02:29:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14173 states. [2022-11-22 02:29:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14173 to 7288. [2022-11-22 02:29:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7288 states, 7275 states have (on average 2.121786941580756) internal successors, (15436), 7287 states have internal predecessors, (15436), 0 states have call successors, (0), 0 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-22 02:29:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7288 states to 7288 states and 15436 transitions. [2022-11-22 02:29:10,011 INFO L78 Accepts]: Start accepts. Automaton has 7288 states and 15436 transitions. Word has length 45 [2022-11-22 02:29:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:10,011 INFO L495 AbstractCegarLoop]: Abstraction has 7288 states and 15436 transitions. [2022-11-22 02:29:10,011 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-22 02:29:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7288 states and 15436 transitions. [2022-11-22 02:29:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:29:10,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:10,014 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-22 02:29:10,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-22 02:29:10,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-22 02:29:10,221 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:29:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1661893852, now seen corresponding path program 4 times [2022-11-22 02:29:10,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:10,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904919299] [2022-11-22 02:29:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:11,549 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-22 02:29:11,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:11,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904919299] [2022-11-22 02:29:11,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904919299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:11,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062164819] [2022-11-22 02:29:11,549 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 02:29:11,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:29:11,551 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:29:11,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-22 02:29:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:11,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-22 02:29:11,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:29:12,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:29:12,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:29:12,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:29:12,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:29:12,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:29:12,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:29:12,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:29:12,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-11-22 02:29:12,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:12,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:29:12,747 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-22 02:29:12,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:29:15,184 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-22 02:29:15,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062164819] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:29:15,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1453030279] [2022-11-22 02:29:15,185 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-22 02:29:15,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:29:15,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32 [2022-11-22 02:29:15,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227871153] [2022-11-22 02:29:15,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:29:15,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 02:29:15,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:15,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 02:29:15,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 02:29:15,188 INFO L87 Difference]: Start difference. First operand 7288 states and 15436 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-22 02:29:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:29:36,602 INFO L93 Difference]: Finished difference Result 11298 states and 23036 transitions. [2022-11-22 02:29:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-22 02:29:36,602 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-22 02:29:36,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:29:36,617 INFO L225 Difference]: With dead ends: 11298 [2022-11-22 02:29:36,617 INFO L226 Difference]: Without dead ends: 11298 [2022-11-22 02:29:36,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=649, Invalid=3010, Unknown=1, NotChecked=0, Total=3660 [2022-11-22 02:29:36,618 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 679 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 3930 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 4121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 3930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:29:36,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 365 Invalid, 4121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 3930 Invalid, 0 Unknown, 0 Unchecked, 16.6s Time] [2022-11-22 02:29:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11298 states. [2022-11-22 02:29:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11298 to 7320. [2022-11-22 02:29:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7320 states, 7307 states have (on average 2.1215273025865606) internal successors, (15502), 7319 states have internal predecessors, (15502), 0 states have call successors, (0), 0 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-22 02:29:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7320 states to 7320 states and 15502 transitions. [2022-11-22 02:29:36,777 INFO L78 Accepts]: Start accepts. Automaton has 7320 states and 15502 transitions. Word has length 45 [2022-11-22 02:29:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:29:36,777 INFO L495 AbstractCegarLoop]: Abstraction has 7320 states and 15502 transitions. [2022-11-22 02:29:36,777 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-22 02:29:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 7320 states and 15502 transitions. [2022-11-22 02:29:36,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-22 02:29:36,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:29:36,780 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-22 02:29:36,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-22 02:29:36,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-22 02:29:36,987 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:29:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:29:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash 152868970, now seen corresponding path program 5 times [2022-11-22 02:29:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:29:36,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485994244] [2022-11-22 02:29:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:29:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:29:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:29:38,116 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-22 02:29:38,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:29:38,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485994244] [2022-11-22 02:29:38,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485994244] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:38,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55334034] [2022-11-22 02:29:38,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:29:38,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:29:38,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:29:38,118 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:29:38,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91dd91f-96a4-4b17-977b-f1f171580cee/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-22 02:29:38,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:29:38,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:29:38,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-22 02:29:38,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:29:38,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:29:38,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:29:38,660 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:29:38,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-11-22 02:29:38,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:29:38,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:29:38,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:29:38,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:38,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:38,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:38,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-22 02:29:38,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:38,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:38,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:38,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:38,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 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-22 02:29:39,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 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-22 02:29:39,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 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-22 02:29:39,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:29:39,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 111 [2022-11-22 02:29:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:29:47,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:29:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-22 02:29:55,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55334034] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 02:29:55,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:29:55,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 10] total 31 [2022-11-22 02:29:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784717527] [2022-11-22 02:29:55,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:29:55,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:29:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:29:55,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:29:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=813, Unknown=3, NotChecked=0, Total=992 [2022-11-22 02:29:55,572 INFO L87 Difference]: Start difference. First operand 7320 states and 15502 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-22 02:29:59,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:10,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:15,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:20,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:22,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:25,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:29,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:32,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:34,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:36,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:38,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:42,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:44,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:51,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:30:53,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:09,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:20,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:23,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:25,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:28,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:30,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:33,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:37,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:39,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:41,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:43,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:44,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:47,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:51,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:54,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:56,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:31:58,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:00,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:03,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:05,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:11,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:15,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:18,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:20,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:24,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:27,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:32,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:35,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:36,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:40,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:41,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:45,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:46,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:48,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:50,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:53,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:55,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:57,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:32:59,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:01,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:02,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:33:05,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]