./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 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_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 10:11:50,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:11:50,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:11:50,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:11:50,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:11:50,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:11:50,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:11:50,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:11:50,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:11:50,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:11:50,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:11:50,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:11:50,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:11:50,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:11:50,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:11:50,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:11:50,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:11:50,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:11:50,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:11:50,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:11:50,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:11:50,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:11:50,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:11:50,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:11:50,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:11:50,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:11:50,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:11:50,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:11:50,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:11:50,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:11:50,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:11:50,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:11:50,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:11:50,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:11:50,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:11:50,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:11:50,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:11:50,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:11:50,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:11:50,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:11:50,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:11:50,983 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-12-14 10:11:51,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:11:51,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:11:51,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:11:51,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:11:51,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:11:51,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:11:51,013 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:11:51,014 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:11:51,014 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:11:51,014 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:11:51,014 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:11:51,014 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:11:51,015 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:11:51,015 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:11:51,015 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:11:51,015 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:11:51,015 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:11:51,016 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:11:51,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:11:51,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:11:51,017 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 10:11:51,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:11:51,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:11:51,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:11:51,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 10:11:51,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:11:51,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 10:11:51,018 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-14 10:11:51,018 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:11:51,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 10:11:51,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:11:51,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 10:11:51,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:11:51,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:11:51,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:11:51,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:11:51,020 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:11:51,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:11:51,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 10:11:51,020 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:11:51,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:11:51,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 10:11:51,021 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:11:51,021 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_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/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_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 [2022-12-14 10:11:51,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:11:51,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:11:51,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:11:51,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:11:51,238 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:11:51,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-12-14 10:11:53,749 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:11:53,882 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:11:53,883 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-12-14 10:11:53,889 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/data/4b6ceee53/83b813512b6648dab93a419ea86e4460/FLAGd7b2b5cfa [2022-12-14 10:11:53,900 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/data/4b6ceee53/83b813512b6648dab93a419ea86e4460 [2022-12-14 10:11:53,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:11:53,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:11:53,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:11:53,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:11:53,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:11:53,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:11:53" (1/1) ... [2022-12-14 10:11:53,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf2f116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:53, skipping insertion in model container [2022-12-14 10:11:53,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:11:53" (1/1) ... [2022-12-14 10:11:53,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:11:53,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:11:54,091 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-12-14 10:11:54,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:11:54,106 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:11:54,137 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-12-14 10:11:54,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:11:54,155 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:11:54,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54 WrapperNode [2022-12-14 10:11:54,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:11:54,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:11:54,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:11:54,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:11:54,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,204 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 341 [2022-12-14 10:11:54,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:11:54,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:11:54,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:11:54,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:11:54,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,247 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:11:54,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:11:54,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:11:54,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:11:54,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (1/1) ... [2022-12-14 10:11:54,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:11:54,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:11:54,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:11:54,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:11:54,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:11:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 10:11:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 10:11:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 10:11:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 10:11:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 10:11:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 10:11:54,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 10:11:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 10:11:54,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 10:11:54,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 10:11:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 10:11:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:11:54,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:11:54,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 10:11:54,314 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 10:11:54,400 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:11:54,402 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:11:54,957 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:11:54,967 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:11:54,967 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-12-14 10:11:54,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:11:54 BoogieIcfgContainer [2022-12-14 10:11:54,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:11:54,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:11:54,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:11:54,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:11:54,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:11:53" (1/3) ... [2022-12-14 10:11:54,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e2cc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:11:54, skipping insertion in model container [2022-12-14 10:11:54,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:11:54" (2/3) ... [2022-12-14 10:11:54,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e2cc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:11:54, skipping insertion in model container [2022-12-14 10:11:54,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:11:54" (3/3) ... [2022-12-14 10:11:54,976 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2022-12-14 10:11:54,983 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 10:11:54,991 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:11:54,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-12-14 10:11:54,991 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 10:11:55,067 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 10:11:55,099 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 10:11:55,111 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 516 places, 539 transitions, 1094 flow [2022-12-14 10:11:55,113 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 516 places, 539 transitions, 1094 flow [2022-12-14 10:11:55,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 516 places, 539 transitions, 1094 flow [2022-12-14 10:11:55,226 INFO L130 PetriNetUnfolder]: 30/537 cut-off events. [2022-12-14 10:11:55,226 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 10:11:55,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 537 events. 30/537 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 816 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 343. Up to 2 conditions per place. [2022-12-14 10:11:55,235 INFO L119 LiptonReduction]: Number of co-enabled transitions 6986 [2022-12-14 10:12:28,074 INFO L134 LiptonReduction]: Checked pairs total: 45065 [2022-12-14 10:12:28,074 INFO L136 LiptonReduction]: Total number of compositions: 657 [2022-12-14 10:12:28,080 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 123 places, 123 transitions, 262 flow [2022-12-14 10:12:28,185 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4961 states, 4803 states have (on average 2.936706225275869) internal successors, (14105), 4960 states have internal predecessors, (14105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:28,200 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:12:28,204 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;@6aa3134e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:12:28,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-12-14 10:12:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 4961 states, 4803 states have (on average 2.936706225275869) internal successors, (14105), 4960 states have internal predecessors, (14105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 10:12:28,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:28,219 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 10:12:28,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:28,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1935, now seen corresponding path program 1 times [2022-12-14 10:12:28,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:28,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862957338] [2022-12-14 10:12:28,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:12:28,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:28,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862957338] [2022-12-14 10:12:28,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862957338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:28,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:28,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 10:12:28,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843347254] [2022-12-14 10:12:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:28,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 10:12:28,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 10:12:28,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 10:12:28,343 INFO L87 Difference]: Start difference. First operand has 4961 states, 4803 states have (on average 2.936706225275869) internal successors, (14105), 4960 states have internal predecessors, (14105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:28,447 INFO L93 Difference]: Finished difference Result 3497 states and 9991 transitions. [2022-12-14 10:12:28,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 10:12:28,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-12-14 10:12:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:28,472 INFO L225 Difference]: With dead ends: 3497 [2022-12-14 10:12:28,472 INFO L226 Difference]: Without dead ends: 3495 [2022-12-14 10:12:28,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 10:12:28,476 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:28,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:12:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2022-12-14 10:12:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2022-12-14 10:12:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 3468 states have (on average 2.8800461361014995) internal successors, (9988), 3494 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 9988 transitions. [2022-12-14 10:12:28,608 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 9988 transitions. Word has length 1 [2022-12-14 10:12:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:28,608 INFO L495 AbstractCegarLoop]: Abstraction has 3495 states and 9988 transitions. [2022-12-14 10:12:28,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 9988 transitions. [2022-12-14 10:12:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:12:28,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:28,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:28,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:12:28,610 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:28,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1948876192, now seen corresponding path program 1 times [2022-12-14 10:12:28,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:28,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477841222] [2022-12-14 10:12:28,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:28,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:28,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810107362] [2022-12-14 10:12:28,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:28,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:28,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:28,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:28,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 10:12:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:28,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 10:12:28,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:28,788 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-12-14 10:12:28,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:28,809 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-12-14 10:12:28,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:28,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:28,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:28,837 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-12-14 10:12:28,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:28,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:28,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:28,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:28,897 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-12-14 10:12:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:12:28,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:28,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:28,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477841222] [2022-12-14 10:12:28,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:28,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810107362] [2022-12-14 10:12:28,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810107362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:28,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:28,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:12:28,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350373953] [2022-12-14 10:12:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:28,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:12:28,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:12:28,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:28,923 INFO L87 Difference]: Start difference. First operand 3495 states and 9988 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:29,556 INFO L93 Difference]: Finished difference Result 5720 states and 16158 transitions. [2022-12-14 10:12:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:12:29,556 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:12:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:29,579 INFO L225 Difference]: With dead ends: 5720 [2022-12-14 10:12:29,579 INFO L226 Difference]: Without dead ends: 5720 [2022-12-14 10:12:29,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:29,580 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 157 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:29,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 69 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 10:12:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2022-12-14 10:12:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5122. [2022-12-14 10:12:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5122 states, 5095 states have (on average 2.9316977428851816) internal successors, (14937), 5121 states have internal predecessors, (14937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 14937 transitions. [2022-12-14 10:12:29,701 INFO L78 Accepts]: Start accepts. Automaton has 5122 states and 14937 transitions. Word has length 13 [2022-12-14 10:12:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:29,701 INFO L495 AbstractCegarLoop]: Abstraction has 5122 states and 14937 transitions. [2022-12-14 10:12:29,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5122 states and 14937 transitions. [2022-12-14 10:12:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:12:29,704 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:29,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:29,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:29,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:29,905 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:29,905 INFO L85 PathProgramCache]: Analyzing trace with hash 838149197, now seen corresponding path program 1 times [2022-12-14 10:12:29,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:29,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630370358] [2022-12-14 10:12:29,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:29,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:29,918 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:29,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216538238] [2022-12-14 10:12:29,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:29,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:29,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:29,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:29,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 10:12:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:29,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 10:12:29,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:12:30,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:30,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:30,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630370358] [2022-12-14 10:12:30,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:30,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216538238] [2022-12-14 10:12:30,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216538238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:30,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:30,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:12:30,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747983200] [2022-12-14 10:12:30,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:30,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:12:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:30,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:12:30,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:12:30,035 INFO L87 Difference]: Start difference. First operand 5122 states and 14937 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:30,268 INFO L93 Difference]: Finished difference Result 7224 states and 20211 transitions. [2022-12-14 10:12:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:12:30,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:12:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:30,300 INFO L225 Difference]: With dead ends: 7224 [2022-12-14 10:12:30,300 INFO L226 Difference]: Without dead ends: 7224 [2022-12-14 10:12:30,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:30,301 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 229 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:30,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 194 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:12:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2022-12-14 10:12:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 5698. [2022-12-14 10:12:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5671 states have (on average 2.9324634103332747) internal successors, (16630), 5697 states have internal predecessors, (16630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 16630 transitions. [2022-12-14 10:12:30,452 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 16630 transitions. Word has length 13 [2022-12-14 10:12:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:30,453 INFO L495 AbstractCegarLoop]: Abstraction has 5698 states and 16630 transitions. [2022-12-14 10:12:30,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 16630 transitions. [2022-12-14 10:12:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:12:30,454 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:30,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:30,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 10:12:30,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:30,655 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash -833990279, now seen corresponding path program 1 times [2022-12-14 10:12:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:30,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60761730] [2022-12-14 10:12:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:30,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:30,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2099675597] [2022-12-14 10:12:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:30,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:30,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:30,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:30,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 10:12:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:30,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 10:12:30,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:30,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:30,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:30,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:30,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:30,881 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:30,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:30,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:30,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:30,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60761730] [2022-12-14 10:12:30,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:30,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099675597] [2022-12-14 10:12:30,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099675597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:30,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:30,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 10:12:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326807177] [2022-12-14 10:12:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:30,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 10:12:30,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:30,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 10:12:30,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:12:30,912 INFO L87 Difference]: Start difference. First operand 5698 states and 16630 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:31,658 INFO L93 Difference]: Finished difference Result 12121 states and 35429 transitions. [2022-12-14 10:12:31,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:12:31,659 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 10:12:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:31,697 INFO L225 Difference]: With dead ends: 12121 [2022-12-14 10:12:31,697 INFO L226 Difference]: Without dead ends: 12121 [2022-12-14 10:12:31,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:12:31,698 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 299 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:31,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 89 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 10:12:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12121 states. [2022-12-14 10:12:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12121 to 7693. [2022-12-14 10:12:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7693 states, 7666 states have (on average 2.9744325593529872) internal successors, (22802), 7692 states have internal predecessors, (22802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7693 states to 7693 states and 22802 transitions. [2022-12-14 10:12:31,929 INFO L78 Accepts]: Start accepts. Automaton has 7693 states and 22802 transitions. Word has length 15 [2022-12-14 10:12:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:31,930 INFO L495 AbstractCegarLoop]: Abstraction has 7693 states and 22802 transitions. [2022-12-14 10:12:31,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 7693 states and 22802 transitions. [2022-12-14 10:12:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:12:31,931 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:31,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:31,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 10:12:32,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:32,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:32,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:32,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1192140822, now seen corresponding path program 1 times [2022-12-14 10:12:32,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:32,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099859187] [2022-12-14 10:12:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:32,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:32,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:32,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136182174] [2022-12-14 10:12:32,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:32,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:32,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:32,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:32,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 10:12:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:32,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 10:12:32,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:12:32,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:32,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:32,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099859187] [2022-12-14 10:12:32,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:32,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136182174] [2022-12-14 10:12:32,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136182174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:32,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:32,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:12:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851764178] [2022-12-14 10:12:32,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:32,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:12:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:32,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:12:32,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:12:32,460 INFO L87 Difference]: Start difference. First operand 7693 states and 22802 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:32,694 INFO L93 Difference]: Finished difference Result 8560 states and 24995 transitions. [2022-12-14 10:12:32,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:12:32,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 10:12:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:32,715 INFO L225 Difference]: With dead ends: 8560 [2022-12-14 10:12:32,715 INFO L226 Difference]: Without dead ends: 8558 [2022-12-14 10:12:32,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:32,724 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 105 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:32,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 176 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:12:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2022-12-14 10:12:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8287. [2022-12-14 10:12:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8287 states, 8260 states have (on average 2.96319612590799) internal successors, (24476), 8286 states have internal predecessors, (24476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:32,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 24476 transitions. [2022-12-14 10:12:32,906 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 24476 transitions. Word has length 15 [2022-12-14 10:12:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:32,906 INFO L495 AbstractCegarLoop]: Abstraction has 8287 states and 24476 transitions. [2022-12-14 10:12:32,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 24476 transitions. [2022-12-14 10:12:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 10:12:32,908 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:32,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:32,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 10:12:33,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:33,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:33,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:33,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1504330700, now seen corresponding path program 1 times [2022-12-14 10:12:33,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:33,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859043595] [2022-12-14 10:12:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:33,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:33,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184711807] [2022-12-14 10:12:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:33,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:33,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:33,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:33,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 10:12:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:33,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 10:12:33,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:12:33,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:33,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859043595] [2022-12-14 10:12:33,273 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184711807] [2022-12-14 10:12:33,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184711807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:33,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:33,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:12:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738819223] [2022-12-14 10:12:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:33,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:12:33,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:33,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:12:33,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:12:33,275 INFO L87 Difference]: Start difference. First operand 8287 states and 24476 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:33,484 INFO L93 Difference]: Finished difference Result 11641 states and 34100 transitions. [2022-12-14 10:12:33,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:12:33,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 10:12:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:33,509 INFO L225 Difference]: With dead ends: 11641 [2022-12-14 10:12:33,509 INFO L226 Difference]: Without dead ends: 11633 [2022-12-14 10:12:33,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:33,510 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 182 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:33,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 233 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:12:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11633 states. [2022-12-14 10:12:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11633 to 9154. [2022-12-14 10:12:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9154 states, 9127 states have (on average 2.9810452503560865) internal successors, (27208), 9153 states have internal predecessors, (27208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 27208 transitions. [2022-12-14 10:12:33,723 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 27208 transitions. Word has length 17 [2022-12-14 10:12:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:33,724 INFO L495 AbstractCegarLoop]: Abstraction has 9154 states and 27208 transitions. [2022-12-14 10:12:33,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 27208 transitions. [2022-12-14 10:12:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 10:12:33,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:33,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:33,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 10:12:33,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 10:12:33,928 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:33,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2132930699, now seen corresponding path program 1 times [2022-12-14 10:12:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:33,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10847693] [2022-12-14 10:12:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:33,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:33,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:33,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806098987] [2022-12-14 10:12:33,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:33,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:33,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:33,965 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:33,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 10:12:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:34,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 10:12:34,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:34,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:34,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:34,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:34,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:34,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:34,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:12:34,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:12:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:34,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:34,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10847693] [2022-12-14 10:12:34,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:34,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806098987] [2022-12-14 10:12:34,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806098987] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:34,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:34,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2022-12-14 10:12:34,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948218361] [2022-12-14 10:12:34,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:34,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:12:34,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:12:34,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-12-14 10:12:34,365 INFO L87 Difference]: Start difference. First operand 9154 states and 27208 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:34,878 INFO L93 Difference]: Finished difference Result 11634 states and 34334 transitions. [2022-12-14 10:12:34,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:12:34,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 10:12:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:34,899 INFO L225 Difference]: With dead ends: 11634 [2022-12-14 10:12:34,899 INFO L226 Difference]: Without dead ends: 11634 [2022-12-14 10:12:34,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-12-14 10:12:34,900 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 74 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:34,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 54 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:12:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2022-12-14 10:12:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 9834. [2022-12-14 10:12:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9834 states, 9807 states have (on average 2.972366676863465) internal successors, (29150), 9833 states have internal predecessors, (29150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9834 states to 9834 states and 29150 transitions. [2022-12-14 10:12:35,073 INFO L78 Accepts]: Start accepts. Automaton has 9834 states and 29150 transitions. Word has length 18 [2022-12-14 10:12:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:35,073 INFO L495 AbstractCegarLoop]: Abstraction has 9834 states and 29150 transitions. [2022-12-14 10:12:35,073 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-12-14 10:12:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 9834 states and 29150 transitions. [2022-12-14 10:12:35,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 10:12:35,075 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:35,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:35,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 10:12:35,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:35,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:35,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:35,276 INFO L85 PathProgramCache]: Analyzing trace with hash -7667097, now seen corresponding path program 1 times [2022-12-14 10:12:35,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:35,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043048621] [2022-12-14 10:12:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:35,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:35,286 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:35,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842189579] [2022-12-14 10:12:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:35,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:35,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:35,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:35,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 10:12:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:35,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 10:12:35,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:35,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:35,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:35,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:35,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:35,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:35,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:35,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:35,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043048621] [2022-12-14 10:12:35,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842189579] [2022-12-14 10:12:35,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842189579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:35,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:35,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:12:35,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134917883] [2022-12-14 10:12:35,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:35,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 10:12:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:35,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 10:12:35,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:12:35,581 INFO L87 Difference]: Start difference. First operand 9834 states and 29150 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:36,621 INFO L93 Difference]: Finished difference Result 15553 states and 45131 transitions. [2022-12-14 10:12:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:12:36,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 10:12:36,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:36,657 INFO L225 Difference]: With dead ends: 15553 [2022-12-14 10:12:36,657 INFO L226 Difference]: Without dead ends: 15553 [2022-12-14 10:12:36,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-12-14 10:12:36,658 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 581 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:36,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 165 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 10:12:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15553 states. [2022-12-14 10:12:36,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15553 to 12466. [2022-12-14 10:12:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12466 states, 12439 states have (on average 2.9876999758823057) internal successors, (37164), 12465 states have internal predecessors, (37164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37164 transitions. [2022-12-14 10:12:36,974 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37164 transitions. Word has length 21 [2022-12-14 10:12:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:36,974 INFO L495 AbstractCegarLoop]: Abstraction has 12466 states and 37164 transitions. [2022-12-14 10:12:36,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37164 transitions. [2022-12-14 10:12:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 10:12:36,976 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:36,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:36,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 10:12:37,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 10:12:37,178 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:37,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1022962521, now seen corresponding path program 1 times [2022-12-14 10:12:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:37,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564310586] [2022-12-14 10:12:37,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:37,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:37,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:37,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739092794] [2022-12-14 10:12:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:37,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:37,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:37,219 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:37,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 10:12:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:37,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 10:12:37,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:37,328 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-12-14 10:12:37,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:37,339 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-12-14 10:12:37,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:37,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:37,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:37,358 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-12-14 10:12:37,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:37,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:37,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:37,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:37,380 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-12-14 10:12:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:12:37,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:37,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:37,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564310586] [2022-12-14 10:12:37,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:37,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739092794] [2022-12-14 10:12:37,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739092794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:37,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:37,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:12:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944855781] [2022-12-14 10:12:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:37,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:12:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:37,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:12:37,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:37,404 INFO L87 Difference]: Start difference. First operand 12466 states and 37164 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:37,879 INFO L93 Difference]: Finished difference Result 12564 states and 37342 transitions. [2022-12-14 10:12:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:12:37,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 10:12:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:37,901 INFO L225 Difference]: With dead ends: 12564 [2022-12-14 10:12:37,901 INFO L226 Difference]: Without dead ends: 12386 [2022-12-14 10:12:37,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:37,902 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 106 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:37,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 63 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:12:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2022-12-14 10:12:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12365. [2022-12-14 10:12:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12365 states, 12339 states have (on average 2.9803873895777615) internal successors, (36775), 12364 states have internal predecessors, (36775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12365 states to 12365 states and 36775 transitions. [2022-12-14 10:12:38,144 INFO L78 Accepts]: Start accepts. Automaton has 12365 states and 36775 transitions. Word has length 22 [2022-12-14 10:12:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:38,144 INFO L495 AbstractCegarLoop]: Abstraction has 12365 states and 36775 transitions. [2022-12-14 10:12:38,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 12365 states and 36775 transitions. [2022-12-14 10:12:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 10:12:38,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:38,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:38,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:38,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:38,349 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:38,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1047383264, now seen corresponding path program 1 times [2022-12-14 10:12:38,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:38,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984214403] [2022-12-14 10:12:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:38,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:38,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:38,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825153603] [2022-12-14 10:12:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:38,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:38,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:38,405 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:38,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 10:12:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:38,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 10:12:38,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:38,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-12-14 10:12:38,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2022-12-14 10:12:38,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:38,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2022-12-14 10:12:38,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:38,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 77 [2022-12-14 10:12:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:38,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:38,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:38,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984214403] [2022-12-14 10:12:38,612 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:38,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825153603] [2022-12-14 10:12:38,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825153603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:38,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:38,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:12:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069193286] [2022-12-14 10:12:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:38,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:12:38,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:38,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:12:38,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:38,614 INFO L87 Difference]: Start difference. First operand 12365 states and 36775 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:39,272 INFO L93 Difference]: Finished difference Result 13426 states and 39809 transitions. [2022-12-14 10:12:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:12:39,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 10:12:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:39,297 INFO L225 Difference]: With dead ends: 13426 [2022-12-14 10:12:39,297 INFO L226 Difference]: Without dead ends: 13426 [2022-12-14 10:12:39,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:39,298 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 66 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:39,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 60 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 10:12:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13426 states. [2022-12-14 10:12:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13426 to 12964. [2022-12-14 10:12:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12964 states, 12939 states have (on average 2.973722853388979) internal successors, (38477), 12963 states have internal predecessors, (38477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12964 states to 12964 states and 38477 transitions. [2022-12-14 10:12:39,505 INFO L78 Accepts]: Start accepts. Automaton has 12964 states and 38477 transitions. Word has length 24 [2022-12-14 10:12:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:39,505 INFO L495 AbstractCegarLoop]: Abstraction has 12964 states and 38477 transitions. [2022-12-14 10:12:39,505 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-12-14 10:12:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 12964 states and 38477 transitions. [2022-12-14 10:12:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 10:12:39,508 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:39,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:39,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:39,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 10:12:39,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash 91647581, now seen corresponding path program 1 times [2022-12-14 10:12:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:39,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258419924] [2022-12-14 10:12:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:39,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:39,745 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:39,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [686347847] [2022-12-14 10:12:39,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:39,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:39,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:39,747 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:39,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 10:12:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:39,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 10:12:39,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:39,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:39,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:39,951 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 18 treesize of output 20 [2022-12-14 10:12:39,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:39,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:39,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:40,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:40,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:40,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:40,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:40,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258419924] [2022-12-14 10:12:40,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:40,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686347847] [2022-12-14 10:12:40,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686347847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:40,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:40,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 10:12:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515179533] [2022-12-14 10:12:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:40,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 10:12:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:40,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 10:12:40,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:12:40,040 INFO L87 Difference]: Start difference. First operand 12964 states and 38477 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:40,823 INFO L93 Difference]: Finished difference Result 16689 states and 48753 transitions. [2022-12-14 10:12:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 10:12:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 10:12:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:40,859 INFO L225 Difference]: With dead ends: 16689 [2022-12-14 10:12:40,859 INFO L226 Difference]: Without dead ends: 16689 [2022-12-14 10:12:40,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-12-14 10:12:40,859 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 196 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:40,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 137 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 10:12:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16689 states. [2022-12-14 10:12:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16689 to 13428. [2022-12-14 10:12:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13428 states, 13403 states have (on average 2.9770200701335523) internal successors, (39901), 13427 states have internal predecessors, (39901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13428 states to 13428 states and 39901 transitions. [2022-12-14 10:12:41,164 INFO L78 Accepts]: Start accepts. Automaton has 13428 states and 39901 transitions. Word has length 25 [2022-12-14 10:12:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:41,164 INFO L495 AbstractCegarLoop]: Abstraction has 13428 states and 39901 transitions. [2022-12-14 10:12:41,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 13428 states and 39901 transitions. [2022-12-14 10:12:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 10:12:41,167 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:41,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:41,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:41,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 10:12:41,368 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 496938431, now seen corresponding path program 1 times [2022-12-14 10:12:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:41,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293120109] [2022-12-14 10:12:41,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:41,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:41,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:41,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362621779] [2022-12-14 10:12:41,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:41,397 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:41,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 10:12:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:41,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 10:12:41,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:41,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-12-14 10:12:41,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:41,596 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-12-14 10:12:41,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:41,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:41,615 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-12-14 10:12:41,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:41,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:41,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:41,639 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-12-14 10:12:41,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:41,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:12:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:41,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:41,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:41,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293120109] [2022-12-14 10:12:41,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:41,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362621779] [2022-12-14 10:12:41,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362621779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:41,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:41,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 10:12:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010730859] [2022-12-14 10:12:41,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:41,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 10:12:41,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:41,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 10:12:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:12:41,689 INFO L87 Difference]: Start difference. First operand 13428 states and 39901 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:42,526 INFO L93 Difference]: Finished difference Result 16791 states and 49002 transitions. [2022-12-14 10:12:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:12:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 10:12:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:42,553 INFO L225 Difference]: With dead ends: 16791 [2022-12-14 10:12:42,553 INFO L226 Difference]: Without dead ends: 16767 [2022-12-14 10:12:42,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 10:12:42,554 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 145 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:42,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 104 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 10:12:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16767 states. [2022-12-14 10:12:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16767 to 12828. [2022-12-14 10:12:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12828 states, 12803 states have (on average 2.9685230024213074) internal successors, (38006), 12827 states have internal predecessors, (38006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12828 states to 12828 states and 38006 transitions. [2022-12-14 10:12:42,745 INFO L78 Accepts]: Start accepts. Automaton has 12828 states and 38006 transitions. Word has length 25 [2022-12-14 10:12:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:42,745 INFO L495 AbstractCegarLoop]: Abstraction has 12828 states and 38006 transitions. [2022-12-14 10:12:42,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 12828 states and 38006 transitions. [2022-12-14 10:12:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 10:12:42,748 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:42,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:42,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 10:12:42,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 10:12:42,949 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:42,951 INFO L85 PathProgramCache]: Analyzing trace with hash -73131835, now seen corresponding path program 1 times [2022-12-14 10:12:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:42,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59518415] [2022-12-14 10:12:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:42,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:42,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149342406] [2022-12-14 10:12:42,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:42,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:43,000 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:43,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 10:12:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:43,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 10:12:43,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:12:43,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:12:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:12:43,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:43,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59518415] [2022-12-14 10:12:43,223 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:43,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149342406] [2022-12-14 10:12:43,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149342406] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:12:43,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1216987216] [2022-12-14 10:12:43,230 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:337) 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-12-14 10:12:43,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:12:43,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-12-14 10:12:43,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062520332] [2022-12-14 10:12:43,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:12:43,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 10:12:43,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 10:12:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:12:43,232 INFO L87 Difference]: Start difference. First operand 12828 states and 38006 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:43,808 INFO L93 Difference]: Finished difference Result 22207 states and 64542 transitions. [2022-12-14 10:12:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:12:43,809 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 10:12:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:43,848 INFO L225 Difference]: With dead ends: 22207 [2022-12-14 10:12:43,848 INFO L226 Difference]: Without dead ends: 21167 [2022-12-14 10:12:43,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-12-14 10:12:43,849 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 286 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:43,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 466 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:12:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21167 states. [2022-12-14 10:12:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21167 to 19081. [2022-12-14 10:12:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19081 states, 19056 states have (on average 3.008028967254408) internal successors, (57321), 19080 states have internal predecessors, (57321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19081 states to 19081 states and 57321 transitions. [2022-12-14 10:12:44,187 INFO L78 Accepts]: Start accepts. Automaton has 19081 states and 57321 transitions. Word has length 28 [2022-12-14 10:12:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:44,187 INFO L495 AbstractCegarLoop]: Abstraction has 19081 states and 57321 transitions. [2022-12-14 10:12:44,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19081 states and 57321 transitions. [2022-12-14 10:12:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:12:44,191 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:44,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:44,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 10:12:44,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:44,392 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:44,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1757145969, now seen corresponding path program 2 times [2022-12-14 10:12:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:44,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358146643] [2022-12-14 10:12:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:44,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:44,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:44,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695455985] [2022-12-14 10:12:44,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:12:44,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:44,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:44,445 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:44,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 10:12:44,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 10:12:44,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:12:44,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 10:12:44,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:44,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:44,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:44,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:44,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:44,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:44,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 10:12:44,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:44,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:44,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358146643] [2022-12-14 10:12:44,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:44,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695455985] [2022-12-14 10:12:44,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695455985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:44,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:44,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:12:44,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251093404] [2022-12-14 10:12:44,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:44,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:12:44,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:12:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:44,664 INFO L87 Difference]: Start difference. First operand 19081 states and 57321 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:45,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:45,034 INFO L93 Difference]: Finished difference Result 21419 states and 64260 transitions. [2022-12-14 10:12:45,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:12:45,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 10:12:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:45,075 INFO L225 Difference]: With dead ends: 21419 [2022-12-14 10:12:45,075 INFO L226 Difference]: Without dead ends: 21419 [2022-12-14 10:12:45,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:45,076 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 78 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:45,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 54 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:12:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21419 states. [2022-12-14 10:12:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21419 to 19921. [2022-12-14 10:12:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19921 states, 19900 states have (on average 3.006030150753769) internal successors, (59820), 19920 states have internal predecessors, (59820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19921 states to 19921 states and 59820 transitions. [2022-12-14 10:12:45,383 INFO L78 Accepts]: Start accepts. Automaton has 19921 states and 59820 transitions. Word has length 30 [2022-12-14 10:12:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:45,383 INFO L495 AbstractCegarLoop]: Abstraction has 19921 states and 59820 transitions. [2022-12-14 10:12:45,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:45,383 INFO L276 IsEmpty]: Start isEmpty. Operand 19921 states and 59820 transitions. [2022-12-14 10:12:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:12:45,387 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:45,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:45,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:45,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:45,588 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:45,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1292451706, now seen corresponding path program 1 times [2022-12-14 10:12:45,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:45,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018381194] [2022-12-14 10:12:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:45,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:45,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739102970] [2022-12-14 10:12:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:45,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:45,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:45,629 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:45,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 10:12:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:45,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 10:12:45,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:45,787 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 10:12:45,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 10:12:45,814 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:12:45,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:12:45,840 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:12:45,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 10:12:45,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:45,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:45,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:46,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:46,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-12-14 10:12:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 10:12:46,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:46,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:46,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018381194] [2022-12-14 10:12:46,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:46,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739102970] [2022-12-14 10:12:46,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739102970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:46,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:46,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:12:46,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638718370] [2022-12-14 10:12:46,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:46,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 10:12:46,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:46,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 10:12:46,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:12:46,082 INFO L87 Difference]: Start difference. First operand 19921 states and 59820 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:46,805 INFO L93 Difference]: Finished difference Result 25553 states and 75637 transitions. [2022-12-14 10:12:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:12:46,806 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 10:12:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:46,893 INFO L225 Difference]: With dead ends: 25553 [2022-12-14 10:12:46,893 INFO L226 Difference]: Without dead ends: 25553 [2022-12-14 10:12:46,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:12:46,893 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 380 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:46,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 98 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:12:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25553 states. [2022-12-14 10:12:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25553 to 21269. [2022-12-14 10:12:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21269 states, 21248 states have (on average 3.0103539156626504) internal successors, (63964), 21268 states have internal predecessors, (63964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 63964 transitions. [2022-12-14 10:12:47,251 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 63964 transitions. Word has length 30 [2022-12-14 10:12:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:47,251 INFO L495 AbstractCegarLoop]: Abstraction has 21269 states and 63964 transitions. [2022-12-14 10:12:47,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 63964 transitions. [2022-12-14 10:12:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:12:47,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:47,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:47,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:47,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 10:12:47,457 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1200148282, now seen corresponding path program 1 times [2022-12-14 10:12:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:47,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584431813] [2022-12-14 10:12:47,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:47,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:47,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:47,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210835590] [2022-12-14 10:12:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:47,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:47,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:47,494 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:47,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 10:12:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:47,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 10:12:47,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:47,691 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 10:12:47,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 10:12:47,711 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:12:47,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:12:47,728 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:12:47,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 10:12:47,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:47,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:47,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:47,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:47,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-12-14 10:12:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:12:47,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:12:48,001 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_thread2Thread1of1ForFork1_~i~1 4))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 3 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse0 c_~B~0.offset 1)) 0)))) is different from false [2022-12-14 10:12:48,023 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (+ .cse2 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0)))))) is different from false [2022-12-14 10:12:48,043 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse3 (+ .cse2 2 c_~B~0.offset)) (.cse1 (+ .cse2 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse1) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse2 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse3) 0)))))) is different from false [2022-12-14 10:12:48,062 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse4 (+ .cse1 c_~B~0.offset 1)) (.cse2 (+ .cse1 2 c_~B~0.offset)) (.cse3 (+ .cse1 3 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse4 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_1920 (Array Int Int))) (= 0 (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse3))) (forall ((v_ArrVal_1920 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1920) c_~B~0.base) .cse4) 0)))))) is different from false [2022-12-14 10:12:48,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:48,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2022-12-14 10:12:48,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:48,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2022-12-14 10:12:48,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-12-14 10:12:48,092 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-12-14 10:12:48,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2022-12-14 10:12:48,098 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-12-14 10:12:48,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-12-14 10:12:48,103 INFO L321 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-12-14 10:12:48,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-12-14 10:12:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:12:48,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:48,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584431813] [2022-12-14 10:12:48,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:48,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210835590] [2022-12-14 10:12:48,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210835590] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:48,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:48,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2022-12-14 10:12:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140272838] [2022-12-14 10:12:48,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:48,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 10:12:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:48,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 10:12:48,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=209, Unknown=4, NotChecked=132, Total=420 [2022-12-14 10:12:48,202 INFO L87 Difference]: Start difference. First operand 21269 states and 63964 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:50,123 INFO L93 Difference]: Finished difference Result 31193 states and 93161 transitions. [2022-12-14 10:12:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 10:12:50,124 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 10:12:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:50,204 INFO L225 Difference]: With dead ends: 31193 [2022-12-14 10:12:50,204 INFO L226 Difference]: Without dead ends: 31193 [2022-12-14 10:12:50,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=461, Unknown=5, NotChecked=196, Total=812 [2022-12-14 10:12:50,205 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 339 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 21 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 753 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:50,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 52 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 388 Invalid, 17 Unknown, 753 Unchecked, 1.1s Time] [2022-12-14 10:12:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31193 states. [2022-12-14 10:12:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31193 to 22104. [2022-12-14 10:12:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22104 states, 22083 states have (on average 3.0137662455282346) internal successors, (66553), 22103 states have internal predecessors, (66553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22104 states to 22104 states and 66553 transitions. [2022-12-14 10:12:50,703 INFO L78 Accepts]: Start accepts. Automaton has 22104 states and 66553 transitions. Word has length 30 [2022-12-14 10:12:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:50,703 INFO L495 AbstractCegarLoop]: Abstraction has 22104 states and 66553 transitions. [2022-12-14 10:12:50,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 22104 states and 66553 transitions. [2022-12-14 10:12:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:12:50,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:50,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:50,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 10:12:50,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 10:12:50,908 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:50,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:50,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1199936242, now seen corresponding path program 2 times [2022-12-14 10:12:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:50,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508592789] [2022-12-14 10:12:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:50,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:50,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258467927] [2022-12-14 10:12:50,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:12:50,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:50,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:50,967 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:50,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 10:12:51,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 10:12:51,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:12:51,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 10:12:51,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:51,147 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-12-14 10:12:51,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-12-14 10:12:51,167 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:12:51,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:12:51,179 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:12:51,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 10:12:51,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:51,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:51,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:51,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-12-14 10:12:51,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:51,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 10:12:51,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:51,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:51,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508592789] [2022-12-14 10:12:51,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:51,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258467927] [2022-12-14 10:12:51,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258467927] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:51,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:51,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 10:12:51,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646196435] [2022-12-14 10:12:51,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:51,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 10:12:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 10:12:51,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:12:51,374 INFO L87 Difference]: Start difference. First operand 22104 states and 66553 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:52,321 INFO L93 Difference]: Finished difference Result 41723 states and 125993 transitions. [2022-12-14 10:12:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:12:52,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 10:12:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:52,416 INFO L225 Difference]: With dead ends: 41723 [2022-12-14 10:12:52,416 INFO L226 Difference]: Without dead ends: 41723 [2022-12-14 10:12:52,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:12:52,417 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 384 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:52,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 87 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 10:12:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41723 states. [2022-12-14 10:12:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41723 to 35828. [2022-12-14 10:12:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35828 states, 35807 states have (on average 3.0761303655709775) internal successors, (110147), 35827 states have internal predecessors, (110147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:53,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35828 states to 35828 states and 110147 transitions. [2022-12-14 10:12:53,040 INFO L78 Accepts]: Start accepts. Automaton has 35828 states and 110147 transitions. Word has length 30 [2022-12-14 10:12:53,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:53,040 INFO L495 AbstractCegarLoop]: Abstraction has 35828 states and 110147 transitions. [2022-12-14 10:12:53,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:53,040 INFO L276 IsEmpty]: Start isEmpty. Operand 35828 states and 110147 transitions. [2022-12-14 10:12:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:12:53,046 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:53,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:53,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:53,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:53,247 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1488324223, now seen corresponding path program 1 times [2022-12-14 10:12:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:53,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090900594] [2022-12-14 10:12:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:53,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:53,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:53,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583367094] [2022-12-14 10:12:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:53,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:53,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:53,288 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:53,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 10:12:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:53,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 10:12:53,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:53,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:53,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:53,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:53,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:53,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:12:53,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:53,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:53,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090900594] [2022-12-14 10:12:53,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583367094] [2022-12-14 10:12:53,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583367094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:53,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:53,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:12:53,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59866151] [2022-12-14 10:12:53,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:53,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:12:53,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:53,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:12:53,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:53,479 INFO L87 Difference]: Start difference. First operand 35828 states and 110147 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:54,086 INFO L93 Difference]: Finished difference Result 38160 states and 117128 transitions. [2022-12-14 10:12:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:12:54,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 10:12:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:54,173 INFO L225 Difference]: With dead ends: 38160 [2022-12-14 10:12:54,173 INFO L226 Difference]: Without dead ends: 38140 [2022-12-14 10:12:54,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:54,174 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:54,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 61 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:12:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38140 states. [2022-12-14 10:12:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38140 to 38140. [2022-12-14 10:12:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38140 states, 38119 states have (on average 3.071145622917705) internal successors, (117069), 38139 states have internal predecessors, (117069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38140 states to 38140 states and 117069 transitions. [2022-12-14 10:12:54,860 INFO L78 Accepts]: Start accepts. Automaton has 38140 states and 117069 transitions. Word has length 30 [2022-12-14 10:12:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:54,861 INFO L495 AbstractCegarLoop]: Abstraction has 38140 states and 117069 transitions. [2022-12-14 10:12:54,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 38140 states and 117069 transitions. [2022-12-14 10:12:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 10:12:54,868 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:54,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:54,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:55,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 10:12:55,070 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash 866280883, now seen corresponding path program 1 times [2022-12-14 10:12:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:55,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314203866] [2022-12-14 10:12:55,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:55,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:55,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492236455] [2022-12-14 10:12:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:55,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:55,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:55,140 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:55,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 10:12:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:55,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 10:12:55,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:55,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:55,373 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-14 10:12:55,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2022-12-14 10:12:55,399 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 10:12:55,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 10:12:55,423 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 10:12:55,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 10:12:55,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:12:55,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:12:55,537 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 18 treesize of output 20 [2022-12-14 10:12:55,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:12:55,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:12:55,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:12:55,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-12-14 10:12:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 10:12:55,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:55,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:55,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314203866] [2022-12-14 10:12:55,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:55,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492236455] [2022-12-14 10:12:55,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492236455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:55,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:55,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 10:12:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597648168] [2022-12-14 10:12:55,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 10:12:55,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:55,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 10:12:55,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:12:55,648 INFO L87 Difference]: Start difference. First operand 38140 states and 117069 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:57,024 INFO L93 Difference]: Finished difference Result 43474 states and 132302 transitions. [2022-12-14 10:12:57,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:12:57,025 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 10:12:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:57,125 INFO L225 Difference]: With dead ends: 43474 [2022-12-14 10:12:57,125 INFO L226 Difference]: Without dead ends: 43474 [2022-12-14 10:12:57,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-12-14 10:12:57,126 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 313 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:57,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 122 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 10:12:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43474 states. [2022-12-14 10:12:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43474 to 36314. [2022-12-14 10:12:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36314 states, 36293 states have (on average 3.06860827156752) internal successors, (111369), 36313 states have internal predecessors, (111369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36314 states to 36314 states and 111369 transitions. [2022-12-14 10:12:57,883 INFO L78 Accepts]: Start accepts. Automaton has 36314 states and 111369 transitions. Word has length 32 [2022-12-14 10:12:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:57,883 INFO L495 AbstractCegarLoop]: Abstraction has 36314 states and 111369 transitions. [2022-12-14 10:12:57,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 36314 states and 111369 transitions. [2022-12-14 10:12:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 10:12:57,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:57,889 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:57,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 10:12:58,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:58,090 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash 795795028, now seen corresponding path program 1 times [2022-12-14 10:12:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:58,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731203230] [2022-12-14 10:12:58,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:58,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:58,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564976543] [2022-12-14 10:12:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:58,165 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:58,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 10:12:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:58,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 10:12:58,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:58,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:12:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:58,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:58,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731203230] [2022-12-14 10:12:58,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:12:58,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564976543] [2022-12-14 10:12:58,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564976543] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:58,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:58,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 10:12:58,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538599860] [2022-12-14 10:12:58,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:58,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:12:58,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:12:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:58,480 INFO L87 Difference]: Start difference. First operand 36314 states and 111369 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:58,695 INFO L93 Difference]: Finished difference Result 37351 states and 114254 transitions. [2022-12-14 10:12:58,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:12:58,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 10:12:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:58,779 INFO L225 Difference]: With dead ends: 37351 [2022-12-14 10:12:58,779 INFO L226 Difference]: Without dead ends: 37351 [2022-12-14 10:12:58,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:12:58,780 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 107 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:58,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 74 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:12:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37351 states. [2022-12-14 10:12:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37351 to 37349. [2022-12-14 10:12:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37349 states, 37327 states have (on average 3.0608406783293596) internal successors, (114252), 37348 states have internal predecessors, (114252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37349 states to 37349 states and 114252 transitions. [2022-12-14 10:12:59,488 INFO L78 Accepts]: Start accepts. Automaton has 37349 states and 114252 transitions. Word has length 32 [2022-12-14 10:12:59,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:59,489 INFO L495 AbstractCegarLoop]: Abstraction has 37349 states and 114252 transitions. [2022-12-14 10:12:59,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:12:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 37349 states and 114252 transitions. [2022-12-14 10:12:59,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 10:12:59,495 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:59,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:59,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 10:12:59,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:59,697 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:12:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash 640232474, now seen corresponding path program 1 times [2022-12-14 10:12:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:59,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768350530] [2022-12-14 10:12:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:59,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:12:59,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373308491] [2022-12-14 10:12:59,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:59,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:59,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:59,775 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:59,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 10:12:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:59,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 10:12:59,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:13:00,072 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-12-14 10:13:00,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:13:00,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:13:00,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 10:13:00,267 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-12-14 10:13:00,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,294 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-12-14 10:13:00,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,336 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-12-14 10:13:00,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,380 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-12-14 10:13:00,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:00,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:00,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:00,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:00,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:00,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:00,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:00,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:00,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:00,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:13:00,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:13:00,759 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2870 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_2870 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2870 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2870 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-12-14 10:13:00,784 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-12-14 10:13:01,004 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2865) c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2865) c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2865) c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2865) c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-12-14 10:13:01,027 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2865) c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2865) c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2865) c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_2865) c_~F~0.base v_ArrVal_2869) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_2870) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0))))) is different from false [2022-12-14 10:13:01,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:01,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2022-12-14 10:13:01,180 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:01,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 516 treesize of output 478 [2022-12-14 10:13:01,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 430 treesize of output 414 [2022-12-14 10:13:01,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 406 [2022-12-14 10:13:01,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 374 [2022-12-14 10:13:01,651 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|)) (forall ((v_ArrVal_2853 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2853) c_~B~0.base) c_~B~0.offset))))) is different from false [2022-12-14 10:13:01,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:01,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 10:13:01,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:13:01,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:01,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-12-14 10:13:01,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-12-14 10:13:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:13:01,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:13:01,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768350530] [2022-12-14 10:13:01,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:13:01,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373308491] [2022-12-14 10:13:01,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373308491] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:13:01,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [885515426] [2022-12-14 10:13:01,879 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:337) 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-12-14 10:13:01,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:13:01,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-12-14 10:13:01,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344725721] [2022-12-14 10:13:01,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:13:01,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:13:01,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:13:01,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:13:01,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=625, Unknown=42, NotChecked=280, Total=1056 [2022-12-14 10:13:01,882 INFO L87 Difference]: Start difference. First operand 37349 states and 114252 transitions. Second operand has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:03,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-12-14 10:13:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:13:09,562 INFO L93 Difference]: Finished difference Result 63910 states and 189660 transitions. [2022-12-14 10:13:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 10:13:09,563 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 10:13:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:13:09,714 INFO L225 Difference]: With dead ends: 63910 [2022-12-14 10:13:09,714 INFO L226 Difference]: Without dead ends: 63907 [2022-12-14 10:13:09,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=496, Invalid=1803, Unknown=73, NotChecked=490, Total=2862 [2022-12-14 10:13:09,716 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 944 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 3808 mSolverCounterSat, 265 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 5813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 3808 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1739 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:13:09,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 237 Invalid, 5813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 3808 Invalid, 1 Unknown, 1739 Unchecked, 5.6s Time] [2022-12-14 10:13:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63907 states. [2022-12-14 10:13:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63907 to 46080. [2022-12-14 10:13:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46080 states, 46058 states have (on average 3.0698032915020192) internal successors, (141389), 46079 states have internal predecessors, (141389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46080 states to 46080 states and 141389 transitions. [2022-12-14 10:13:10,620 INFO L78 Accepts]: Start accepts. Automaton has 46080 states and 141389 transitions. Word has length 32 [2022-12-14 10:13:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:13:10,621 INFO L495 AbstractCegarLoop]: Abstraction has 46080 states and 141389 transitions. [2022-12-14 10:13:10,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 46080 states and 141389 transitions. [2022-12-14 10:13:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 10:13:10,628 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:13:10,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:13:10,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 10:13:10,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 10:13:10,829 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:13:10,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:13:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1209825126, now seen corresponding path program 1 times [2022-12-14 10:13:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:13:10,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583441339] [2022-12-14 10:13:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:10,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:13:10,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:13:10,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728309448] [2022-12-14 10:13:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:10,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:13:10,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:13:10,883 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:13:10,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 10:13:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:13:11,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 10:13:11,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:13:11,102 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-12-14 10:13:11,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:11,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:13:11,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13: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 25 treesize of output 25 [2022-12-14 10:13:11,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 10:13:11,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 10:13:11,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:11,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 10:13:11,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-14 10:13:11,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:11,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 10:13:11,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:11,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-12-14 10:13:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:13:11,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:13:11,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3039 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3039) |c_thread2Thread1of1ForFork1_#t~mem6.base|) (+ |c_thread2Thread1of1ForFork1_#t~mem6.offset| (* c_thread2Thread1of1ForFork1_~j~0 4))) |c_thread2Thread1of1ForFork1_#t~nondet8|)) is different from false [2022-12-14 10:13:11,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:11,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 10:13:11,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-12-14 10:13:11,464 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3035 (Array Int Int)) (v_ArrVal_3036 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3035) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3036) c_~B~0.base) c_~B~0.offset)))) is different from false [2022-12-14 10:13:11,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:11,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 10:13:11,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:11,473 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 135 treesize of output 129 [2022-12-14 10:13:11,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-12-14 10:13:11,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 10:13:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-14 10:13:11,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:13:11,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583441339] [2022-12-14 10:13:11,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:13:11,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728309448] [2022-12-14 10:13:11,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728309448] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:13:11,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [607483161] [2022-12-14 10:13:11,555 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:337) 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-12-14 10:13:11,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:13:11,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2022-12-14 10:13:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139617917] [2022-12-14 10:13:11,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:13:11,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 10:13:11,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:13:11,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 10:13:11,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=358, Unknown=5, NotChecked=78, Total=506 [2022-12-14 10:13:11,557 INFO L87 Difference]: Start difference. First operand 46080 states and 141389 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:13:14,144 INFO L93 Difference]: Finished difference Result 56435 states and 170943 transitions. [2022-12-14 10:13:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 10:13:14,145 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 10:13:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:13:14,283 INFO L225 Difference]: With dead ends: 56435 [2022-12-14 10:13:14,283 INFO L226 Difference]: Without dead ends: 56435 [2022-12-14 10:13:14,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=922, Unknown=5, NotChecked=130, Total=1260 [2022-12-14 10:13:14,284 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 589 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 3313 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 3858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:13:14,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 427 Invalid, 3858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3313 Invalid, 0 Unknown, 523 Unchecked, 2.1s Time] [2022-12-14 10:13:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56435 states. [2022-12-14 10:13:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56435 to 49197. [2022-12-14 10:13:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49197 states, 49175 states have (on average 3.0721504829689885) internal successors, (151073), 49196 states have internal predecessors, (151073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49197 states to 49197 states and 151073 transitions. [2022-12-14 10:13:15,464 INFO L78 Accepts]: Start accepts. Automaton has 49197 states and 151073 transitions. Word has length 32 [2022-12-14 10:13:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:13:15,464 INFO L495 AbstractCegarLoop]: Abstraction has 49197 states and 151073 transitions. [2022-12-14 10:13:15,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 49197 states and 151073 transitions. [2022-12-14 10:13:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 10:13:15,473 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:13:15,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:13:15,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 10:13:15,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 10:13:15,674 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:13:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:13:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1509558320, now seen corresponding path program 2 times [2022-12-14 10:13:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:13:15,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508097905] [2022-12-14 10:13:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:13:15,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:13:15,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945452185] [2022-12-14 10:13:15,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:13:15,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:13:15,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:13:15,699 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:13:15,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 10:13:15,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 10:13:15,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:13:15,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 10:13:15,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:13:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:13:16,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:13:16,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:13:16,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508097905] [2022-12-14 10:13:16,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:13:16,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945452185] [2022-12-14 10:13:16,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945452185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:13:16,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:13:16,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:13:16,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328435797] [2022-12-14 10:13:16,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:13:16,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:13:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:13:16,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:13:16,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:13:16,019 INFO L87 Difference]: Start difference. First operand 49197 states and 151073 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:13:16,506 INFO L93 Difference]: Finished difference Result 49346 states and 151382 transitions. [2022-12-14 10:13:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:13:16,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 10:13:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:13:16,628 INFO L225 Difference]: With dead ends: 49346 [2022-12-14 10:13:16,628 INFO L226 Difference]: Without dead ends: 49196 [2022-12-14 10:13:16,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:13:16,629 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:13:16,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 220 Invalid, 198 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:13:16,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49196 states. [2022-12-14 10:13:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49196 to 49196. [2022-12-14 10:13:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49196 states, 49174 states have (on average 3.0721519502175947) internal successors, (151070), 49195 states have internal predecessors, (151070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49196 states to 49196 states and 151070 transitions. [2022-12-14 10:13:17,549 INFO L78 Accepts]: Start accepts. Automaton has 49196 states and 151070 transitions. Word has length 32 [2022-12-14 10:13:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:13:17,549 INFO L495 AbstractCegarLoop]: Abstraction has 49196 states and 151070 transitions. [2022-12-14 10:13:17,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 49196 states and 151070 transitions. [2022-12-14 10:13:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 10:13:17,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:13:17,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:13:17,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 10:13:17,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 10:13:17,759 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:13:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:13:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1575191366, now seen corresponding path program 1 times [2022-12-14 10:13:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:13:17,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659537692] [2022-12-14 10:13:17,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:17,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:13:17,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:13:17,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318601015] [2022-12-14 10:13:17,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:17,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:13:17,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:13:17,789 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:13:17,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 10:13:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:13:17,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 10:13:17,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:13:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:13:18,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:13:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:13:18,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:13:18,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659537692] [2022-12-14 10:13:18,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:13:18,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318601015] [2022-12-14 10:13:18,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318601015] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 10:13:18,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:13:18,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 10:13:18,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657560144] [2022-12-14 10:13:18,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:13:18,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:13:18,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:13:18,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:13:18,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:13:18,035 INFO L87 Difference]: Start difference. First operand 49196 states and 151070 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:13:18,276 INFO L93 Difference]: Finished difference Result 48710 states and 149645 transitions. [2022-12-14 10:13:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:13:18,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-12-14 10:13:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:13:18,391 INFO L225 Difference]: With dead ends: 48710 [2022-12-14 10:13:18,391 INFO L226 Difference]: Without dead ends: 48710 [2022-12-14 10:13:18,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:13:18,391 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 135 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:13:18,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 82 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:13:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48710 states. [2022-12-14 10:13:19,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48710 to 48710. [2022-12-14 10:13:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48710 states, 48688 states have (on average 3.0735499507065396) internal successors, (149645), 48709 states have internal predecessors, (149645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48710 states to 48710 states and 149645 transitions. [2022-12-14 10:13:19,276 INFO L78 Accepts]: Start accepts. Automaton has 48710 states and 149645 transitions. Word has length 33 [2022-12-14 10:13:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:13:19,276 INFO L495 AbstractCegarLoop]: Abstraction has 48710 states and 149645 transitions. [2022-12-14 10:13:19,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 48710 states and 149645 transitions. [2022-12-14 10:13:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 10:13:19,285 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:13:19,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:13:19,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 10:13:19,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:13:19,486 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:13:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:13:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash -99581148, now seen corresponding path program 1 times [2022-12-14 10:13:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:13:19,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635980090] [2022-12-14 10:13:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:13:19,543 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:13:19,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [280533676] [2022-12-14 10:13:19,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:19,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:13:19,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:13:19,544 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:13:19,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 10:13:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:13:19,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 10:13:19,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:13:19,885 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-12-14 10:13:19,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:19,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:13:19,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:19,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:13:20,010 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-12-14 10:13:20,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,041 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-12-14 10:13:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,080 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-12-14 10:13:20,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,130 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-12-14 10:13:20,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 10:13:20,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,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 41 treesize of output 37 [2022-12-14 10:13:20,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:20,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:20,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:20,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:20,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:20,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:20,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:20,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:20,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:13:20,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:13:20,531 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3618 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3618 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3618 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3618 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-12-14 10:13:20,558 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3617) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3617) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3617) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_3617) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-12-14 10:13:22,982 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse0 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse0 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)))) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse0 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse0 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) is different from false [2022-12-14 10:13:23,004 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))))) is different from false [2022-12-14 10:13:23,031 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))))) is different from false [2022-12-14 10:13:23,058 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0) .cse4 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_3618 (Array Int Int)) (v_ArrVal_3613 (Array Int Int)) (v_ArrVal_3617 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3613) c_~F~0.base v_ArrVal_3617) .cse1 v_ArrVal_3618) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))))) is different from false [2022-12-14 10:13:23,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:23,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 63 [2022-12-14 10:13:23,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:23,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 400 treesize of output 370 [2022-12-14 10:13:23,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 314 [2022-12-14 10:13:23,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 155 [2022-12-14 10:13:23,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 294 [2022-12-14 10:13:23,198 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:13:23,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 1 [2022-12-14 10:13:23,206 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:13:23,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 1 [2022-12-14 10:13:23,213 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:13:23,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 1 [2022-12-14 10:13:23,307 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (forall ((v_ArrVal_3601 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3601) c_~B~0.base) c_~B~0.offset)))) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-12-14 10:13:23,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:23,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 10:13:23,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:13:23,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:23,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-12-14 10:13:23,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-12-14 10:13:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:13:23,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:13:23,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635980090] [2022-12-14 10:13:23,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:13:23,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280533676] [2022-12-14 10:13:23,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280533676] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:13:23,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2016645252] [2022-12-14 10:13:23,630 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:337) 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-12-14 10:13:23,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:13:23,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-12-14 10:13:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385576848] [2022-12-14 10:13:23,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:13:23,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:13:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:13:23,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:13:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=546, Unknown=18, NotChecked=378, Total=1056 [2022-12-14 10:13:23,633 INFO L87 Difference]: Start difference. First operand 48710 states and 149645 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:13:31,622 INFO L93 Difference]: Finished difference Result 57784 states and 172803 transitions. [2022-12-14 10:13:31,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 10:13:31,623 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 10:13:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:13:31,761 INFO L225 Difference]: With dead ends: 57784 [2022-12-14 10:13:31,761 INFO L226 Difference]: Without dead ends: 57783 [2022-12-14 10:13:31,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 4 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=403, Invalid=1329, Unknown=18, NotChecked=602, Total=2352 [2022-12-14 10:13:31,762 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 838 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 5368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2596 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:13:31,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 188 Invalid, 5368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 2555 Invalid, 0 Unknown, 2596 Unchecked, 3.9s Time] [2022-12-14 10:13:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57783 states. [2022-12-14 10:13:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57783 to 48862. [2022-12-14 10:13:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48862 states, 48840 states have (on average 3.074221949221949) internal successors, (150145), 48861 states have internal predecessors, (150145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48862 states to 48862 states and 150145 transitions. [2022-12-14 10:13:32,671 INFO L78 Accepts]: Start accepts. Automaton has 48862 states and 150145 transitions. Word has length 34 [2022-12-14 10:13:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:13:32,671 INFO L495 AbstractCegarLoop]: Abstraction has 48862 states and 150145 transitions. [2022-12-14 10:13:32,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:13:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 48862 states and 150145 transitions. [2022-12-14 10:13:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 10:13:32,680 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:13:32,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:13:32,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-14 10:13:32,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:13:32,881 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:13:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:13:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash 498750872, now seen corresponding path program 2 times [2022-12-14 10:13:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:13:32,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085014254] [2022-12-14 10:13:32,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:13:32,926 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:13:32,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1668653115] [2022-12-14 10:13:32,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:13:32,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:13:32,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:13:32,927 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:13:32,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 10:13:34,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:13:34,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:13:34,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 10:13:34,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:13:34,161 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-12-14 10:13:34,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:13:34,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:13:34,321 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-12-14 10:13:34,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,370 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-12-14 10:13:34,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,412 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-12-14 10:13:34,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 10:13:34,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,504 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-12-14 10:13:34,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:34,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:34,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:34,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:34,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:34,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:34,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:34,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:34,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:13:34,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:13:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:13:34,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:13:34,987 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3845 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3845 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3845 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3845 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-12-14 10:13:48,369 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0))) is different from false [2022-12-14 10:13:48,414 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-12-14 10:13:48,452 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse2))))))) is different from false [2022-12-14 10:13:48,495 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)) (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse1)) (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0))))))) is different from false [2022-12-14 10:13:48,535 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4 0) .cse1 0) .cse3 0))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_169| Int)) (or (forall ((v_ArrVal_3840 (Array Int Int)) (v_ArrVal_3844 (Array Int Int)) (v_ArrVal_3845 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_3840) c_~F~0.base v_ArrVal_3844) |v_thread2Thread1of1ForFork1_#t~mem6.base_169| v_ArrVal_3845) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_169| .cse2))))))) is different from false [2022-12-14 10:13:48,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:48,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2022-12-14 10:13:48,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:48,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 304 treesize of output 270 [2022-12-14 10:13:48,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2022-12-14 10:13:48,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 198 [2022-12-14 10:13:48,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 182 [2022-12-14 10:13:48,693 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:13:48,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2022-12-14 10:13:48,700 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:13:48,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-12-14 10:13:48,707 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:13:48,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-12-14 10:13:48,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:48,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 10:13:48,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:13:48,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2022-12-14 10:13:48,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-12-14 10:13:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:13:49,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:13:49,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085014254] [2022-12-14 10:13:49,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:13:49,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668653115] [2022-12-14 10:13:49,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668653115] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:13:49,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356574506] [2022-12-14 10:13:49,097 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:337) 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-12-14 10:13:49,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:13:49,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-12-14 10:13:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889237441] [2022-12-14 10:13:49,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:13:49,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:13:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:13:49,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:13:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=591, Unknown=27, NotChecked=330, Total=1056 [2022-12-14 10:13:49,099 INFO L87 Difference]: Start difference. First operand 48862 states and 150145 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:14:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:14:03,163 INFO L93 Difference]: Finished difference Result 58481 states and 175013 transitions. [2022-12-14 10:14:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 10:14:03,164 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 10:14:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:14:03,295 INFO L225 Difference]: With dead ends: 58481 [2022-12-14 10:14:03,295 INFO L226 Difference]: Without dead ends: 58480 [2022-12-14 10:14:03,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=364, Invalid=1349, Unknown=33, NotChecked=510, Total=2256 [2022-12-14 10:14:03,296 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 918 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 3324 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 5951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 3324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2413 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:14:03,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 225 Invalid, 5951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 3324 Invalid, 0 Unknown, 2413 Unchecked, 3.5s Time] [2022-12-14 10:14:03,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58480 states. [2022-12-14 10:14:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58480 to 48862. [2022-12-14 10:14:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48862 states, 48840 states have (on average 3.074221949221949) internal successors, (150145), 48861 states have internal predecessors, (150145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:14:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48862 states to 48862 states and 150145 transitions. [2022-12-14 10:14:04,161 INFO L78 Accepts]: Start accepts. Automaton has 48862 states and 150145 transitions. Word has length 34 [2022-12-14 10:14:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:14:04,161 INFO L495 AbstractCegarLoop]: Abstraction has 48862 states and 150145 transitions. [2022-12-14 10:14:04,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:14:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 48862 states and 150145 transitions. [2022-12-14 10:14:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 10:14:04,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:14:04,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:14:04,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 10:14:04,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 10:14:04,371 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:14:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:14:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1056625672, now seen corresponding path program 3 times [2022-12-14 10:14:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:14:04,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719131919] [2022-12-14 10:14:04,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:04,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:14:04,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:14:04,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305080155] [2022-12-14 10:14:04,445 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:14:04,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:04,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:14:04,447 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:14:04,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 10:14:04,976 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:14:04,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:14:04,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 10:14:04,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:14:05,108 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-12-14 10:14:05,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:14:05,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:14:05,290 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-12-14 10:14:05,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,338 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-12-14 10:14:05,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 10:14:05,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,425 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-12-14 10:14:05,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,473 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-12-14 10:14:05,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:05,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:05,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:05,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:05,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:05,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:05,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:05,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:05,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:05,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:14:05,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:14:05,922 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4072 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4072 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4072 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4072 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0))) is different from false [2022-12-14 10:14:05,954 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-12-14 10:14:10,533 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))) is different from false [2022-12-14 10:14:10,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0))))) is different from false [2022-12-14 10:14:10,596 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0))))))) is different from false [2022-12-14 10:14:10,646 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse4 0) .cse3 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_171| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_171| .cse0)) (forall ((v_ArrVal_4067 (Array Int Int)) (v_ArrVal_4071 (Array Int Int)) (v_ArrVal_4072 (Array Int Int))) (= 0 (select (select (store (store (store .cse1 c_~B~0.base v_ArrVal_4067) c_~F~0.base v_ArrVal_4071) |v_thread2Thread1of1ForFork1_#t~mem6.base_171| v_ArrVal_4072) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4)))))))) is different from false [2022-12-14 10:14:10,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:14:10,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2022-12-14 10:14:10,684 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:14:10,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1132 treesize of output 1062 [2022-12-14 10:14:10,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 491 treesize of output 459 [2022-12-14 10:14:10,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 950 treesize of output 822 [2022-12-14 10:14:10,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 822 treesize of output 758 [2022-12-14 10:14:11,906 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:14:11,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-12-14 10:14:11,911 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:14:11,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2022-12-14 10:14:11,916 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:14:11,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-12-14 10:14:11,979 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (forall ((v_ArrVal_4055 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4055) c_~B~0.base) c_~B~0.offset)))) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-12-14 10:14:12,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:14:12,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 10:14:12,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:14:12,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-12-14 10:14:12,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-12-14 10:14:12,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-12-14 10:14:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:14:12,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:14:12,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719131919] [2022-12-14 10:14:12,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:14:12,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305080155] [2022-12-14 10:14:12,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305080155] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:14:12,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897060586] [2022-12-14 10:14:12,315 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:337) 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-12-14 10:14:12,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:14:12,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-12-14 10:14:12,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461223863] [2022-12-14 10:14:12,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:14:12,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:14:12,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:14:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:14:12,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=552, Unknown=24, NotChecked=378, Total=1056 [2022-12-14 10:14:12,317 INFO L87 Difference]: Start difference. First operand 48862 states and 150145 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:14:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:14:20,820 INFO L93 Difference]: Finished difference Result 58461 states and 174892 transitions. [2022-12-14 10:14:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 10:14:20,821 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 10:14:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:14:20,980 INFO L225 Difference]: With dead ends: 58461 [2022-12-14 10:14:20,981 INFO L226 Difference]: Without dead ends: 58460 [2022-12-14 10:14:20,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=386, Invalid=1424, Unknown=24, NotChecked=616, Total=2450 [2022-12-14 10:14:20,982 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 762 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 3918 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 5983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 3918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1883 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:14:20,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 251 Invalid, 5983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 3918 Invalid, 0 Unknown, 1883 Unchecked, 4.5s Time] [2022-12-14 10:14:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58460 states. [2022-12-14 10:14:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58460 to 48862. [2022-12-14 10:14:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48862 states, 48840 states have (on average 3.074221949221949) internal successors, (150145), 48861 states have internal predecessors, (150145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:14:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48862 states to 48862 states and 150145 transitions. [2022-12-14 10:14:21,867 INFO L78 Accepts]: Start accepts. Automaton has 48862 states and 150145 transitions. Word has length 34 [2022-12-14 10:14:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:14:21,867 INFO L495 AbstractCegarLoop]: Abstraction has 48862 states and 150145 transitions. [2022-12-14 10:14:21,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:14:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 48862 states and 150145 transitions. [2022-12-14 10:14:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 10:14:21,875 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:14:21,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:14:21,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-14 10:14:22,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 10:14:22,077 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:14:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:14:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1612479668, now seen corresponding path program 4 times [2022-12-14 10:14:22,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:14:22,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923442888] [2022-12-14 10:14:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:22,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:14:22,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:14:22,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671137178] [2022-12-14 10:14:22,099 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:14:22,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:22,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:14:22,100 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:14:22,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 10:14:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:22,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-14 10:14:22,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:14:22,433 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-12-14 10:14:22,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:14:22,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:14:22,590 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-12-14 10:14:22,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 10:14:22,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,659 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-12-14 10:14:22,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,700 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-12-14 10:14:22,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,749 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-12-14 10:14:22,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:22,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:22,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:22,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:22,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:22,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:22,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:22,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:22,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:23,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:23,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:14:23,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:14:23,102 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4299 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4299 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4299 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4299 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-12-14 10:14:32,956 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= 0 (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2))))) is different from false [2022-12-14 10:14:33,006 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))))) is different from false [2022-12-14 10:14:33,024 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0))))) is different from false [2022-12-14 10:14:33,041 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0))))) is different from false [2022-12-14 10:14:33,061 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse2 0) .cse4 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) .cse1 v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) .cse1 v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) .cse1 v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4298 (Array Int Int)) (v_ArrVal_4299 (Array Int Int)) (v_ArrVal_4294 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4294) c_~F~0.base v_ArrVal_4298) .cse1 v_ArrVal_4299) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0))))) is different from false [2022-12-14 10:14:33,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:14:33,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 65 [2022-12-14 10:14:33,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:14:33,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1244 treesize of output 1174 [2022-12-14 10:14:33,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1094 treesize of output 966 [2022-12-14 10:14:33,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 467 [2022-12-14 10:14:33,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 934 treesize of output 870 [2022-12-14 10:14:33,327 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:14:33,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 1 [2022-12-14 10:14:33,332 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:14:33,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 1 [2022-12-14 10:14:33,337 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:14:33,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 1 [2022-12-14 10:14:33,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:14:33,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 10:14:33,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 10:14:33,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:14:33,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-12-14 10:14:33,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-12-14 10:14:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:14:33,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:14:33,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923442888] [2022-12-14 10:14:33,690 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:14:33,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671137178] [2022-12-14 10:14:33,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671137178] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:14:33,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1130327692] [2022-12-14 10:14:33,691 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:337) 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-12-14 10:14:33,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:14:33,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-12-14 10:14:33,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198586011] [2022-12-14 10:14:33,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:14:33,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:14:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:14:33,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:14:33,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=601, Unknown=22, NotChecked=330, Total=1056 [2022-12-14 10:14:33,693 INFO L87 Difference]: Start difference. First operand 48862 states and 150145 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:14:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:14:39,889 INFO L93 Difference]: Finished difference Result 58828 states and 176012 transitions. [2022-12-14 10:14:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 10:14:39,890 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 10:14:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:14:40,027 INFO L225 Difference]: With dead ends: 58828 [2022-12-14 10:14:40,027 INFO L226 Difference]: Without dead ends: 58827 [2022-12-14 10:14:40,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 5 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=509, Invalid=1743, Unknown=28, NotChecked=582, Total=2862 [2022-12-14 10:14:40,028 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1123 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 3385 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 4817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 3385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1105 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:14:40,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 224 Invalid, 4817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 3385 Invalid, 0 Unknown, 1105 Unchecked, 4.0s Time] [2022-12-14 10:14:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58827 states. [2022-12-14 10:14:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58827 to 48862. [2022-12-14 10:14:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48862 states, 48840 states have (on average 3.074221949221949) internal successors, (150145), 48861 states have internal predecessors, (150145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:14:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48862 states to 48862 states and 150145 transitions. [2022-12-14 10:14:41,012 INFO L78 Accepts]: Start accepts. Automaton has 48862 states and 150145 transitions. Word has length 34 [2022-12-14 10:14:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:14:41,012 INFO L495 AbstractCegarLoop]: Abstraction has 48862 states and 150145 transitions. [2022-12-14 10:14:41,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:14:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 48862 states and 150145 transitions. [2022-12-14 10:14:41,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 10:14:41,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:14:41,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:14:41,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 10:14:41,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:41,221 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:14:41,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:14:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1664715716, now seen corresponding path program 5 times [2022-12-14 10:14:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:14:41,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344061817] [2022-12-14 10:14:41,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:41,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:14:41,282 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:14:41,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433490128] [2022-12-14 10:14:41,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:14:41,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:41,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:14:41,285 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:14:41,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 10:14:42,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:14:42,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:14:42,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 10:14:42,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:14:42,258 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-12-14 10:14:42,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:14:42,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:14:42,404 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-12-14 10:14:42,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,452 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-12-14 10:14:42,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,498 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-12-14 10:14:42,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,554 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-12-14 10:14:42,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 10:14:42,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:42,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:42,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:42,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:42,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:42,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:42,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:42,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:42,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:43,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:14:43,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:14:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:14:43,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:14:43,229 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4525 (Array Int Int)) (v_ArrVal_4526 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4525) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4526) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4525 (Array Int Int)) (v_ArrVal_4526 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4525) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4526) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4525 (Array Int Int)) (v_ArrVal_4526 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4525) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4526) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4525 (Array Int Int)) (v_ArrVal_4526 (Array Int Int))) (= (select (select (store (store |c_#race| c_~F~0.base v_ArrVal_4525) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4526) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0))) is different from false [2022-12-14 10:15:06,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:15:06,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2022-12-14 10:15:06,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:15:06,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 124 [2022-12-14 10:15:06,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2022-12-14 10:15:06,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2022-12-14 10:15:06,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2022-12-14 10:15:06,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:15:06,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 10:15:06,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:15:06,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2022-12-14 10:15:06,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-12-14 10:15:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:15:07,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:15:07,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344061817] [2022-12-14 10:15:07,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:15:07,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433490128] [2022-12-14 10:15:07,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433490128] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:15:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1470565418] [2022-12-14 10:15:07,202 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:337) 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-12-14 10:15:07,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:15:07,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-12-14 10:15:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453986462] [2022-12-14 10:15:07,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:15:07,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:15:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:15:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:15:07,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=752, Unknown=112, NotChecked=60, Total=1056 [2022-12-14 10:15:07,204 INFO L87 Difference]: Start difference. First operand 48862 states and 150145 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:15:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:15:14,576 INFO L93 Difference]: Finished difference Result 55757 states and 166589 transitions. [2022-12-14 10:15:14,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:15:14,577 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 10:15:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:15:14,715 INFO L225 Difference]: With dead ends: 55757 [2022-12-14 10:15:14,716 INFO L226 Difference]: Without dead ends: 55756 [2022-12-14 10:15:14,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=331, Invalid=1360, Unknown=119, NotChecked=82, Total=1892 [2022-12-14 10:15:14,717 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 675 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 3951 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 3951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:15:14,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 287 Invalid, 4333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 3951 Invalid, 0 Unknown, 193 Unchecked, 6.1s Time] [2022-12-14 10:15:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55756 states. [2022-12-14 10:15:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55756 to 48881. [2022-12-14 10:15:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48881 states, 48859 states have (on average 3.0742135532859862) internal successors, (150203), 48880 states have internal predecessors, (150203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:15:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48881 states to 48881 states and 150203 transitions. [2022-12-14 10:15:15,689 INFO L78 Accepts]: Start accepts. Automaton has 48881 states and 150203 transitions. Word has length 34 [2022-12-14 10:15:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:15:15,689 INFO L495 AbstractCegarLoop]: Abstraction has 48881 states and 150203 transitions. [2022-12-14 10:15:15,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:15:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 48881 states and 150203 transitions. [2022-12-14 10:15:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 10:15:15,698 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:15:15,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:15:15,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 10:15:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 10:15:15,899 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:15:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:15:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2031291500, now seen corresponding path program 6 times [2022-12-14 10:15:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:15:15,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219086687] [2022-12-14 10:15:15,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:15:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:15:15,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:15:15,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093672875] [2022-12-14 10:15:15,969 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:15:15,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:15:15,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:15:15,971 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:15:15,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 10:15:16,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:15:16,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:15:16,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 10:15:16,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:15:16,540 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-12-14 10:15:16,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:16,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:15:16,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:16,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:15:16,711 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-12-14 10:15:16,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:16,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 10:15:16,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:16,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:16,807 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-12-14 10:15:16,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:16,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:16,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:16,945 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-12-14 10:15:17,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 10:15:17,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:17,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:15:17,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:17,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:15:17,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:17,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:15:17,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:17,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:15:17,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:17,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:15:17,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:17,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:15:17,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:17,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:15:17,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:17,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:15:17,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:15:17,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:15:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:15:17,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:15:17,592 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4753 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4753 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4753 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4753 (Array Int Int))) (= (select (select (store |c_#race| |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-12-14 10:15:23,904 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4752 (Array Int Int)) (v_ArrVal_4753 (Array Int Int)) (v_ArrVal_4748 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4748) c_~F~0.base v_ArrVal_4752) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4752 (Array Int Int)) (v_ArrVal_4753 (Array Int Int)) (v_ArrVal_4748 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4748) c_~F~0.base v_ArrVal_4752) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4752 (Array Int Int)) (v_ArrVal_4753 (Array Int Int)) (v_ArrVal_4748 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4748) c_~F~0.base v_ArrVal_4752) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (forall ((v_ArrVal_4752 (Array Int Int)) (v_ArrVal_4753 (Array Int Int)) (v_ArrVal_4748 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4748) c_~F~0.base v_ArrVal_4752) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))) is different from false [2022-12-14 10:15:23,981 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4752 (Array Int Int)) (v_ArrVal_4753 (Array Int Int)) (v_ArrVal_4748 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4748) c_~F~0.base v_ArrVal_4752) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4752 (Array Int Int)) (v_ArrVal_4753 (Array Int Int)) (v_ArrVal_4748 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4748) c_~F~0.base v_ArrVal_4752) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4752 (Array Int Int)) (v_ArrVal_4753 (Array Int Int)) (v_ArrVal_4748 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4748) c_~F~0.base v_ArrVal_4752) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_177| Int)) (or (forall ((v_ArrVal_4752 (Array Int Int)) (v_ArrVal_4753 (Array Int Int)) (v_ArrVal_4748 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~B~0.base v_ArrVal_4748) c_~F~0.base v_ArrVal_4752) |v_thread2Thread1of1ForFork1_#t~mem6.base_177| v_ArrVal_4753) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_177| .cse0)))))) is different from false [2022-12-14 10:15:30,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:15:30,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 55 [2022-12-14 10:15:30,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:15:30,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 272 treesize of output 242 [2022-12-14 10:15:30,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 202 [2022-12-14 10:15:30,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 106 [2022-12-14 10:15:30,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 182 [2022-12-14 10:15:30,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:15: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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 10:15:30,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:15:30,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2022-12-14 10:15:30,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-12-14 10:15:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:15:30,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:15:30,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219086687] [2022-12-14 10:15:30,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:15:30,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093672875] [2022-12-14 10:15:30,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093672875] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:15:30,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [832361482] [2022-12-14 10:15:30,727 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:337) 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-12-14 10:15:30,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:15:30,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2022-12-14 10:15:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285328602] [2022-12-14 10:15:30,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:15:30,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 10:15:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:15:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 10:15:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=879, Unknown=41, NotChecked=192, Total=1260 [2022-12-14 10:15:30,729 INFO L87 Difference]: Start difference. First operand 48881 states and 150203 transitions. Second operand has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:15:37,611 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 137 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:15:51,188 WARN L233 SmtUtils]: Spent 12.61s on a formula simplification. DAG size of input: 156 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:15:53,230 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-12-14 10:16:04,957 WARN L233 SmtUtils]: Spent 11.34s on a formula simplification. DAG size of input: 182 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:16:32,954 WARN L233 SmtUtils]: Spent 26.90s on a formula simplification. DAG size of input: 106 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:16:55,103 WARN L233 SmtUtils]: Spent 17.96s on a formula simplification. DAG size of input: 103 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:17:07,289 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:17:17,545 WARN L233 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 110 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:17:37,808 WARN L233 SmtUtils]: Spent 19.97s on a formula simplification. DAG size of input: 92 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:17:46,669 WARN L233 SmtUtils]: Spent 8.74s on a formula simplification. DAG size of input: 85 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:18:24,959 WARN L233 SmtUtils]: Spent 31.96s on a formula simplification. DAG size of input: 119 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:18:33,445 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-12-14 10:18:56,675 WARN L233 SmtUtils]: Spent 22.64s on a formula simplification. DAG size of input: 148 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:19:10,159 WARN L233 SmtUtils]: Spent 12.61s on a formula simplification. DAG size of input: 132 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:20:01,011 WARN L233 SmtUtils]: Spent 48.20s on a formula simplification. DAG size of input: 158 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:20:17,718 WARN L233 SmtUtils]: Spent 15.44s on a formula simplification. DAG size of input: 120 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:20:27,133 WARN L233 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 107 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:20:46,237 WARN L233 SmtUtils]: Spent 17.56s on a formula simplification. DAG size of input: 166 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:21:03,531 WARN L233 SmtUtils]: Spent 16.62s on a formula simplification. DAG size of input: 156 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:22:56,262 WARN L233 SmtUtils]: Spent 1.82m on a formula simplification. DAG size of input: 120 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:22:58,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:23:04,854 WARN L233 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:23:49,947 WARN L233 SmtUtils]: Spent 43.54s on a formula simplification. DAG size of input: 166 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:24:26,898 WARN L233 SmtUtils]: Spent 35.54s on a formula simplification. DAG size of input: 156 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:24:29,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:24:31,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:24:54,509 WARN L233 SmtUtils]: Spent 22.21s on a formula simplification. DAG size of input: 148 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:25:03,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:25:06,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:25:10,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:25:17,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:25:27,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:25:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:25:32,055 INFO L93 Difference]: Finished difference Result 59867 states and 177126 transitions. [2022-12-14 10:25:32,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-14 10:25:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-14 10:25:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:25:32,201 INFO L225 Difference]: With dead ends: 59867 [2022-12-14 10:25:32,201 INFO L226 Difference]: Without dead ends: 59866 [2022-12-14 10:25:32,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 564.1s TimeCoverageRelationStatistics Valid=1426, Invalid=5904, Unknown=164, NotChecked=516, Total=8010 [2022-12-14 10:25:32,206 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 980 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 5859 mSolverCounterSat, 400 mSolverCounterUnsat, 376 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 7394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 5859 IncrementalHoareTripleChecker+Invalid, 376 IncrementalHoareTripleChecker+Unknown, 759 IncrementalHoareTripleChecker+Unchecked, 49.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:25:32,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 381 Invalid, 7394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 5859 Invalid, 376 Unknown, 759 Unchecked, 49.9s Time] [2022-12-14 10:25:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59866 states. [2022-12-14 10:25:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59866 to 48919. [2022-12-14 10:25:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48919 states, 48897 states have (on average 3.074380841360411) internal successors, (150328), 48918 states have internal predecessors, (150328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:25:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48919 states to 48919 states and 150328 transitions. [2022-12-14 10:25:33,118 INFO L78 Accepts]: Start accepts. Automaton has 48919 states and 150328 transitions. Word has length 34 [2022-12-14 10:25:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:25:33,118 INFO L495 AbstractCegarLoop]: Abstraction has 48919 states and 150328 transitions. [2022-12-14 10:25:33,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:25:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 48919 states and 150328 transitions. [2022-12-14 10:25:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 10:25:33,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:25:33,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:25:33,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-14 10:25:33,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:25:33,327 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-12-14 10:25:33,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:25:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -631815592, now seen corresponding path program 7 times [2022-12-14 10:25:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:25:33,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301610239] [2022-12-14 10:25:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:25:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:25:33,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 10:25:33,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362997558] [2022-12-14 10:25:33,376 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:25:33,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:25:33,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:25:33,377 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:25:33,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a8212c-c09f-4cdd-ab68-c05b7af9d2dc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 10:25:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:25:33,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-14 10:25:33,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:25:33,765 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-12-14 10:25:33,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:33,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:25:33,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:33,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-12-14 10:25:33,945 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-12-14 10:25:34,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,041 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-12-14 10:25:34,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,092 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-12-14 10:25:34,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 10:25:34,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,390 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-12-14 10:25:34,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:25:34,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:25:34,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:25:34,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:25:34,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:25:34,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:25:34,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:25:34,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:25:34,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:25:34,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 10:25:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:25:34,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:25:45,737 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |c_thread2Thread1of1ForFork1_#t~mem6.base| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0))))) is different from false [2022-12-14 10:25:45,781 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2 0)))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)) (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse2) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)) (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse1)) (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0))))))) is different from false [2022-12-14 10:25:45,857 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2))))))) is different from false [2022-12-14 10:25:45,904 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3 0) .cse1 0))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2))))))) is different from false [2022-12-14 10:25:45,954 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1 0) .cse4 0) .cse3 0))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (and (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse1) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse3) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2)))) (forall ((|v_thread2Thread1of1ForFork1_#t~mem6.base_179| Int)) (or (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= (select (select (store (store (store .cse0 c_~B~0.base v_ArrVal_4975) c_~F~0.base v_ArrVal_4979) |v_thread2Thread1of1ForFork1_#t~mem6.base_179| v_ArrVal_4980) |c_ULTIMATE.start_main_~#t1~0#1.base|) .cse4) 0)) (not (<= |v_thread2Thread1of1ForFork1_#t~mem6.base_179| .cse2))))))) is different from false [2022-12-14 10:25:45,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:25:45,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 57 [2022-12-14 10:25:45,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:25:45,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 138 [2022-12-14 10:25:45,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2022-12-14 10:25:45,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2022-12-14 10:25:46,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 86 [2022-12-14 10:25:46,080 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:25:46,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-12-14 10:25:46,087 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:25:46,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 1 [2022-12-14 10:25:46,093 INFO L321 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-12-14 10:25:46,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 1 [2022-12-14 10:25:46,139 WARN L837 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~B~0.base)) (forall ((v_ArrVal_4963 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#t1~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4963) c_~B~0.base) c_~B~0.offset)))) (not (= c_~F~0.base |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-12-14 10:25:46,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:25:46,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 10:25:46,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:25:46,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2022-12-14 10:25:46,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-12-14 10:25:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:25:46,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:25:46,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301610239] [2022-12-14 10:25:46,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 10:25:46,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362997558] [2022-12-14 10:25:46,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362997558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:25:46,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [993491991] [2022-12-14 10:25:46,464 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:337) 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-12-14 10:25:46,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:25:46,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 31 [2022-12-14 10:25:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629059887] [2022-12-14 10:25:46,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 10:25:46,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:25:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:25:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:25:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=563, Unknown=56, NotChecked=330, Total=1056 [2022-12-14 10:25:46,466 INFO L87 Difference]: Start difference. First operand 48919 states and 150328 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:09,561 WARN L233 SmtUtils]: Spent 22.02s on a formula simplification. DAG size of input: 71 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:26:26,958 WARN L233 SmtUtils]: Spent 17.20s on a formula simplification. DAG size of input: 72 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)