./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-ext/02_inc_cas.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:34:40,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:34:40,932 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:34:40,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:34:40,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:34:40,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:34:40,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:34:40,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:34:40,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:34:40,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:34:40,967 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:34:40,967 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:34:40,968 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:34:40,968 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:34:40,969 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:34:40,969 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:34:40,970 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:34:40,971 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:34:40,971 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:34:40,972 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:34:40,972 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:34:40,973 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:34:40,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:34:40,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:34:40,975 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:34:40,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:34:40,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:34:40,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:34:40,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:34:40,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:34:40,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:34:40,977 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:34:40,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:34:40,978 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:34:40,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:34:40,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:34:40,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:34:40,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:34:40,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:34:40,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:34:40,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:34:40,980 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:34:40,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:34:40,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:34:40,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:34:40,981 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:34:40,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:34:40,981 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/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_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! call(reach_error())) ) 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2023-12-02 15:34:41,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:34:41,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:34:41,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:34:41,247 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:34:41,248 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:34:41,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-ext/02_inc_cas.i [2023-12-02 15:34:43,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:34:44,158 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:34:44,159 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2023-12-02 15:34:44,175 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/data/2f843242e/a9ee7a08fc4540bdabd31a2987020c62/FLAGdad39868c [2023-12-02 15:34:44,187 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/data/2f843242e/a9ee7a08fc4540bdabd31a2987020c62 [2023-12-02 15:34:44,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:34:44,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:34:44,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:34:44,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:34:44,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:34:44,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db0e504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44, skipping insertion in model container [2023-12-02 15:34:44,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:34:44,490 WARN L240 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_cc13aa96-7c78-43b7-8722-9009a18f9f7a/sv-benchmarks/c/pthread-ext/02_inc_cas.i[30873,30886] [2023-12-02 15:34:44,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:34:44,505 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:34:44,545 WARN L240 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_cc13aa96-7c78-43b7-8722-9009a18f9f7a/sv-benchmarks/c/pthread-ext/02_inc_cas.i[30873,30886] [2023-12-02 15:34:44,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:34:44,573 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:34:44,573 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:34:44,579 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:34:44,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44 WrapperNode [2023-12-02 15:34:44,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:34:44,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:34:44,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:34:44,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:34:44,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,618 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-12-02 15:34:44,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:34:44,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:34:44,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:34:44,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:34:44,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:34:44,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:34:44,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:34:44,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:34:44,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (1/1) ... [2023-12-02 15:34:44,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:34:44,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:34:44,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:34:44,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:34:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 15:34:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-02 15:34:44,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-02 15:34:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 15:34:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 15:34:44,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:34:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:34:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:34:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:34:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 15:34:44,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:34:44,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:34:44,708 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 15:34:44,835 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:34:44,837 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:34:44,983 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:34:45,100 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:34:45,100 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 15:34:45,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:45 BoogieIcfgContainer [2023-12-02 15:34:45,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:34:45,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:34:45,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:34:45,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:34:45,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:34:44" (1/3) ... [2023-12-02 15:34:45,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f4da4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:45, skipping insertion in model container [2023-12-02 15:34:45,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:34:44" (2/3) ... [2023-12-02 15:34:45,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f4da4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:34:45, skipping insertion in model container [2023-12-02 15:34:45,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:34:45" (3/3) ... [2023-12-02 15:34:45,110 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-12-02 15:34:45,118 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 15:34:45,126 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:34:45,126 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:34:45,126 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 15:34:45,165 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 15:34:45,195 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 19 places, 19 transitions, 42 flow [2023-12-02 15:34:45,213 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 55 states, 52 states have (on average 2.019230769230769) internal successors, (105), 54 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:34:45,250 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=LoopHeads, 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;@2895a0b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:34:45,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-02 15:34:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 52 states have (on average 2.019230769230769) internal successors, (105), 54 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:34:45,259 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:45,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:34:45,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:34:45,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1940293997, now seen corresponding path program 1 times [2023-12-02 15:34:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:34:45,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4915506] [2023-12-02 15:34:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:34:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:45,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:45,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:34:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4915506] [2023-12-02 15:34:45,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4915506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:45,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:45,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:34:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891138186] [2023-12-02 15:34:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:45,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:34:45,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:34:45,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:34:45,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:34:45,488 INFO L87 Difference]: Start difference. First operand has 55 states, 52 states have (on average 2.019230769230769) internal successors, (105), 54 states have internal predecessors, (105), 0 states have call successors, (0), 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, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:45,529 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2023-12-02 15:34:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:34:45,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-12-02 15:34:45,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:45,539 INFO L225 Difference]: With dead ends: 47 [2023-12-02 15:34:45,539 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 15:34:45,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:34:45,545 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:45,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:34:45,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 15:34:45,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-02 15:34:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 84 transitions. [2023-12-02 15:34:45,581 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 84 transitions. Word has length 6 [2023-12-02 15:34:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:45,581 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 84 transitions. [2023-12-02 15:34:45,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 84 transitions. [2023-12-02 15:34:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:34:45,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:45,582 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-12-02 15:34:45,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:34:45,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:34:45,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1940283994, now seen corresponding path program 1 times [2023-12-02 15:34:45,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:34:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693421349] [2023-12-02 15:34:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:45,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:34:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:34:45,610 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:34:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:34:45,643 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:34:45,644 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:34:45,646 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-02 15:34:45,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-02 15:34:45,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-02 15:34:45,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:34:45,651 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-02 15:34:45,653 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 15:34:45,653 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-02 15:34:45,681 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 15:34:45,684 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 33 transitions, 76 flow [2023-12-02 15:34:45,738 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 640 states, 632 states have (on average 3.1218354430379747) internal successors, (1973), 639 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,740 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:34:45,741 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=LoopHeads, 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;@2895a0b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:34:45,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 15:34:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 640 states, 632 states have (on average 3.1218354430379747) internal successors, (1973), 639 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:34:45,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:45,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:34:45,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-02 15:34:45,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1378019059, now seen corresponding path program 1 times [2023-12-02 15:34:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:34:45,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887992980] [2023-12-02 15:34:45,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:45,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:34:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:45,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:34:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887992980] [2023-12-02 15:34:45,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887992980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:45,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:34:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071832776] [2023-12-02 15:34:45,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:45,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:34:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:34:45,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:34:45,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:34:45,791 INFO L87 Difference]: Start difference. First operand has 640 states, 632 states have (on average 3.1218354430379747) internal successors, (1973), 639 states have internal predecessors, (1973), 0 states have call successors, (0), 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, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:45,849 INFO L93 Difference]: Finished difference Result 520 states and 1491 transitions. [2023-12-02 15:34:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:34:45,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-12-02 15:34:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:45,861 INFO L225 Difference]: With dead ends: 520 [2023-12-02 15:34:45,861 INFO L226 Difference]: Without dead ends: 520 [2023-12-02 15:34:45,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:34:45,863 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:45,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:34:45,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-12-02 15:34:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2023-12-02 15:34:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 516 states have (on average 2.88953488372093) internal successors, (1491), 519 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1491 transitions. [2023-12-02 15:34:45,911 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1491 transitions. Word has length 6 [2023-12-02 15:34:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:45,911 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 1491 transitions. [2023-12-02 15:34:45,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1491 transitions. [2023-12-02 15:34:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 15:34:45,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:45,913 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2023-12-02 15:34:45,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:34:45,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-02 15:34:45,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1950289510, now seen corresponding path program 1 times [2023-12-02 15:34:45,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:34:45,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296566731] [2023-12-02 15:34:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:34:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:34:45,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:34:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:34:45,954 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:34:45,955 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:34:45,955 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-02 15:34:45,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-12-02 15:34:45,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-12-02 15:34:45,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-12-02 15:34:45,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:34:45,956 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-02 15:34:45,957 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 15:34:45,957 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-02 15:34:45,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 15:34:45,993 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 47 transitions, 112 flow [2023-12-02 15:34:46,252 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 7147 states, 7128 states have (on average 4.27483164983165) internal successors, (30471), 7146 states have internal predecessors, (30471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:46,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:34:46,254 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=LoopHeads, 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;@2895a0b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:34:46,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-02 15:34:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 7147 states, 7128 states have (on average 4.27483164983165) internal successors, (30471), 7146 states have internal predecessors, (30471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:34:46,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:46,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:34:46,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-02 15:34:46,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:46,281 INFO L85 PathProgramCache]: Analyzing trace with hash 12790656, now seen corresponding path program 1 times [2023-12-02 15:34:46,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:34:46,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091928144] [2023-12-02 15:34:46,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:46,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:34:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:46,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:34:46,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091928144] [2023-12-02 15:34:46,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091928144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:46,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:46,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:34:46,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490364036] [2023-12-02 15:34:46,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:46,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:34:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:34:46,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:34:46,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:34:46,329 INFO L87 Difference]: Start difference. First operand has 7147 states, 7128 states have (on average 4.27483164983165) internal successors, (30471), 7146 states have internal predecessors, (30471), 0 states have call successors, (0), 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, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:46,519 INFO L93 Difference]: Finished difference Result 5723 states and 22644 transitions. [2023-12-02 15:34:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:34:46,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-12-02 15:34:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:46,591 INFO L225 Difference]: With dead ends: 5723 [2023-12-02 15:34:46,592 INFO L226 Difference]: Without dead ends: 5723 [2023-12-02 15:34:46,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:34:46,593 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:46,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:34:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5723 states. [2023-12-02 15:34:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5723 to 5723. [2023-12-02 15:34:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5723 states, 5715 states have (on average 3.9622047244094487) internal successors, (22644), 5722 states have internal predecessors, (22644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 22644 transitions. [2023-12-02 15:34:46,933 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 22644 transitions. Word has length 6 [2023-12-02 15:34:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:46,934 INFO L495 AbstractCegarLoop]: Abstraction has 5723 states and 22644 transitions. [2023-12-02 15:34:46,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 22644 transitions. [2023-12-02 15:34:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 15:34:46,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:46,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:34:46,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:34:46,936 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-02 15:34:46,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1318638203, now seen corresponding path program 1 times [2023-12-02 15:34:46,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:34:46,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793733623] [2023-12-02 15:34:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:34:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:47,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:34:47,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793733623] [2023-12-02 15:34:47,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793733623] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:34:47,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:34:47,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:34:47,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787915472] [2023-12-02 15:34:47,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:34:47,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:34:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:34:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:34:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:34:47,610 INFO L87 Difference]: Start difference. First operand 5723 states and 22644 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:49,128 INFO L93 Difference]: Finished difference Result 11199 states and 43510 transitions. [2023-12-02 15:34:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 15:34:49,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 15:34:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:49,235 INFO L225 Difference]: With dead ends: 11199 [2023-12-02 15:34:49,235 INFO L226 Difference]: Without dead ends: 11199 [2023-12-02 15:34:49,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-02 15:34:49,237 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 442 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:49,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 123 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 15:34:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11199 states. [2023-12-02 15:34:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11199 to 8105. [2023-12-02 15:34:49,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8105 states, 8097 states have (on average 3.989872792392244) internal successors, (32306), 8104 states have internal predecessors, (32306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8105 states to 8105 states and 32306 transitions. [2023-12-02 15:34:49,647 INFO L78 Accepts]: Start accepts. Automaton has 8105 states and 32306 transitions. Word has length 10 [2023-12-02 15:34:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:49,648 INFO L495 AbstractCegarLoop]: Abstraction has 8105 states and 32306 transitions. [2023-12-02 15:34:49,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8105 states and 32306 transitions. [2023-12-02 15:34:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:34:49,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:49,651 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:34:49,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:34:49,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-02 15:34:49,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash 195943901, now seen corresponding path program 1 times [2023-12-02 15:34:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:34:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644500026] [2023-12-02 15:34:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:34:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:50,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:34:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644500026] [2023-12-02 15:34:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644500026] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:34:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076522672] [2023-12-02 15:34:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:50,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:34:50,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:34:50,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:34:50,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:34:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:50,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 15:34:50,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:50,300 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 15:34:50,301 INFO L378 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 [2023-12-02 15:34:50,354 INFO L378 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 16 treesize of output 11 [2023-12-02 15:34:50,440 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 15:34:50,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 15:34:50,614 INFO L378 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 35 treesize of output 18 [2023-12-02 15:34:50,905 INFO L378 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 23 treesize of output 21 [2023-12-02 15:34:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:34:50,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:34:50,991 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_79 (Array Int Int))) (< (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) is different from false [2023-12-02 15:34:51,009 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_79 (Array Int Int))) (< (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod |c_thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0)) is different from false [2023-12-02 15:34:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 15:34:52,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076522672] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:34:52,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1552189712] [2023-12-02 15:34:52,094 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 15:34:52,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:34:52,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 24 [2023-12-02 15:34:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174519923] [2023-12-02 15:34:52,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:34:52,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 15:34:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:34:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 15:34:52,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=438, Unknown=11, NotChecked=90, Total=650 [2023-12-02 15:34:52,098 INFO L87 Difference]: Start difference. First operand 8105 states and 32306 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:57,805 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_79 (Array Int Int))) (< (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_79) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (and (or .cse0 (= (mod |c_thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0)) (or .cse0 (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) is different from false [2023-12-02 15:35:07,195 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] [2023-12-02 15:35:10,384 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] [2023-12-02 15:35:12,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:35:15,296 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] [2023-12-02 15:35:16,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:35:19,358 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] [2023-12-02 15:35:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:22,635 INFO L93 Difference]: Finished difference Result 24876 states and 96481 transitions. [2023-12-02 15:35:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 15:35:22,636 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 15:35:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:22,758 INFO L225 Difference]: With dead ends: 24876 [2023-12-02 15:35:22,758 INFO L226 Difference]: Without dead ends: 24876 [2023-12-02 15:35:22,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 5 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=913, Invalid=3339, Unknown=50, NotChecked=390, Total=4692 [2023-12-02 15:35:22,761 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1675 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 160 mSolverCounterUnsat, 146 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 6496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 146 IncrementalHoareTripleChecker+Unknown, 3682 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:22,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 315 Invalid, 6496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2508 Invalid, 146 Unknown, 3682 Unchecked, 21.4s Time] [2023-12-02 15:35:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24876 states. [2023-12-02 15:35:23,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24876 to 10063. [2023-12-02 15:35:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10063 states, 10055 states have (on average 3.9954251616111387) internal successors, (40174), 10062 states have internal predecessors, (40174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10063 states to 10063 states and 40174 transitions. [2023-12-02 15:35:23,274 INFO L78 Accepts]: Start accepts. Automaton has 10063 states and 40174 transitions. Word has length 12 [2023-12-02 15:35:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:23,274 INFO L495 AbstractCegarLoop]: Abstraction has 10063 states and 40174 transitions. [2023-12-02 15:35:23,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 10063 states and 40174 transitions. [2023-12-02 15:35:23,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:35:23,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:23,277 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2023-12-02 15:35:23,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:35:23,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 15:35:23,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-02 15:35:23,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:23,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1319909625, now seen corresponding path program 1 times [2023-12-02 15:35:23,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:35:23,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200214687] [2023-12-02 15:35:23,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:35:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:35:23,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:35:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:35:23,505 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:35:23,505 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:35:23,505 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-02 15:35:23,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-02 15:35:23,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-12-02 15:35:23,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-02 15:35:23,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-02 15:35:23,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 15:35:23,507 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-02 15:35:23,507 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 15:35:23,507 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-02 15:35:23,537 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 15:35:23,540 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 61 transitions, 150 flow [2023-12-02 15:35:26,440 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 78940 states, 78898 states have (on average 5.448338360921697) internal successors, (429863), 78939 states have internal predecessors, (429863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:26,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:35:26,442 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=LoopHeads, 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;@2895a0b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:35:26,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 15:35:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 78940 states, 78898 states have (on average 5.448338360921697) internal successors, (429863), 78939 states have internal predecessors, (429863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 15:35:26,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:26,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 15:35:26,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:35:26,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1817781664, now seen corresponding path program 1 times [2023-12-02 15:35:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:35:26,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12110348] [2023-12-02 15:35:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:26,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:35:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:35:26,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:35:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12110348] [2023-12-02 15:35:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12110348] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:35:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:35:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:35:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531874434] [2023-12-02 15:35:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:35:26,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 15:35:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:35:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 15:35:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:35:26,739 INFO L87 Difference]: Start difference. First operand has 78940 states, 78898 states have (on average 5.448338360921697) internal successors, (429863), 78939 states have internal predecessors, (429863), 0 states have call successors, (0), 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, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:27,756 INFO L93 Difference]: Finished difference Result 62956 states and 317763 transitions. [2023-12-02 15:35:27,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 15:35:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-12-02 15:35:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:28,260 INFO L225 Difference]: With dead ends: 62956 [2023-12-02 15:35:28,260 INFO L226 Difference]: Without dead ends: 62956 [2023-12-02 15:35:28,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 15:35:28,261 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:28,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:35:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62956 states. [2023-12-02 15:35:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62956 to 62956. [2023-12-02 15:35:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62956 states, 62940 states have (on average 5.048665395614871) internal successors, (317763), 62955 states have internal predecessors, (317763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62956 states to 62956 states and 317763 transitions. [2023-12-02 15:35:31,094 INFO L78 Accepts]: Start accepts. Automaton has 62956 states and 317763 transitions. Word has length 6 [2023-12-02 15:35:31,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:31,094 INFO L495 AbstractCegarLoop]: Abstraction has 62956 states and 317763 transitions. [2023-12-02 15:35:31,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 62956 states and 317763 transitions. [2023-12-02 15:35:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 15:35:31,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:31,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:35:31,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 15:35:31,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:35:31,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:31,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1400406245, now seen corresponding path program 1 times [2023-12-02 15:35:31,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:35:31,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916883692] [2023-12-02 15:35:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:31,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:35:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:35:31,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:35:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916883692] [2023-12-02 15:35:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916883692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:35:31,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:35:31,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 15:35:31,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231898008] [2023-12-02 15:35:31,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:35:31,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 15:35:31,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:35:31,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 15:35:31,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-02 15:35:31,509 INFO L87 Difference]: Start difference. First operand 62956 states and 317763 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:35:34,700 INFO L93 Difference]: Finished difference Result 129000 states and 640933 transitions. [2023-12-02 15:35:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 15:35:34,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 15:35:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:35:35,817 INFO L225 Difference]: With dead ends: 129000 [2023-12-02 15:35:35,817 INFO L226 Difference]: Without dead ends: 129000 [2023-12-02 15:35:35,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-02 15:35:35,820 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 580 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:35:35,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 146 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 15:35:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129000 states. [2023-12-02 15:35:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129000 to 92787. [2023-12-02 15:35:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92787 states, 92771 states have (on average 5.073050845630639) internal successors, (470632), 92786 states have internal predecessors, (470632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92787 states to 92787 states and 470632 transitions. [2023-12-02 15:35:40,154 INFO L78 Accepts]: Start accepts. Automaton has 92787 states and 470632 transitions. Word has length 10 [2023-12-02 15:35:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:35:40,154 INFO L495 AbstractCegarLoop]: Abstraction has 92787 states and 470632 transitions. [2023-12-02 15:35:40,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 92787 states and 470632 transitions. [2023-12-02 15:35:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:35:40,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:35:40,174 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:35:40,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 15:35:40,175 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:35:40,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:35:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1465665187, now seen corresponding path program 1 times [2023-12-02 15:35:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:35:40,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993775385] [2023-12-02 15:35:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:40,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:35:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:35:40,637 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:35:40,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993775385] [2023-12-02 15:35:40,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993775385] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:35:40,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995960819] [2023-12-02 15:35:40,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:35:40,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:35:40,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:35:40,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:35:40,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:35:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:35:40,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 15:35:40,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:35:40,740 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:35:40,741 INFO L378 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 [2023-12-02 15:35:40,776 INFO L378 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 16 treesize of output 11 [2023-12-02 15:35:40,920 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:35:40,920 INFO L378 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 2 case distinctions, treesize of input 35 treesize of output 18 [2023-12-02 15:35:41,059 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 15:35:41,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2023-12-02 15:35:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:35:41,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:35:41,156 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod |c_thr1Thread1of4ForFork0_#t~mem5#1| 4294967296) 0) (forall ((v_ArrVal_141 (Array Int Int))) (< (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) is different from false [2023-12-02 15:35:41,796 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_136))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse4 4294967296))) (or (= 4294967295 .cse0) (< .cse0 (mod (select (select (store (let ((.cse1 (store .cse3 |c_~#value~0.offset| (+ .cse4 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse1) |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select (store .cse2 |c_~#value~0.base| .cse1) |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-12-02 15:35:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 15:35:41,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995960819] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:35:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2064452292] [2023-12-02 15:35:41,799 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 15:35:41,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:35:41,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 24 [2023-12-02 15:35:41,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186836363] [2023-12-02 15:35:41,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:35:41,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 15:35:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:35:41,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 15:35:41,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=443, Unknown=16, NotChecked=90, Total=650 [2023-12-02 15:35:41,801 INFO L87 Difference]: Start difference. First operand 92787 states and 470632 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:35:42,207 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| 3) 1) (= (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1) |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) 0) 1) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-12-02 15:35:42,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= |c_thr1Thread1of4ForFork0_#t~mem5#1| 1) (= (select |c_#valid| 3) 1) (= (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1) |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) 0) 1) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-12-02 15:35:44,243 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1) |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) 0) 1) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-12-02 15:35:44,722 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) 0) 1) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-12-02 15:35:44,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= |c_thr1Thread1of4ForFork0_#t~mem5#1| 1) (= (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1) |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) 0) 1) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-12-02 15:35:45,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (= |c_thr1Thread1of4ForFork0_#t~mem5#1| 1) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select (select |c_#memory_int| 3) 0) 1) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-12-02 15:35:45,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| 3) 1) (= (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1) |c_thr1Thread1of4ForFork0_~vn~0#1|) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (= |c_~#value~0.base| 3) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-12-02 15:35:50,886 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (select .cse2 |c_~#value~0.offset|))) (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse4 (mod .cse6 4294967296))) (let ((.cse3 (= .cse0 .cse4))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1) |c_thr1Thread1of4ForFork0_~vn~0#1|) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse4 (mod (select (select (store (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ 1 .cse6))))) (store .cse5 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse5 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= .cse4 4294967295))))))) is different from false [2023-12-02 15:35:50,926 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1) |c_thr1Thread1of4ForFork0_~vn~0#1|) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-12-02 15:35:54,013 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296))) (and (< .cse0 .cse1) (or (= .cse0 4294967295) (let ((.cse4 (= .cse0 .cse1))) (and (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1))))) (store .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse4)) (or .cse4 (forall ((v_DerPreprocessor_2 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_141 (Array Int Int))) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_141) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_2 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))))) is different from false [2023-12-02 15:36:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:36:00,935 INFO L93 Difference]: Finished difference Result 364461 states and 1794008 transitions. [2023-12-02 15:36:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-12-02 15:36:00,936 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 15:36:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:36:03,905 INFO L225 Difference]: With dead ends: 364461 [2023-12-02 15:36:03,905 INFO L226 Difference]: Without dead ends: 364461 [2023-12-02 15:36:03,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 1464 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=691, Invalid=3343, Unknown=46, NotChecked=1620, Total=5700 [2023-12-02 15:36:03,907 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2579 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 3780 mSolverCounterSat, 122 mSolverCounterUnsat, 483 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 16511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 3780 IncrementalHoareTripleChecker+Invalid, 483 IncrementalHoareTripleChecker+Unknown, 12126 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:36:03,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 371 Invalid, 16511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 3780 Invalid, 483 Unknown, 12126 Unchecked, 11.7s Time] [2023-12-02 15:36:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364461 states. [2023-12-02 15:36:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364461 to 140291. [2023-12-02 15:36:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140291 states, 140275 states have (on average 5.110026733202638) internal successors, (716809), 140290 states have internal predecessors, (716809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140291 states to 140291 states and 716809 transitions. [2023-12-02 15:36:13,675 INFO L78 Accepts]: Start accepts. Automaton has 140291 states and 716809 transitions. Word has length 12 [2023-12-02 15:36:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:36:13,675 INFO L495 AbstractCegarLoop]: Abstraction has 140291 states and 716809 transitions. [2023-12-02 15:36:13,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 140291 states and 716809 transitions. [2023-12-02 15:36:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 15:36:13,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:36:13,677 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:36:13,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:36:13,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:36:13,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:36:13,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:36:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1809020589, now seen corresponding path program 1 times [2023-12-02 15:36:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:36:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911614872] [2023-12-02 15:36:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:36:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:14,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:36:14,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911614872] [2023-12-02 15:36:14,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911614872] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:36:14,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578581688] [2023-12-02 15:36:14,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:14,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:36:14,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:36:14,249 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:36:14,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:36:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:14,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 15:36:14,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:14,365 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:36:14,365 INFO L378 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 [2023-12-02 15:36:14,397 INFO L378 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 16 treesize of output 11 [2023-12-02 15:36:14,554 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:36:14,555 INFO L378 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 2 case distinctions, treesize of input 35 treesize of output 18 [2023-12-02 15:36:14,719 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 15:36:14,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2023-12-02 15:36:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:36:14,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:36:14,828 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod |c_thr1Thread1of4ForFork0_#t~mem5#1| 4294967296) 0) (forall ((v_ArrVal_175 (Array Int Int))) (< (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) is different from false [2023-12-02 15:36:14,839 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_175 (Array Int Int))) (< (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)) is different from false [2023-12-02 15:36:15,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296))) (or (= .cse0 4294967295) (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))) is different from false [2023-12-02 15:36:15,232 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_170 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_170))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse4 4294967296))) (or (= .cse0 4294967295) (< .cse0 (mod (select (select (store (let ((.cse1 (store .cse3 |c_~#value~0.offset| (+ .cse4 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse1) |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select (store .cse2 |c_~#value~0.base| .cse1) |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-12-02 15:36:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 15:36:15,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578581688] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:36:15,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [573941323] [2023-12-02 15:36:15,235 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 15:36:15,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:36:15,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 24 [2023-12-02 15:36:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722956905] [2023-12-02 15:36:15,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:36:15,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 15:36:15,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:36:15,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 15:36:15,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=369, Unknown=15, NotChecked=172, Total=650 [2023-12-02 15:36:15,237 INFO L87 Difference]: Start difference. First operand 140291 states and 716809 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:15,694 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select .cse8 |c_~#value~0.offset|))) (let ((.cse0 (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse3 (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296)))) (.cse4 (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|))) (.cse5 (= .cse6 (mod .cse2 4294967296)))) (and .cse0 (= (select |c_#valid| 3) 1) (= .cse1 |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (and .cse0 (= .cse1 .cse2) .cse3 .cse4) (= (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 0)) (or (not .cse5) (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (< .cse6 (mod (select (select (store (let ((.cse7 (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse7 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (select (select |c_#memory_int| 3) 0) 1) .cse3 (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) .cse4 (or .cse5 (forall ((v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse6 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-12-02 15:36:15,764 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select .cse8 |c_~#value~0.offset|))) (let ((.cse0 (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse3 (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296)))) (.cse4 (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|))) (.cse5 (= .cse6 (mod .cse2 4294967296)))) (and .cse0 (= |c_thr1Thread1of4ForFork0_#t~mem5#1| 1) (= (select |c_#valid| 3) 1) (= .cse1 |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (and .cse0 (= .cse1 .cse2) .cse3 .cse4) (= (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 0)) (or (not .cse5) (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (< .cse6 (mod (select (select (store (let ((.cse7 (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse7 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (select (select |c_#memory_int| 3) 0) 1) .cse3 (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) .cse4 (or .cse5 (forall ((v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse6 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-12-02 15:36:17,541 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select .cse8 |c_~#value~0.offset|))) (let ((.cse0 (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse3 (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296)))) (.cse4 (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|))) (.cse5 (= .cse6 (mod .cse2 4294967296)))) (and .cse0 (= .cse1 |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (and .cse0 (= .cse1 .cse2) .cse3 .cse4) (= (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 0)) (or (not .cse5) (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (< .cse6 (mod (select (select (store (let ((.cse7 (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse7 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (select (select |c_#memory_int| 3) 0) 1) .cse3 (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) .cse4 (or .cse5 (forall ((v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse6 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-12-02 15:36:17,944 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (not .cse0) (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (< .cse1 (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (select (select |c_#memory_int| 3) 0) 1) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse0 (forall ((v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-12-02 15:36:18,026 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select .cse8 |c_~#value~0.offset|))) (let ((.cse0 (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse3 (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296)))) (.cse4 (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|))) (.cse5 (= .cse6 (mod .cse2 4294967296)))) (and .cse0 (= |c_thr1Thread1of4ForFork0_#t~mem5#1| 1) (= .cse1 |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (and .cse0 (= .cse1 .cse2) .cse3 .cse4) (= (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 0)) (or (not .cse5) (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (< .cse6 (mod (select (select (store (let ((.cse7 (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse7 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (select (select |c_#memory_int| 3) 0) 1) .cse3 (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) .cse4 (or .cse5 (forall ((v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse6 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-12-02 15:36:18,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (= |c_thr1Thread1of4ForFork0_#t~mem5#1| 1) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (not .cse0) (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (< .cse1 (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (= (select (select |c_#memory_int| 3) 0) 1) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse0 (forall ((v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-12-02 15:36:18,944 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| 3) 1) (= (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1) |c_thr1Thread1of4ForFork0_~vn~0#1|) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (not .cse0) (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (< .cse1 (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (= |c_~#value~0.base| 3) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (forall ((v_ArrVal_175 (Array Int Int))) (< .cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or .cse0 (forall ((v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-12-02 15:36:24,854 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1) |c_thr1Thread1of4ForFork0_~vn~0#1|) (or (not .cse0) (forall ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (< .cse1 (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (forall ((v_ArrVal_175 (Array Int Int))) (< .cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or .cse0 (forall ((v_DerPreprocessor_3 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_175 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_3 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_175) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2023-12-02 15:36:29,684 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] [2023-12-02 15:36:32,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:36:38,252 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] [2023-12-02 15:36:40,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:36:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:36:44,716 INFO L93 Difference]: Finished difference Result 318073 states and 1577189 transitions. [2023-12-02 15:36:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 15:36:44,718 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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 [2023-12-02 15:36:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:36:47,276 INFO L225 Difference]: With dead ends: 318073 [2023-12-02 15:36:47,276 INFO L226 Difference]: Without dead ends: 318073 [2023-12-02 15:36:47,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 8 SyntacticMatches, 13 SemanticMatches, 65 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=527, Invalid=2462, Unknown=29, NotChecked=1404, Total=4422 [2023-12-02 15:36:47,291 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1977 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 3905 mSolverCounterSat, 75 mSolverCounterUnsat, 310 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1977 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 18456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3905 IncrementalHoareTripleChecker+Invalid, 310 IncrementalHoareTripleChecker+Unknown, 14166 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:36:47,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1977 Valid, 432 Invalid, 18456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3905 Invalid, 310 Unknown, 14166 Unchecked, 23.5s Time] [2023-12-02 15:36:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318073 states. [2023-12-02 15:36:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318073 to 140781. [2023-12-02 15:36:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140781 states, 140765 states have (on average 5.113146023514368) internal successors, (719752), 140780 states have internal predecessors, (719752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140781 states to 140781 states and 719752 transitions. [2023-12-02 15:36:55,630 INFO L78 Accepts]: Start accepts. Automaton has 140781 states and 719752 transitions. Word has length 13 [2023-12-02 15:36:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:36:55,631 INFO L495 AbstractCegarLoop]: Abstraction has 140781 states and 719752 transitions. [2023-12-02 15:36:55,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:36:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 140781 states and 719752 transitions. [2023-12-02 15:36:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 15:36:55,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:36:55,632 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:36:55,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 15:36:55,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:36:55,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:36:55,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:36:55,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1301156814, now seen corresponding path program 1 times [2023-12-02 15:36:55,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:36:55,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123038886] [2023-12-02 15:36:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:55,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:36:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:36:56,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:36:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123038886] [2023-12-02 15:36:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123038886] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:36:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555152193] [2023-12-02 15:36:56,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:36:56,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:36:56,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:36:56,215 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:36:56,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:36:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:36:56,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 15:36:56,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:36:56,338 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:36:56,339 INFO L378 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 [2023-12-02 15:36:56,371 INFO L378 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 16 treesize of output 11 [2023-12-02 15:36:56,401 INFO L378 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 16 treesize of output 11 [2023-12-02 15:36:56,537 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:36:56,537 INFO L378 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 2 case distinctions, treesize of input 35 treesize of output 18 [2023-12-02 15:36:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:36:56,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:36:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 15:36:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555152193] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:36:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1980597248] [2023-12-02 15:36:59,198 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 15:36:59,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:36:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2023-12-02 15:36:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870460058] [2023-12-02 15:36:59,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:36:59,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 15:36:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:36:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 15:36:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=383, Unknown=4, NotChecked=0, Total=462 [2023-12-02 15:36:59,200 INFO L87 Difference]: Start difference. First operand 140781 states and 719752 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:02,126 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] [2023-12-02 15:37:02,870 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (select .cse6 |c_~#value~0.offset|))) (let ((.cse1 (mod .cse7 4294967296)) (.cse3 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (let ((.cse4 (= .cse1 .cse3)) (.cse0 (= .cse1 4294967295)) (.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ 1 .cse7))))) (and (or .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int)) (< .cse1 (mod (select (select (store .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_4 (Array Int Int))) (< .cse3 (mod (select (select (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse4) (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int)) (< .cse3 (mod (select (select (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread2of4ForFork0_~vn~0#1|)))) (store .cse5 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse5 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse4)) (not (= |c_~#value~0.base| |c_thr1Thread2of4ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of4ForFork0_~vn~0#1| 1) (= |c_thr1Thread2of4ForFork0_~v~0#1| 0) (or .cse0 (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int)) (< .cse1 (mod (select (select (store .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread2of4ForFork0_~#casret~0#1.base|) 0 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2023-12-02 15:37:04,931 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] [2023-12-02 15:37:06,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:37:10,139 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] [2023-12-02 15:37:13,161 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] [2023-12-02 15:37:15,315 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] [2023-12-02 15:37:17,530 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] [2023-12-02 15:37:19,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:37:22,356 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] [2023-12-02 15:37:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:37:26,983 INFO L93 Difference]: Finished difference Result 400335 states and 2010886 transitions. [2023-12-02 15:37:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 15:37:26,983 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 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 [2023-12-02 15:37:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:37:30,231 INFO L225 Difference]: With dead ends: 400335 [2023-12-02 15:37:30,231 INFO L226 Difference]: Without dead ends: 400335 [2023-12-02 15:37:30,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=306, Invalid=1333, Unknown=5, NotChecked=78, Total=1722 [2023-12-02 15:37:30,233 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1005 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 3283 mSolverCounterSat, 37 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 4194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3283 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 861 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:37:30,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 342 Invalid, 4194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3283 Invalid, 13 Unknown, 861 Unchecked, 22.5s Time] [2023-12-02 15:37:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400335 states. [2023-12-02 15:37:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400335 to 222675. [2023-12-02 15:37:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222675 states, 222659 states have (on average 5.226076646351596) internal successors, (1163633), 222674 states have internal predecessors, (1163633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222675 states to 222675 states and 1163633 transitions. [2023-12-02 15:37:42,342 INFO L78 Accepts]: Start accepts. Automaton has 222675 states and 1163633 transitions. Word has length 13 [2023-12-02 15:37:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:37:42,343 INFO L495 AbstractCegarLoop]: Abstraction has 222675 states and 1163633 transitions. [2023-12-02 15:37:42,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 222675 states and 1163633 transitions. [2023-12-02 15:37:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:37:42,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:37:42,345 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:37:42,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 15:37:42,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:37:42,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-02 15:37:42,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:37:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash -992996241, now seen corresponding path program 2 times [2023-12-02 15:37:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:37:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679827724] [2023-12-02 15:37:42,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:37:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:37:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:37:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:37:42,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:37:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679827724] [2023-12-02 15:37:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679827724] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:37:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604079452] [2023-12-02 15:37:42,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 15:37:42,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:37:42,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:37:42,933 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:37:42,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc13aa96-7c78-43b7-8722-9009a18f9f7a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:37:43,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 15:37:43,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:37:43,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 15:37:43,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:37:43,033 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 15:37:43,034 INFO L378 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 [2023-12-02 15:37:43,062 INFO L378 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 16 treesize of output 11 [2023-12-02 15:37:43,199 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 15:37:43,199 INFO L378 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 2 case distinctions, treesize of input 35 treesize of output 18 [2023-12-02 15:37:43,344 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 15:37:43,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2023-12-02 15:37:43,399 INFO L378 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 16 treesize of output 11 [2023-12-02 15:37:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:37:43,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:37:43,441 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int))) (< (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) is different from false [2023-12-02 15:37:43,511 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_249 (Array Int Int))) (< (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)) is different from false [2023-12-02 15:37:43,581 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2023-12-02 15:37:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2023-12-02 15:37:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604079452] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:37:43,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2037962270] [2023-12-02 15:37:43,993 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2023-12-02 15:37:43,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:37:43,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2023-12-02 15:37:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877438563] [2023-12-02 15:37:43,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:37:43,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 15:37:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:37:43,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 15:37:43,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=434, Unknown=19, NotChecked=138, Total=702 [2023-12-02 15:37:43,995 INFO L87 Difference]: Start difference. First operand 222675 states and 1163633 transitions. Second operand has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:37:44,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse0 (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse6 (select .cse4 |c_~#value~0.offset|)) (.cse7 (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296)))) (.cse8 (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)))) (and .cse0 (= (select |c_#valid| 3) 1) (= .cse1 |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_249 (Array Int Int))) (< .cse2 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= .cse2 4294967295) (let ((.cse5 (= .cse2 (mod .cse6 4294967296)))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse2 (mod (select (select (store (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse1)))) (store .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse5)) (or .cse5 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse2 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (or (and .cse0 (= .cse1 .cse6) .cse7 .cse8) (= (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 0)) (= (select (select |c_#memory_int| 3) 0) 1) .cse7 (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) .cse8))) is different from false [2023-12-02 15:37:44,480 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse6 (select .cse4 |c_~#value~0.offset|)) (.cse7 (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296)))) (.cse8 (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)))) (and .cse0 (= |c_thr1Thread1of4ForFork0_#t~mem5#1| 1) (= (select |c_#valid| 3) 1) (= .cse1 |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (let ((.cse2 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296))) (or (= .cse2 4294967295) (let ((.cse5 (= .cse2 (mod .cse6 4294967296)))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse2 (mod (select (select (store (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse1)))) (store .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse5)) (or .cse5 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse2 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))) (or (and .cse0 (= .cse1 .cse6) .cse7 .cse8) (= (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 0)) (= (select (select |c_#memory_int| 3) 0) 1) .cse7 (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) .cse8))) is different from false [2023-12-02 15:37:45,438 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (let ((.cse0 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse4 (not .cse7)) (.cse5 (or .cse7 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse1 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| 3) 1) (= .cse0 |c_thr1Thread1of4ForFork0_~vn~0#1|) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (= .cse1 4294967295) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse1 (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse0)))) (store .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse4) .cse5)) (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse1 (mod (select (select (store (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (store .cse6 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse6 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse4) .cse5 (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (= |c_~#value~0.base| 3) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)))))) is different from false [2023-12-02 15:37:46,465 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse0 (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse6 (select .cse4 |c_~#value~0.offset|)) (.cse7 (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296)))) (.cse8 (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)))) (and .cse0 (= .cse1 |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_249 (Array Int Int))) (< .cse2 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= .cse2 4294967295) (let ((.cse5 (= .cse2 (mod .cse6 4294967296)))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse2 (mod (select (select (store (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse1)))) (store .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse5)) (or .cse5 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse2 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (or (and .cse0 (= .cse1 .cse6) .cse7 .cse8) (= (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 0)) (= (select (select |c_#memory_int| 3) 0) 1) .cse7 (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) .cse8))) is different from false [2023-12-02 15:37:47,225 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (.cse1 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse6 (select .cse4 |c_~#value~0.offset|)) (.cse7 (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296)))) (.cse8 (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)))) (and .cse0 (= |c_thr1Thread1of4ForFork0_#t~mem5#1| 1) (= .cse1 |c_thr1Thread1of4ForFork0_~vn~0#1|) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (let ((.cse2 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296))) (or (= .cse2 4294967295) (let ((.cse5 (= .cse2 (mod .cse6 4294967296)))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse2 (mod (select (select (store (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse1)))) (store .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse5)) (or .cse5 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse2 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))) (or (and .cse0 (= .cse1 .cse6) .cse7 .cse8) (= (select (select |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 0)) (= (select (select |c_#memory_int| 3) 0) 1) .cse7 (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) .cse8))) is different from false [2023-12-02 15:37:48,429 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (select .cse3 |c_~#value~0.offset|))) (let ((.cse0 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse5 (mod .cse7 4294967296))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| 3) 1) (= .cse0 |c_thr1Thread1of4ForFork0_~vn~0#1|) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (let ((.cse1 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296))) (or (= .cse1 4294967295) (let ((.cse4 (= .cse1 .cse5))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse1 (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse0)))) (store .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse4)) (or .cse4 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse1 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (= |c_~#value~0.base| 3) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|)) (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse5 (mod (select (select (store (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ 1 .cse7))))) (store .cse6 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse6 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= .cse5 4294967295)))))) is different from false [2023-12-02 15:37:48,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse1 (mod (select .cse4 |c_~#value~0.offset|) 4294967296)) (.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296))) (and (< .cse0 .cse1) (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= (select |c_#valid| 3) 1) (= .cse2 |c_thr1Thread1of4ForFork0_~vn~0#1|) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (or (= .cse0 4294967295) (let ((.cse5 (= .cse0 .cse1))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse0 (mod (select (select (store (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse2)))) (store .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse5)) (or .cse5 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (or (= (mod |c_thr1Thread1of4ForFork0_#t~mem5#1| 4294967296) 0) (forall ((v_ArrVal_249 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (= |c_~#value~0.base| 3) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|))))) is different from false [2023-12-02 15:37:50,891 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296))) (and (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_249 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or (= .cse0 4294967295) (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))) (= (select (select |c_#memory_int| 3) 0) 1) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|))) is different from false [2023-12-02 15:37:52,175 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread1of4ForFork0_#t~mem5#1| 1) (exists ((|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (= (select (select |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base|) 0) 1)) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296))) (or (= .cse0 4294967295) (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))))) (= (select (select |c_#memory_int| 3) 0) 1) (= |c_thr1Thread1of4ForFork0_~v~0#1| 0) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|)) is different from false [2023-12-02 15:37:53,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1)) (.cse1 (mod (select .cse4 |c_~#value~0.offset|) 4294967296)) (.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296))) (and (< .cse0 .cse1) (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (= .cse2 |c_thr1Thread1of4ForFork0_~vn~0#1|) (or (= .cse0 4294967295) (let ((.cse5 (= .cse0 .cse1))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse0 (mod (select (select (store (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse2)))) (store .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse5)) (or .cse5 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) (or (= (mod |c_thr1Thread1of4ForFork0_#t~mem5#1| 4294967296) 0) (forall ((v_ArrVal_249 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (<= |c_thr1Thread1of4ForFork0_~v~0#1| (+ 4294967294 (* (div |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) 4294967296))) (not (= |c_~#value~0.base| |c_thr1Thread1of4ForFork0_~#casret~0#1.base|))))) is different from false [2023-12-02 15:38:00,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 15:38:00,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296)) (.cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296))) (and (< .cse0 .cse1) (or (= .cse0 4294967295) (let ((.cse4 (= .cse0 .cse1))) (and (or (forall ((v_ArrVal_249 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (< .cse0 (mod (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1))))) (store .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of4ForFork0_~#casret~0#1.base|) |c_thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse4)) (or .cse4 (forall ((v_ArrVal_249 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.base| Int)) (or (< .cse0 (mod (select (select (store (store |c_#memory_int| |thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_249) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_5 |c_thr1Thread1of4ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))))) is different from false [2023-12-02 15:38:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:38:11,349 INFO L93 Difference]: Finished difference Result 688111 states and 3525711 transitions. [2023-12-02 15:38:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-02 15:38:11,350 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 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 [2023-12-02 15:38:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:38:18,012 INFO L225 Difference]: With dead ends: 688111 [2023-12-02 15:38:18,012 INFO L226 Difference]: Without dead ends: 688111 [2023-12-02 15:38:18,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 12 SyntacticMatches, 19 SemanticMatches, 74 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 1641 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=640, Invalid=3127, Unknown=71, NotChecked=1862, Total=5700 [2023-12-02 15:38:18,014 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1573 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 5457 mSolverCounterSat, 73 mSolverCounterUnsat, 1431 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 22438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 5457 IncrementalHoareTripleChecker+Invalid, 1431 IncrementalHoareTripleChecker+Unknown, 15477 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:38:18,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 559 Invalid, 22438 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [73 Valid, 5457 Invalid, 1431 Unknown, 15477 Unchecked, 15.9s Time] [2023-12-02 15:38:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688111 states.