./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack-1.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_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/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_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/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_75adf439-26d8-4dc0-b266-da38ad9b9fc2/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 a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:35:49,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:35:49,160 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 17:35:49,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:35:49,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:35:49,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:35:49,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:35:49,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:35:49,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:35:49,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:35:49,193 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:35:49,193 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:35:49,194 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:35:49,194 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:35:49,195 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:35:49,195 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:35:49,195 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:35:49,196 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:35:49,196 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:35:49,197 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:35:49,197 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:35:49,198 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:35:49,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:35:49,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:35:49,200 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:35:49,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:35:49,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:35:49,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:35:49,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:35:49,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:35:49,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:35:49,203 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:35:49,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:35:49,203 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:35:49,204 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:35:49,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:35:49,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:35:49,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:35:49,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:35:49,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:35:49,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:35:49,205 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:35:49,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:35:49,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:35:49,206 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:35:49,206 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:35:49,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:35:49,206 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_75adf439-26d8-4dc0-b266-da38ad9b9fc2/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_75adf439-26d8-4dc0-b266-da38ad9b9fc2/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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2023-12-02 17:35:49,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:35:49,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:35:49,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:35:49,448 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:35:49,449 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:35:49,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread/stack-1.i [2023-12-02 17:35:52,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:35:52,449 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:35:52,450 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/sv-benchmarks/c/pthread/stack-1.i [2023-12-02 17:35:52,467 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/data/b714e0455/af97a81832654a809a72de1b58c26c0b/FLAGa9ed6380c [2023-12-02 17:35:52,481 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/data/b714e0455/af97a81832654a809a72de1b58c26c0b [2023-12-02 17:35:52,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:35:52,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:35:52,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:35:52,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:35:52,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:35:52,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:35:52" (1/1) ... [2023-12-02 17:35:52,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317439a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:52, skipping insertion in model container [2023-12-02 17:35:52,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:35:52" (1/1) ... [2023-12-02 17:35:52,548 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:35:52,911 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_75adf439-26d8-4dc0-b266-da38ad9b9fc2/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2023-12-02 17:35:52,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:35:52,954 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:35:52,998 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_75adf439-26d8-4dc0-b266-da38ad9b9fc2/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2023-12-02 17:35:53,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:35:53,079 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:35:53,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53 WrapperNode [2023-12-02 17:35:53,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:35:53,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:35:53,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:35:53,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:35:53,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,136 INFO L138 Inliner]: procedures = 278, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 158 [2023-12-02 17:35:53,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:35:53,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:35:53,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:35:53,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:35:53,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:35:53,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:35:53,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:35:53,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:35:53,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (1/1) ... [2023-12-02 17:35:53,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:35:53,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:35:53,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:35:53,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:35:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-02 17:35:53,233 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-02 17:35:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-02 17:35:53,233 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-02 17:35:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:35:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:35:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 17:35:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 17:35:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 17:35:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 17:35:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:35:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:35:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:35:53,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:35:53,236 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 17:35:53,384 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:35:53,386 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:35:53,626 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:35:53,860 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:35:53,860 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 17:35:53,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:35:53 BoogieIcfgContainer [2023-12-02 17:35:53,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:35:53,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:35:53,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:35:53,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:35:53,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:35:52" (1/3) ... [2023-12-02 17:35:53,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b2a22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:35:53, skipping insertion in model container [2023-12-02 17:35:53,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:53" (2/3) ... [2023-12-02 17:35:53,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b2a22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:35:53, skipping insertion in model container [2023-12-02 17:35:53,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:35:53" (3/3) ... [2023-12-02 17:35:53,869 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2023-12-02 17:35:53,875 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 17:35:53,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:35:53,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 17:35:53,883 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 17:35:53,935 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 17:35:53,960 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 35 transitions, 84 flow [2023-12-02 17:35:54,003 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 260 states, 257 states have (on average 2.7042801556420235) internal successors, (695), 259 states have internal predecessors, (695), 0 states have call successors, (0), 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 17:35:54,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:35:54,026 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;@6b08a0f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:35:54,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 17:35:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 260 states, 257 states have (on average 2.7042801556420235) internal successors, (695), 259 states have internal predecessors, (695), 0 states have call successors, (0), 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 17:35:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:35:54,037 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:54,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:35:54,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:35:54,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash 584792005, now seen corresponding path program 1 times [2023-12-02 17:35:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:54,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666219917] [2023-12-02 17:35:54,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:54,402 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 17:35:54,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666219917] [2023-12-02 17:35:54,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666219917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:35:54,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:35:54,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:35:54,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201291018] [2023-12-02 17:35:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:35:54,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:35:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:35:54,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:35:54,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:35:54,437 INFO L87 Difference]: Start difference. First operand has 260 states, 257 states have (on average 2.7042801556420235) internal successors, (695), 259 states have internal predecessors, (695), 0 states have call successors, (0), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 17:35:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:35:54,560 INFO L93 Difference]: Finished difference Result 362 states and 892 transitions. [2023-12-02 17:35:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:35:54,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-12-02 17:35:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:35:54,578 INFO L225 Difference]: With dead ends: 362 [2023-12-02 17:35:54,578 INFO L226 Difference]: Without dead ends: 332 [2023-12-02 17:35:54,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:35:54,583 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:35:54,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:35:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-12-02 17:35:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2023-12-02 17:35:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 329 states have (on average 2.507598784194529) internal successors, (825), 331 states have internal predecessors, (825), 0 states have call successors, (0), 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 17:35:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 825 transitions. [2023-12-02 17:35:54,649 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 825 transitions. Word has length 8 [2023-12-02 17:35:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:35:54,649 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 825 transitions. [2023-12-02 17:35:54,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 17:35:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 825 transitions. [2023-12-02 17:35:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 17:35:54,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:54,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:35:54,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:35:54,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:35:54,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash 403558816, now seen corresponding path program 1 times [2023-12-02 17:35:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:54,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024274410] [2023-12-02 17:35:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:35:54,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024274410] [2023-12-02 17:35:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024274410] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:35:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835977058] [2023-12-02 17:35:54,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:54,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:35:54,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:35:54,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:35:54,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:35:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:55,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:35:55,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:35:55,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:35:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:35:55,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:35:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:35:55,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835977058] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:35:55,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [403391665] [2023-12-02 17:35:55,308 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 17:35:55,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:35:55,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2023-12-02 17:35:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103059742] [2023-12-02 17:35:55,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:35:55,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 17:35:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:35:55,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 17:35:55,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:35:55,314 INFO L87 Difference]: Start difference. First operand 332 states and 825 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 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 17:35:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:35:55,843 INFO L93 Difference]: Finished difference Result 1528 states and 3822 transitions. [2023-12-02 17:35:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 17:35:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 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 14 [2023-12-02 17:35:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:35:55,857 INFO L225 Difference]: With dead ends: 1528 [2023-12-02 17:35:55,857 INFO L226 Difference]: Without dead ends: 1456 [2023-12-02 17:35:55,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2023-12-02 17:35:55,859 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 426 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:35:55,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 96 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:35:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2023-12-02 17:35:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1058. [2023-12-02 17:35:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1055 states have (on average 2.614218009478673) internal successors, (2758), 1057 states have internal predecessors, (2758), 0 states have call successors, (0), 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 17:35:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2758 transitions. [2023-12-02 17:35:55,927 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2758 transitions. Word has length 14 [2023-12-02 17:35:55,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:35:55,928 INFO L495 AbstractCegarLoop]: Abstraction has 1058 states and 2758 transitions. [2023-12-02 17:35:55,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 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 17:35:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2758 transitions. [2023-12-02 17:35:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 17:35:55,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:55,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:35:55,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:35:56,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:35:56,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:35:56,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash 947383181, now seen corresponding path program 1 times [2023-12-02 17:35:56,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:56,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658568971] [2023-12-02 17:35:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:56,220 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 17:35:56,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658568971] [2023-12-02 17:35:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658568971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:35:56,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:35:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:35:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330723055] [2023-12-02 17:35:56,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:35:56,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:35:56,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:35:56,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:35:56,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:35:56,223 INFO L87 Difference]: Start difference. First operand 1058 states and 2758 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:35:56,311 INFO L93 Difference]: Finished difference Result 644 states and 1561 transitions. [2023-12-02 17:35:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:35:56,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 17:35:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:35:56,317 INFO L225 Difference]: With dead ends: 644 [2023-12-02 17:35:56,317 INFO L226 Difference]: Without dead ends: 644 [2023-12-02 17:35:56,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:35:56,319 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:35:56,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:35:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-12-02 17:35:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 596. [2023-12-02 17:35:56,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 592 states have (on average 2.4341216216216215) internal successors, (1441), 595 states have internal predecessors, (1441), 0 states have call successors, (0), 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 17:35:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1441 transitions. [2023-12-02 17:35:56,336 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1441 transitions. Word has length 15 [2023-12-02 17:35:56,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:35:56,337 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 1441 transitions. [2023-12-02 17:35:56,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1441 transitions. [2023-12-02 17:35:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 17:35:56,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:56,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:35:56,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 17:35:56,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:35:56,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:56,341 INFO L85 PathProgramCache]: Analyzing trace with hash 354750314, now seen corresponding path program 1 times [2023-12-02 17:35:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:56,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28328613] [2023-12-02 17:35:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:56,934 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 17:35:56,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28328613] [2023-12-02 17:35:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28328613] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:35:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:35:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:35:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070613977] [2023-12-02 17:35:56,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:35:56,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:35:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:35:56,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:35:56,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:35:56,937 INFO L87 Difference]: Start difference. First operand 596 states and 1441 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:35:57,079 INFO L93 Difference]: Finished difference Result 795 states and 1902 transitions. [2023-12-02 17:35:57,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:35:57,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 17:35:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:35:57,085 INFO L225 Difference]: With dead ends: 795 [2023-12-02 17:35:57,085 INFO L226 Difference]: Without dead ends: 766 [2023-12-02 17:35:57,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:35:57,086 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:35:57,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 28 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:35:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-12-02 17:35:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 689. [2023-12-02 17:35:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 685 states have (on average 2.4452554744525545) internal successors, (1675), 688 states have internal predecessors, (1675), 0 states have call successors, (0), 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 17:35:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1675 transitions. [2023-12-02 17:35:57,107 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1675 transitions. Word has length 17 [2023-12-02 17:35:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:35:57,107 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1675 transitions. [2023-12-02 17:35:57,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1675 transitions. [2023-12-02 17:35:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 17:35:57,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:57,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:35:57,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 17:35:57,110 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:35:57,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash -690340822, now seen corresponding path program 2 times [2023-12-02 17:35:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:57,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200167382] [2023-12-02 17:35:57,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:57,626 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 17:35:57,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:57,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200167382] [2023-12-02 17:35:57,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200167382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:35:57,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:35:57,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:35:57,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910681765] [2023-12-02 17:35:57,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:35:57,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:35:57,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:35:57,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:35:57,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:35:57,629 INFO L87 Difference]: Start difference. First operand 689 states and 1675 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:35:57,766 INFO L93 Difference]: Finished difference Result 771 states and 1847 transitions. [2023-12-02 17:35:57,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:35:57,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 17:35:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:35:57,773 INFO L225 Difference]: With dead ends: 771 [2023-12-02 17:35:57,773 INFO L226 Difference]: Without dead ends: 745 [2023-12-02 17:35:57,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:35:57,774 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:35:57,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:35:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-12-02 17:35:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 668. [2023-12-02 17:35:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 664 states have (on average 2.441265060240964) internal successors, (1621), 667 states have internal predecessors, (1621), 0 states have call successors, (0), 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 17:35:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1621 transitions. [2023-12-02 17:35:57,802 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1621 transitions. Word has length 17 [2023-12-02 17:35:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:35:57,803 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 1621 transitions. [2023-12-02 17:35:57,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1621 transitions. [2023-12-02 17:35:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 17:35:57,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:57,805 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:35:57,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 17:35:57,805 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:35:57,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash -517041105, now seen corresponding path program 1 times [2023-12-02 17:35:57,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:57,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033749827] [2023-12-02 17:35:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:57,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:35:58,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033749827] [2023-12-02 17:35:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033749827] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:35:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47699005] [2023-12-02 17:35:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:58,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:35:58,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:35:58,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:35:58,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 17:35:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:58,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 17:35:58,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:35:58,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-12-02 17:35:58,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 32 [2023-12-02 17:35:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:35:58,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:35:58,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47699005] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:35:58,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:35:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2023-12-02 17:35:58,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945590919] [2023-12-02 17:35:58,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:35:58,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:35:58,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:35:58,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:35:58,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:35:58,764 INFO L87 Difference]: Start difference. First operand 668 states and 1621 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:35:59,009 INFO L93 Difference]: Finished difference Result 1102 states and 2648 transitions. [2023-12-02 17:35:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:35:59,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 17:35:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:35:59,018 INFO L225 Difference]: With dead ends: 1102 [2023-12-02 17:35:59,018 INFO L226 Difference]: Without dead ends: 1078 [2023-12-02 17:35:59,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-02 17:35:59,019 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:35:59,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:35:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2023-12-02 17:35:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 821. [2023-12-02 17:35:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 817 states have (on average 2.4908200734394126) internal successors, (2035), 820 states have internal predecessors, (2035), 0 states have call successors, (0), 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 17:35:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2035 transitions. [2023-12-02 17:35:59,057 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2035 transitions. Word has length 23 [2023-12-02 17:35:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:35:59,057 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 2035 transitions. [2023-12-02 17:35:59,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:35:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2035 transitions. [2023-12-02 17:35:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 17:35:59,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:59,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:35:59,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 17:35:59,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 17:35:59,260 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:35:59,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:59,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2035779759, now seen corresponding path program 2 times [2023-12-02 17:35:59,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:59,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261248595] [2023-12-02 17:35:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:35:59,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:59,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261248595] [2023-12-02 17:35:59,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261248595] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:35:59,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030018985] [2023-12-02 17:35:59,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:35:59,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:35:59,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:35:59,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:35:59,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 17:35:59,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 17:35:59,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:35:59,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 17:35:59,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:35:59,981 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:35:59,981 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 15 treesize of output 15 [2023-12-02 17:36:00,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-12-02 17:36:00,248 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 33 treesize of output 26 [2023-12-02 17:36:00,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 32 [2023-12-02 17:36:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:36:00,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:36:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030018985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:36:00,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:36:00,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2023-12-02 17:36:00,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730790823] [2023-12-02 17:36:00,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:36:00,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 17:36:00,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:00,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 17:36:00,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:36:00,450 INFO L87 Difference]: Start difference. First operand 821 states and 2035 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:36:00,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:00,696 INFO L93 Difference]: Finished difference Result 967 states and 2371 transitions. [2023-12-02 17:36:00,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:36:00,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 17:36:00,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:00,705 INFO L225 Difference]: With dead ends: 967 [2023-12-02 17:36:00,705 INFO L226 Difference]: Without dead ends: 967 [2023-12-02 17:36:00,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:36:00,706 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:00,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 42 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:36:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2023-12-02 17:36:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 698. [2023-12-02 17:36:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 694 states have (on average 2.438040345821326) internal successors, (1692), 697 states have internal predecessors, (1692), 0 states have call successors, (0), 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 17:36:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1692 transitions. [2023-12-02 17:36:00,737 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1692 transitions. Word has length 23 [2023-12-02 17:36:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:00,737 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1692 transitions. [2023-12-02 17:36:00,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:36:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1692 transitions. [2023-12-02 17:36:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 17:36:00,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:00,739 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:00,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 17:36:00,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 17:36:00,941 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:36:00,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1436963112, now seen corresponding path program 1 times [2023-12-02 17:36:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:00,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905816881] [2023-12-02 17:36:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:36:01,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905816881] [2023-12-02 17:36:01,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905816881] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113899755] [2023-12-02 17:36:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:01,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:01,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:01,164 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:01,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 17:36:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:01,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 17:36:01,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:01,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:36:01,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:36:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:01,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:36:01,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113899755] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:36:01,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1921322061] [2023-12-02 17:36:01,657 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 17:36:01,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:36:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2023-12-02 17:36:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544345166] [2023-12-02 17:36:01,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:36:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:36:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:36:01,660 INFO L87 Difference]: Start difference. First operand 698 states and 1692 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 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 17:36:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:02,214 INFO L93 Difference]: Finished difference Result 1750 states and 4176 transitions. [2023-12-02 17:36:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 17:36:02,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 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 29 [2023-12-02 17:36:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:02,224 INFO L225 Difference]: With dead ends: 1750 [2023-12-02 17:36:02,225 INFO L226 Difference]: Without dead ends: 1678 [2023-12-02 17:36:02,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2023-12-02 17:36:02,226 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 305 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:02,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 91 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:36:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2023-12-02 17:36:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 968. [2023-12-02 17:36:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 964 states have (on average 2.4896265560165975) internal successors, (2400), 967 states have internal predecessors, (2400), 0 states have call successors, (0), 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 17:36:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 2400 transitions. [2023-12-02 17:36:02,258 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 2400 transitions. Word has length 29 [2023-12-02 17:36:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:02,259 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 2400 transitions. [2023-12-02 17:36:02,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 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 17:36:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 2400 transitions. [2023-12-02 17:36:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 17:36:02,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:02,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:02,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 17:36:02,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-02 17:36:02,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:36:02,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash -782689572, now seen corresponding path program 1 times [2023-12-02 17:36:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:02,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418095884] [2023-12-02 17:36:02,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:03,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418095884] [2023-12-02 17:36:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418095884] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:03,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427687581] [2023-12-02 17:36:03,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:03,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:03,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:03,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:03,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 17:36:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:03,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 17:36:03,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:03,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 17:36:03,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 17:36:03,496 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 0 case distinctions, treesize of input 82 treesize of output 66 [2023-12-02 17:36:03,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 94 [2023-12-02 17:36:03,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:03,563 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 1 case distinctions, treesize of input 84 treesize of output 39 [2023-12-02 17:36:04,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:04,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 57 [2023-12-02 17:36:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:04,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:04,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427687581] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:36:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1602453026] [2023-12-02 17:36:04,608 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 17:36:04,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:36:04,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-12-02 17:36:04,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7749614] [2023-12-02 17:36:04,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:04,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 17:36:04,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 17:36:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:36:04,612 INFO L87 Difference]: Start difference. First operand 968 states and 2400 transitions. Second operand has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 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 17:36:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:06,952 INFO L93 Difference]: Finished difference Result 3388 states and 8189 transitions. [2023-12-02 17:36:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 17:36:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 17:36:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:06,977 INFO L225 Difference]: With dead ends: 3388 [2023-12-02 17:36:06,977 INFO L226 Difference]: Without dead ends: 3203 [2023-12-02 17:36:06,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=455, Invalid=1267, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 17:36:06,978 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 346 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:06,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 285 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 17:36:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2023-12-02 17:36:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 1712. [2023-12-02 17:36:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1708 states have (on average 2.560304449648712) internal successors, (4373), 1711 states have internal predecessors, (4373), 0 states have call successors, (0), 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 17:36:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 4373 transitions. [2023-12-02 17:36:07,078 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 4373 transitions. Word has length 30 [2023-12-02 17:36:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:07,079 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 4373 transitions. [2023-12-02 17:36:07,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.631578947368421) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 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 17:36:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 4373 transitions. [2023-12-02 17:36:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 17:36:07,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:07,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:07,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 17:36:07,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:07,284 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:36:07,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:07,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1005695906, now seen corresponding path program 2 times [2023-12-02 17:36:07,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:07,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097884360] [2023-12-02 17:36:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:08,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:08,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097884360] [2023-12-02 17:36:08,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097884360] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:08,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576671033] [2023-12-02 17:36:08,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:36:08,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:08,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:08,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:08,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 17:36:08,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:36:08,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:36:08,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 17:36:08,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:08,263 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 17:36:08,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 17:36:08,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:36:08,420 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 23 treesize of output 16 [2023-12-02 17:36:08,512 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 0 case distinctions, treesize of input 66 treesize of output 50 [2023-12-02 17:36:08,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2023-12-02 17:36:08,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:08,560 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 1 case distinctions, treesize of input 56 treesize of output 31 [2023-12-02 17:36:09,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:09,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 57 [2023-12-02 17:36:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:09,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:09,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:09,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 17:36:09,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-12-02 17:36:09,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-12-02 17:36:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576671033] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:36:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1046871324] [2023-12-02 17:36:09,773 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 17:36:09,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:36:09,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2023-12-02 17:36:09,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434733603] [2023-12-02 17:36:09,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:09,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 17:36:09,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:09,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 17:36:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2023-12-02 17:36:09,775 INFO L87 Difference]: Start difference. First operand 1712 states and 4373 transitions. Second operand has 24 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 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 17:36:12,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:36:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:14,161 INFO L93 Difference]: Finished difference Result 4148 states and 10148 transitions. [2023-12-02 17:36:14,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 17:36:14,161 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 17:36:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:14,183 INFO L225 Difference]: With dead ends: 4148 [2023-12-02 17:36:14,183 INFO L226 Difference]: Without dead ends: 4090 [2023-12-02 17:36:14,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=503, Invalid=1476, Unknown=1, NotChecked=0, Total=1980 [2023-12-02 17:36:14,185 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 681 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 77 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:14,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 178 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 799 Invalid, 27 Unknown, 0 Unchecked, 3.2s Time] [2023-12-02 17:36:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2023-12-02 17:36:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 1361. [2023-12-02 17:36:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1357 states have (on average 2.5445836403831983) internal successors, (3453), 1360 states have internal predecessors, (3453), 0 states have call successors, (0), 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 17:36:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 3453 transitions. [2023-12-02 17:36:14,238 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 3453 transitions. Word has length 30 [2023-12-02 17:36:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:14,238 INFO L495 AbstractCegarLoop]: Abstraction has 1361 states and 3453 transitions. [2023-12-02 17:36:14,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 23 states have internal predecessors, (88), 0 states have call successors, (0), 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 17:36:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 3453 transitions. [2023-12-02 17:36:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:36:14,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:14,241 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2023-12-02 17:36:14,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 17:36:14,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 17:36:14,441 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:36:14,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1596587441, now seen corresponding path program 2 times [2023-12-02 17:36:14,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:14,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17766273] [2023-12-02 17:36:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:14,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17766273] [2023-12-02 17:36:14,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17766273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936642444] [2023-12-02 17:36:14,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:36:14,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:14,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:14,667 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:14,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 17:36:14,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 17:36:14,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:36:14,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 17:36:14,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:14,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:36:14,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:36:14,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:36:15,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:36:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:15,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:15,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936642444] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:36:15,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [876986281] [2023-12-02 17:36:15,283 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 17:36:15,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:36:15,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 26 [2023-12-02 17:36:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630282601] [2023-12-02 17:36:15,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:15,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:36:15,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:15,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:36:15,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:36:15,286 INFO L87 Difference]: Start difference. First operand 1361 states and 3453 transitions. Second operand has 27 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 26 states have internal predecessors, (89), 0 states have call successors, (0), 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 17:36:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:16,252 INFO L93 Difference]: Finished difference Result 8071 states and 19920 transitions. [2023-12-02 17:36:16,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-02 17:36:16,252 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 26 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 17:36:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:16,296 INFO L225 Difference]: With dead ends: 8071 [2023-12-02 17:36:16,296 INFO L226 Difference]: Without dead ends: 7955 [2023-12-02 17:36:16,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=752, Invalid=2554, Unknown=0, NotChecked=0, Total=3306 [2023-12-02 17:36:16,298 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1767 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:16,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 150 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 17:36:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7955 states. [2023-12-02 17:36:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7955 to 4878. [2023-12-02 17:36:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4874 states have (on average 2.649774312679524) internal successors, (12915), 4877 states have internal predecessors, (12915), 0 states have call successors, (0), 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 17:36:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 12915 transitions. [2023-12-02 17:36:16,481 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 12915 transitions. Word has length 32 [2023-12-02 17:36:16,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:16,481 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 12915 transitions. [2023-12-02 17:36:16,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 26 states have internal predecessors, (89), 0 states have call successors, (0), 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 17:36:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 12915 transitions. [2023-12-02 17:36:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 17:36:16,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:16,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:16,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 17:36:16,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 17:36:16,687 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:36:16,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash 205785591, now seen corresponding path program 3 times [2023-12-02 17:36:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:16,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619877218] [2023-12-02 17:36:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:17,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:17,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619877218] [2023-12-02 17:36:17,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619877218] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:17,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021985792] [2023-12-02 17:36:17,734 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:36:17,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:17,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:17,735 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:17,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 17:36:17,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:36:17,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:36:17,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 17:36:17,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:17,937 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 17:36:17,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 17:36:17,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:36:18,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 17:36:18,175 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 0 case distinctions, treesize of input 70 treesize of output 54 [2023-12-02 17:36:18,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 76 [2023-12-02 17:36:18,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 18 [2023-12-02 17:36:18,398 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 88 treesize of output 69 [2023-12-02 17:36:18,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:18,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 57 [2023-12-02 17:36:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:18,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:19,419 WARN L854 $PredicateComparison]: unable to prove that (or (= 5 c_~top~0) (let ((.cse5 (* c_~top~0 4))) (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (+ |c_~#arr~0.offset| (- 4) .cse5)) (.cse2 (+ |c_~#arr~0.offset| .cse5))) (and (not (= c_~top~0 0)) (forall ((v_ArrVal_532 (Array Int Int))) (let ((.cse0 (select v_ArrVal_532 .cse2))) (or (< .cse0 0) (< 2147483647 .cse0) (not (= v_ArrVal_532 (store .cse1 .cse2 .cse0))) (forall ((v_ArrVal_533 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_533) |c_~#arr~0.base|) .cse3) 4294967296))))))) (forall ((v_ArrVal_532 (Array Int Int))) (let ((.cse4 (select v_ArrVal_532 .cse2))) (or (< (+ .cse4 2147483648) 0) (not (= v_ArrVal_532 (store .cse1 .cse2 .cse4))) (< 0 (+ .cse4 1)) (forall ((v_ArrVal_533 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_533) |c_~#arr~0.base|) .cse3) 4294967296)))))))))) (< c_~top~0 0) (< 2147483647 c_~top~0)) is different from false [2023-12-02 17:36:19,639 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 5 c_~top~0) (let ((.cse5 (* c_~top~0 4))) (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (+ |c_~#arr~0.offset| (- 4) .cse5)) (.cse2 (+ |c_~#arr~0.offset| .cse5))) (and (not (= c_~top~0 0)) (forall ((v_ArrVal_532 (Array Int Int))) (let ((.cse0 (select v_ArrVal_532 .cse2))) (or (< .cse0 0) (< 2147483647 .cse0) (not (= v_ArrVal_532 (store .cse1 .cse2 .cse0))) (forall ((v_ArrVal_533 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_533) |c_~#arr~0.base|) .cse3) 4294967296))))))) (forall ((v_ArrVal_532 (Array Int Int))) (let ((.cse4 (select v_ArrVal_532 .cse2))) (or (< (+ .cse4 2147483648) 0) (not (= v_ArrVal_532 (store .cse1 .cse2 .cse4))) (< 0 (+ .cse4 1)) (forall ((v_ArrVal_533 (Array Int Int))) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_533) |c_~#arr~0.base|) .cse3) 4294967296)))))))))) (< c_~top~0 0) (< 2147483647 c_~top~0)) is different from false [2023-12-02 17:36:19,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~top~0 1))) (or (< 2147483646 c_~top~0) (= 5 c_~top~0) (= c_~top~0 4) (< .cse0 0) (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (* c_~top~0 4))) (and (not (= .cse0 0)) (forall ((|~#arr~0.offset| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse5 (+ |~#arr~0.offset| .cse6 4)) (.cse1 (+ |~#arr~0.offset| .cse6))) (let ((.cse2 (select v_ArrVal_532 .cse1)) (.cse3 (select v_ArrVal_532 .cse5))) (or (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_533) |c_~#arr~0.base|) .cse1) 4294967296) 4294967294)) (< 4 .cse2) (< 0 (+ .cse3 1)) (not (= v_ArrVal_532 (store (store .cse4 .cse1 .cse2) .cse5 .cse3))) (< .cse2 0) (< (+ 2147483648 .cse3) 0))))) (forall ((|~#arr~0.offset| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse10 (+ |~#arr~0.offset| .cse6 4)) (.cse7 (+ |~#arr~0.offset| .cse6))) (let ((.cse9 (select v_ArrVal_532 .cse7)) (.cse8 (select v_ArrVal_532 .cse10))) (or (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_532) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_533) |c_~#arr~0.base|) .cse7) 4294967296) 4294967294)) (< 2147483647 .cse8) (< 4 .cse9) (not (= v_ArrVal_532 (store (store .cse4 .cse7 .cse9) .cse10 .cse8))) (< .cse9 0) (< .cse8 0))))))))) is different from false [2023-12-02 17:36:20,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-12-02 17:36:20,254 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:36:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-12-02 17:36:20,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021985792] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:36:20,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1121568674] [2023-12-02 17:36:20,377 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 17:36:20,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:36:20,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2023-12-02 17:36:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620198657] [2023-12-02 17:36:20,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:20,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:36:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:20,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:36:20,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=473, Unknown=5, NotChecked=138, Total=702 [2023-12-02 17:36:20,380 INFO L87 Difference]: Start difference. First operand 4878 states and 12915 transitions. Second operand has 27 states, 27 states have (on average 3.925925925925926) internal successors, (106), 26 states have internal predecessors, (106), 0 states have call successors, (0), 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 17:36:25,478 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 17:36:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:30,444 INFO L93 Difference]: Finished difference Result 13823 states and 34751 transitions. [2023-12-02 17:36:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-02 17:36:30,444 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.925925925925926) internal successors, (106), 26 states have internal predecessors, (106), 0 states have call successors, (0), 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 36 [2023-12-02 17:36:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:30,478 INFO L225 Difference]: With dead ends: 13823 [2023-12-02 17:36:30,478 INFO L226 Difference]: Without dead ends: 13823 [2023-12-02 17:36:30,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=611, Invalid=4003, Unknown=90, NotChecked=408, Total=5112 [2023-12-02 17:36:30,480 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 815 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 79 mSolverCounterUnsat, 71 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 4947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 71 IncrementalHoareTripleChecker+Unknown, 2957 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:30,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 401 Invalid, 4947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1840 Invalid, 71 Unknown, 2957 Unchecked, 4.5s Time] [2023-12-02 17:36:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13823 states. [2023-12-02 17:36:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13823 to 5230. [2023-12-02 17:36:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5230 states, 5226 states have (on average 2.6597780329123615) internal successors, (13900), 5229 states have internal predecessors, (13900), 0 states have call successors, (0), 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 17:36:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 13900 transitions. [2023-12-02 17:36:30,691 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 13900 transitions. Word has length 36 [2023-12-02 17:36:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:30,692 INFO L495 AbstractCegarLoop]: Abstraction has 5230 states and 13900 transitions. [2023-12-02 17:36:30,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.925925925925926) internal successors, (106), 26 states have internal predecessors, (106), 0 states have call successors, (0), 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 17:36:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 13900 transitions. [2023-12-02 17:36:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 17:36:30,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:30,696 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2023-12-02 17:36:30,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 17:36:30,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:30,897 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:36:30,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1370715788, now seen corresponding path program 3 times [2023-12-02 17:36:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:30,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345971985] [2023-12-02 17:36:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 55 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:31,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:31,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345971985] [2023-12-02 17:36:31,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345971985] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:31,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578840812] [2023-12-02 17:36:31,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:36:31,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:31,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:31,053 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:31,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 17:36:31,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:36:31,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:36:31,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:36:31,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:31,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:36:31,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578840812] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:36:31,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:36:31,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2023-12-02 17:36:31,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905529286] [2023-12-02 17:36:31,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:36:31,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 17:36:31,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 17:36:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:36:31,273 INFO L87 Difference]: Start difference. First operand 5230 states and 13900 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 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 17:36:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:31,490 INFO L93 Difference]: Finished difference Result 4035 states and 9718 transitions. [2023-12-02 17:36:31,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:36:31,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2023-12-02 17:36:31,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:31,496 INFO L225 Difference]: With dead ends: 4035 [2023-12-02 17:36:31,496 INFO L226 Difference]: Without dead ends: 2593 [2023-12-02 17:36:31,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:36:31,497 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 105 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:31,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 61 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:36:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2023-12-02 17:36:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 1767. [2023-12-02 17:36:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1765 states have (on average 2.3059490084985836) internal successors, (4070), 1766 states have internal predecessors, (4070), 0 states have call successors, (0), 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 17:36:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 4070 transitions. [2023-12-02 17:36:31,560 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 4070 transitions. Word has length 38 [2023-12-02 17:36:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:31,561 INFO L495 AbstractCegarLoop]: Abstraction has 1767 states and 4070 transitions. [2023-12-02 17:36:31,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 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 17:36:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 4070 transitions. [2023-12-02 17:36:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 17:36:31,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:31,566 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:31,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 17:36:31,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:31,767 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:36:31,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1282119636, now seen corresponding path program 4 times [2023-12-02 17:36:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:31,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911260981] [2023-12-02 17:36:31,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:32,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:32,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911260981] [2023-12-02 17:36:32,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911260981] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:32,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66686960] [2023-12-02 17:36:32,954 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:36:32,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:32,955 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:32,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 17:36:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:33,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 17:36:33,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:33,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 17:36:33,253 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 0 case distinctions, treesize of input 80 treesize of output 64 [2023-12-02 17:36:33,271 INFO L349 Elim1Store]: treesize reduction 63, result has 13.7 percent of original size [2023-12-02 17:36:33,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 80 [2023-12-02 17:36:33,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:33,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 38 [2023-12-02 17:36:33,576 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 0 case distinctions, treesize of input 161 treesize of output 133 [2023-12-02 17:36:33,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:33,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 139 [2023-12-02 17:36:33,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 92 [2023-12-02 17:36:35,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:35,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 107 [2023-12-02 17:36:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:35,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:36,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66686960] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:36:36,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [888955666] [2023-12-02 17:36:36,471 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 17:36:36,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:36:36,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2023-12-02 17:36:36,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389236619] [2023-12-02 17:36:36,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:36,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 17:36:36,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:36,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 17:36:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2023-12-02 17:36:36,473 INFO L87 Difference]: Start difference. First operand 1767 states and 4070 transitions. Second operand has 26 states, 26 states have (on average 4.884615384615385) internal successors, (127), 26 states have internal predecessors, (127), 0 states have call successors, (0), 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 17:36:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:40,899 INFO L93 Difference]: Finished difference Result 6627 states and 15028 transitions. [2023-12-02 17:36:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-02 17:36:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.884615384615385) internal successors, (127), 26 states have internal predecessors, (127), 0 states have call successors, (0), 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 43 [2023-12-02 17:36:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:40,908 INFO L225 Difference]: With dead ends: 6627 [2023-12-02 17:36:40,908 INFO L226 Difference]: Without dead ends: 4664 [2023-12-02 17:36:40,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1073, Invalid=3349, Unknown=0, NotChecked=0, Total=4422 [2023-12-02 17:36:40,910 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 457 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:40,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 334 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 17:36:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2023-12-02 17:36:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 2711. [2023-12-02 17:36:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2709 states have (on average 2.304909560723514) internal successors, (6244), 2710 states have internal predecessors, (6244), 0 states have call successors, (0), 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 17:36:40,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 6244 transitions. [2023-12-02 17:36:40,962 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 6244 transitions. Word has length 43 [2023-12-02 17:36:40,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:40,962 INFO L495 AbstractCegarLoop]: Abstraction has 2711 states and 6244 transitions. [2023-12-02 17:36:40,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.884615384615385) internal successors, (127), 26 states have internal predecessors, (127), 0 states have call successors, (0), 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 17:36:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 6244 transitions. [2023-12-02 17:36:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 17:36:40,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:40,966 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:40,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-02 17:36:41,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:41,167 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:36:41,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash 974385358, now seen corresponding path program 5 times [2023-12-02 17:36:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:41,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135770197] [2023-12-02 17:36:41,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:41,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:42,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:42,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135770197] [2023-12-02 17:36:42,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135770197] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:42,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956688941] [2023-12-02 17:36:42,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:36:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:42,055 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:42,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 17:36:42,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:36:42,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:36:42,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 17:36:42,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:42,292 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 17:36:42,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 17:36:42,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 17:36:42,491 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 31 treesize of output 24 [2023-12-02 17:36:42,761 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 0 case distinctions, treesize of input 128 treesize of output 112 [2023-12-02 17:36:42,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:42,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 95 [2023-12-02 17:36:43,313 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 0 case distinctions, treesize of input 211 treesize of output 183 [2023-12-02 17:36:43,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:43,322 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 183 treesize of output 135 [2023-12-02 17:36:46,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:46,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 311 treesize of output 107 [2023-12-02 17:36:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:46,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:47,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:47,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 17:36:47,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-12-02 17:36:47,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-12-02 17:36:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956688941] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:36:47,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108904625] [2023-12-02 17:36:47,288 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 17:36:47,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:36:47,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 31 [2023-12-02 17:36:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689532711] [2023-12-02 17:36:47,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:47,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 17:36:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 17:36:47,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2023-12-02 17:36:47,290 INFO L87 Difference]: Start difference. First operand 2711 states and 6244 transitions. Second operand has 32 states, 32 states have (on average 3.96875) internal successors, (127), 31 states have internal predecessors, (127), 0 states have call successors, (0), 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 17:36:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:53,335 INFO L93 Difference]: Finished difference Result 4451 states and 10014 transitions. [2023-12-02 17:36:53,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-02 17:36:53,336 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.96875) internal successors, (127), 31 states have internal predecessors, (127), 0 states have call successors, (0), 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 43 [2023-12-02 17:36:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:53,340 INFO L225 Difference]: With dead ends: 4451 [2023-12-02 17:36:53,340 INFO L226 Difference]: Without dead ends: 3279 [2023-12-02 17:36:53,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1131, Invalid=4721, Unknown=0, NotChecked=0, Total=5852 [2023-12-02 17:36:53,343 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1755 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:53,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 321 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 17:36:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2023-12-02 17:36:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 1208. [2023-12-02 17:36:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1206 states have (on average 2.246268656716418) internal successors, (2709), 1207 states have internal predecessors, (2709), 0 states have call successors, (0), 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 17:36:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 2709 transitions. [2023-12-02 17:36:53,369 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 2709 transitions. Word has length 43 [2023-12-02 17:36:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:53,369 INFO L495 AbstractCegarLoop]: Abstraction has 1208 states and 2709 transitions. [2023-12-02 17:36:53,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.96875) internal successors, (127), 31 states have internal predecessors, (127), 0 states have call successors, (0), 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 17:36:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2709 transitions. [2023-12-02 17:36:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-02 17:36:53,371 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:53,371 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:53,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 17:36:53,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:53,572 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:36:53,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1389202290, now seen corresponding path program 6 times [2023-12-02 17:36:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932086357] [2023-12-02 17:36:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:53,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:54,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932086357] [2023-12-02 17:36:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932086357] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655821651] [2023-12-02 17:36:54,814 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:36:54,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:54,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:54,815 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:54,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 17:36:55,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:36:55,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:36:55,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 17:36:55,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:55,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:36:55,133 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 0 case distinctions, treesize of input 66 treesize of output 50 [2023-12-02 17:36:55,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2023-12-02 17:36:55,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2023-12-02 17:36:55,430 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 0 case distinctions, treesize of input 123 treesize of output 95 [2023-12-02 17:36:55,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:55,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2023-12-02 17:36:55,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 28 [2023-12-02 17:36:56,088 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 0 case distinctions, treesize of input 237 treesize of output 185 [2023-12-02 17:36:56,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:56,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 175 [2023-12-02 17:36:56,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 163 [2023-12-02 17:37:02,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:02,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 455 treesize of output 207 [2023-12-02 17:37:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:02,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 12 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:04,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655821651] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [668949153] [2023-12-02 17:37:04,336 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 17:37:04,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:37:04,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 34 [2023-12-02 17:37:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692045099] [2023-12-02 17:37:04,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:04,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 17:37:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 17:37:04,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 17:37:04,338 INFO L87 Difference]: Start difference. First operand 1208 states and 2709 transitions. Second operand has 34 states, 34 states have (on average 4.882352941176471) internal successors, (166), 34 states have internal predecessors, (166), 0 states have call successors, (0), 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 17:37:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:12,066 INFO L93 Difference]: Finished difference Result 4021 states and 8881 transitions. [2023-12-02 17:37:12,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-12-02 17:37:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.882352941176471) internal successors, (166), 34 states have internal predecessors, (166), 0 states have call successors, (0), 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 56 [2023-12-02 17:37:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:12,069 INFO L225 Difference]: With dead ends: 4021 [2023-12-02 17:37:12,069 INFO L226 Difference]: Without dead ends: 2430 [2023-12-02 17:37:12,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1653, Invalid=4827, Unknown=0, NotChecked=0, Total=6480 [2023-12-02 17:37:12,071 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 730 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:12,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 539 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 17:37:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2023-12-02 17:37:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1504. [2023-12-02 17:37:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1502 states have (on average 2.2303595206391478) internal successors, (3350), 1503 states have internal predecessors, (3350), 0 states have call successors, (0), 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 17:37:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 3350 transitions. [2023-12-02 17:37:12,104 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 3350 transitions. Word has length 56 [2023-12-02 17:37:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:12,104 INFO L495 AbstractCegarLoop]: Abstraction has 1504 states and 3350 transitions. [2023-12-02 17:37:12,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.882352941176471) internal successors, (166), 34 states have internal predecessors, (166), 0 states have call successors, (0), 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 17:37:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 3350 transitions. [2023-12-02 17:37:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-02 17:37:12,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:12,108 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:12,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 17:37:12,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 17:37:12,309 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:37:12,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:12,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1509222216, now seen corresponding path program 7 times [2023-12-02 17:37:12,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:37:12,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874675594] [2023-12-02 17:37:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:37:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:13,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:37:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874675594] [2023-12-02 17:37:13,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874675594] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:37:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698278762] [2023-12-02 17:37:13,646 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:37:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:13,647 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:37:13,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 17:37:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:13,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 17:37:13,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:13,856 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 17:37:13,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 17:37:13,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:37:13,979 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 23 treesize of output 16 [2023-12-02 17:37:14,062 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 0 case distinctions, treesize of input 66 treesize of output 50 [2023-12-02 17:37:14,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2023-12-02 17:37:14,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-02 17:37:14,404 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 0 case distinctions, treesize of input 123 treesize of output 95 [2023-12-02 17:37:14,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:14,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2023-12-02 17:37:14,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:14,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 65 [2023-12-02 17:37:15,155 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 0 case distinctions, treesize of input 237 treesize of output 185 [2023-12-02 17:37:15,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:15,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 175 [2023-12-02 17:37:15,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 124 [2023-12-02 17:37:21,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:21,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 455 treesize of output 207 [2023-12-02 17:37:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:21,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:23,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:23,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 17:37:23,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-12-02 17:37:23,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-12-02 17:37:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:23,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698278762] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:23,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [328980935] [2023-12-02 17:37:23,758 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 17:37:23,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:37:23,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 37 [2023-12-02 17:37:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917140506] [2023-12-02 17:37:23,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:23,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 17:37:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 17:37:23,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1112, Unknown=1, NotChecked=0, Total=1406 [2023-12-02 17:37:23,760 INFO L87 Difference]: Start difference. First operand 1504 states and 3350 transitions. Second operand has 38 states, 38 states have (on average 4.368421052631579) internal successors, (166), 37 states have internal predecessors, (166), 0 states have call successors, (0), 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 17:37:30,263 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 17:37:32,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:37:34,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:37:40,465 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 17:37:42,652 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 17:37:45,299 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 17:37:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:48,039 INFO L93 Difference]: Finished difference Result 4899 states and 10788 transitions. [2023-12-02 17:37:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-12-02 17:37:48,040 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.368421052631579) internal successors, (166), 37 states have internal predecessors, (166), 0 states have call successors, (0), 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 56 [2023-12-02 17:37:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:48,045 INFO L225 Difference]: With dead ends: 4899 [2023-12-02 17:37:48,045 INFO L226 Difference]: Without dead ends: 3355 [2023-12-02 17:37:48,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3555 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2871, Invalid=10010, Unknown=1, NotChecked=0, Total=12882 [2023-12-02 17:37:48,050 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1270 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 144 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:48,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 536 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2428 Invalid, 54 Unknown, 0 Unchecked, 15.6s Time] [2023-12-02 17:37:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2023-12-02 17:37:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 1658. [2023-12-02 17:37:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1656 states have (on average 2.2276570048309177) internal successors, (3689), 1657 states have internal predecessors, (3689), 0 states have call successors, (0), 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 17:37:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 3689 transitions. [2023-12-02 17:37:48,096 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 3689 transitions. Word has length 56 [2023-12-02 17:37:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:48,096 INFO L495 AbstractCegarLoop]: Abstraction has 1658 states and 3689 transitions. [2023-12-02 17:37:48,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.368421052631579) internal successors, (166), 37 states have internal predecessors, (166), 0 states have call successors, (0), 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 17:37:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 3689 transitions. [2023-12-02 17:37:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-02 17:37:48,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:48,101 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:48,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 17:37:48,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 17:37:48,301 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:37:48,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:48,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2056380984, now seen corresponding path program 8 times [2023-12-02 17:37:48,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:37:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635691449] [2023-12-02 17:37:48,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:48,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:37:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:49,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:37:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635691449] [2023-12-02 17:37:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635691449] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:37:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315026834] [2023-12-02 17:37:49,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:37:49,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:49,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:49,502 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:37:49,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 17:37:49,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-02 17:37:49,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:37:49,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 17:37:49,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:49,828 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 17:37:49,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 17:37:49,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-02 17:37:50,240 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 0 case distinctions, treesize of input 128 treesize of output 112 [2023-12-02 17:37:50,254 INFO L349 Elim1Store]: treesize reduction 32, result has 23.8 percent of original size [2023-12-02 17:37:50,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 95 [2023-12-02 17:37:50,900 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 0 case distinctions, treesize of input 134 treesize of output 108 [2023-12-02 17:37:50,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:37:50,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:37:50,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 108 treesize of output 56 [2023-12-02 17:37:50,965 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 0 case distinctions, treesize of input 134 treesize of output 108 [2023-12-02 17:37:50,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:37:50,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:37:50,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 108 treesize of output 56 [2023-12-02 17:37:52,058 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 316 treesize of output 273 [2023-12-02 17:37:53,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:53,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 314 treesize of output 166 [2023-12-02 17:37:58,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:58,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 374 treesize of output 143 [2023-12-02 17:37:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:58,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:38:00,253 WARN L854 $PredicateComparison]: unable to prove that (or (< 2147483646 c_~top~0) (let ((.cse8 (* c_~top~0 4))) (let ((.cse2 (+ |c_~#arr~0.offset| (- 4) .cse8)) (.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (+ |c_~#arr~0.offset| .cse8 (- 8))) (.cse4 (+ |c_~#arr~0.offset| .cse8))) (and (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080) |c_~#arr~0.base|)) (.cse0 (select v_ArrVal_1079 .cse4))) (or (< 2147483647 .cse0) (= 4294967294 (mod (select .cse1 .cse2) 4294967296)) (not (= v_ArrVal_1079 (store .cse3 .cse4 .cse0))) (not (= 4294967294 (mod (select .cse1 .cse5) 4294967296))) (< .cse0 0)))) (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080) |c_~#arr~0.base|)) (.cse7 (select v_ArrVal_1079 .cse4))) (or (= 4294967294 (mod (select .cse6 .cse2) 4294967296)) (< 0 (+ .cse7 1)) (not (= v_ArrVal_1079 (store .cse3 .cse4 .cse7))) (not (= 4294967294 (mod (select .cse6 .cse5) 4294967296))) (< (+ .cse7 2147483648) 0))))))) (= 5 c_~top~0) (= c_~top~0 4) (< c_~top~0 2)) is different from false [2023-12-02 17:38:00,562 WARN L854 $PredicateComparison]: unable to prove that (or (< 2147483646 c_~top~0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (let ((.cse8 (* c_~top~0 4))) (let ((.cse2 (+ |c_~#arr~0.offset| (- 4) .cse8)) (.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (+ |c_~#arr~0.offset| .cse8 (- 8))) (.cse4 (+ |c_~#arr~0.offset| .cse8))) (and (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080) |c_~#arr~0.base|)) (.cse0 (select v_ArrVal_1079 .cse4))) (or (< 2147483647 .cse0) (= 4294967294 (mod (select .cse1 .cse2) 4294967296)) (not (= v_ArrVal_1079 (store .cse3 .cse4 .cse0))) (not (= 4294967294 (mod (select .cse1 .cse5) 4294967296))) (< .cse0 0)))) (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080) |c_~#arr~0.base|)) (.cse7 (select v_ArrVal_1079 .cse4))) (or (= 4294967294 (mod (select .cse6 .cse2) 4294967296)) (< 0 (+ .cse7 1)) (not (= v_ArrVal_1079 (store .cse3 .cse4 .cse7))) (not (= 4294967294 (mod (select .cse6 .cse5) 4294967296))) (< (+ .cse7 2147483648) 0))))))) (= 5 c_~top~0) (= c_~top~0 4) (< c_~top~0 2)) is different from false [2023-12-02 17:38:00,886 WARN L854 $PredicateComparison]: unable to prove that (or (= 3 c_~top~0) (= 5 c_~top~0) (= c_~top~0 4) (< c_~top~0 1) (let ((.cse16 (* c_~top~0 4))) (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (+ |c_~#arr~0.offset| (- 4) .cse16)) (.cse2 (+ |c_~#arr~0.offset| .cse16)) (.cse6 (+ |c_~#arr~0.offset| .cse16 4))) (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_8) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_7) |c_~#arr~0.base|)) (.cse0 (select v_prenex_8 .cse6)) (.cse5 (select v_prenex_8 .cse2))) (or (< 0 (+ .cse0 1)) (= (mod (select .cse1 .cse2) 4294967296) 4294967294) (not (= (mod (select .cse1 .cse3) 4294967296) 4294967294)) (not (= v_prenex_8 (store (store .cse4 .cse2 .cse5) .cse6 .cse0))) (< (+ .cse0 2147483648) 0) (< 0 (+ .cse5 1)) (< (+ .cse5 2147483648) 0)))) (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080) |c_~#arr~0.base|)) (.cse7 (select v_ArrVal_1079 .cse2)) (.cse8 (select v_ArrVal_1079 .cse6))) (or (not (= (store (store .cse4 .cse2 .cse7) .cse6 .cse8) v_ArrVal_1079)) (< 0 (+ .cse7 1)) (not (= 4294967294 (mod (select .cse9 .cse3) 4294967296))) (= (mod (select .cse9 .cse2) 4294967296) 4294967294) (< 2147483647 .cse8) (< (+ .cse7 2147483648) 0) (< .cse8 0)))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse10 (select v_prenex_6 .cse2)) (.cse12 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_6) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_5) |c_~#arr~0.base|)) (.cse11 (select v_prenex_6 .cse6))) (or (not (= (store (store .cse4 .cse2 .cse10) .cse6 .cse11) v_prenex_6)) (< 2147483647 .cse10) (< .cse10 0) (< 0 (+ .cse11 1)) (= (mod (select .cse12 .cse2) 4294967296) 4294967294) (not (= (mod (select .cse12 .cse3) 4294967296) 4294967294)) (< (+ .cse11 2147483648) 0)))) (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080) |c_~#arr~0.base|)) (.cse14 (select v_ArrVal_1079 .cse6)) (.cse13 (select v_ArrVal_1079 .cse2))) (or (< 2147483647 .cse13) (not (= (store (store .cse4 .cse2 .cse13) .cse6 .cse14) v_ArrVal_1079)) (not (= 4294967294 (mod (select .cse15 .cse3) 4294967296))) (= (mod (select .cse15 .cse2) 4294967296) 4294967294) (< 2147483647 .cse14) (< .cse14 0) (< .cse13 0))))))) (< 2147483645 c_~top~0)) is different from false [2023-12-02 17:38:01,702 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 3 c_~top~0) (= 5 c_~top~0) (= c_~top~0 4) (< c_~top~0 1) (let ((.cse16 (* c_~top~0 4))) (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (+ |c_~#arr~0.offset| (- 4) .cse16)) (.cse2 (+ |c_~#arr~0.offset| .cse16)) (.cse6 (+ |c_~#arr~0.offset| .cse16 4))) (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_8) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_7) |c_~#arr~0.base|)) (.cse0 (select v_prenex_8 .cse6)) (.cse5 (select v_prenex_8 .cse2))) (or (< 0 (+ .cse0 1)) (= (mod (select .cse1 .cse2) 4294967296) 4294967294) (not (= (mod (select .cse1 .cse3) 4294967296) 4294967294)) (not (= v_prenex_8 (store (store .cse4 .cse2 .cse5) .cse6 .cse0))) (< (+ .cse0 2147483648) 0) (< 0 (+ .cse5 1)) (< (+ .cse5 2147483648) 0)))) (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080) |c_~#arr~0.base|)) (.cse7 (select v_ArrVal_1079 .cse2)) (.cse8 (select v_ArrVal_1079 .cse6))) (or (not (= (store (store .cse4 .cse2 .cse7) .cse6 .cse8) v_ArrVal_1079)) (< 0 (+ .cse7 1)) (not (= 4294967294 (mod (select .cse9 .cse3) 4294967296))) (= (mod (select .cse9 .cse2) 4294967296) 4294967294) (< 2147483647 .cse8) (< (+ .cse7 2147483648) 0) (< .cse8 0)))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse10 (select v_prenex_6 .cse2)) (.cse12 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_6) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_5) |c_~#arr~0.base|)) (.cse11 (select v_prenex_6 .cse6))) (or (not (= (store (store .cse4 .cse2 .cse10) .cse6 .cse11) v_prenex_6)) (< 2147483647 .cse10) (< .cse10 0) (< 0 (+ .cse11 1)) (= (mod (select .cse12 .cse2) 4294967296) 4294967294) (not (= (mod (select .cse12 .cse3) 4294967296) 4294967294)) (< (+ .cse11 2147483648) 0)))) (forall ((v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1079 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1080) |c_~#arr~0.base|)) (.cse14 (select v_ArrVal_1079 .cse6)) (.cse13 (select v_ArrVal_1079 .cse2))) (or (< 2147483647 .cse13) (not (= (store (store .cse4 .cse2 .cse13) .cse6 .cse14) v_ArrVal_1079)) (not (= 4294967294 (mod (select .cse15 .cse3) 4294967296))) (= (mod (select .cse15 .cse2) 4294967296) 4294967294) (< 2147483647 .cse14) (< .cse14 0) (< .cse13 0))))))) (< 2147483645 c_~top~0)) is different from false [2023-12-02 17:38:01,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 621 treesize of output 613 [2023-12-02 17:38:01,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:01,833 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 613 treesize of output 600 [2023-12-02 17:38:01,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:01,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 600 treesize of output 919 [2023-12-02 17:38:01,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 452 treesize of output 439 [2023-12-02 17:38:01,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 439 treesize of output 426 [2023-12-02 17:38:02,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 426 treesize of output 413 [2023-12-02 17:38:02,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:38:02,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:38:02,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:38:02,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 333 [2023-12-02 17:38:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2023-12-02 17:38:02,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315026834] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:38:02,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [359022722] [2023-12-02 17:38:02,608 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 17:38:02,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:38:02,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 41 [2023-12-02 17:38:02,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946745954] [2023-12-02 17:38:02,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:38:02,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 17:38:02,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:02,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 17:38:02,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1208, Unknown=5, NotChecked=300, Total=1722 [2023-12-02 17:38:02,612 INFO L87 Difference]: Start difference. First operand 1658 states and 3689 transitions. Second operand has 42 states, 42 states have (on average 3.9523809523809526) internal successors, (166), 41 states have internal predecessors, (166), 0 states have call successors, (0), 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 17:38:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:17,673 INFO L93 Difference]: Finished difference Result 2304 states and 5047 transitions. [2023-12-02 17:38:17,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-02 17:38:17,673 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.9523809523809526) internal successors, (166), 41 states have internal predecessors, (166), 0 states have call successors, (0), 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 56 [2023-12-02 17:38:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:17,674 INFO L225 Difference]: With dead ends: 2304 [2023-12-02 17:38:17,674 INFO L226 Difference]: Without dead ends: 1170 [2023-12-02 17:38:17,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 81 SyntacticMatches, 26 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2315 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1243, Invalid=6424, Unknown=5, NotChecked=700, Total=8372 [2023-12-02 17:38:17,677 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 1801 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 4246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1678 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:17,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 524 Invalid, 4246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 2390 Invalid, 0 Unknown, 1678 Unchecked, 3.8s Time] [2023-12-02 17:38:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2023-12-02 17:38:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 622. [2023-12-02 17:38:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 2.1674718196457325) internal successors, (1346), 621 states have internal predecessors, (1346), 0 states have call successors, (0), 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 17:38:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1346 transitions. [2023-12-02 17:38:17,687 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1346 transitions. Word has length 56 [2023-12-02 17:38:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:17,687 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 1346 transitions. [2023-12-02 17:38:17,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.9523809523809526) internal successors, (166), 41 states have internal predecessors, (166), 0 states have call successors, (0), 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 17:38:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1346 transitions. [2023-12-02 17:38:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 17:38:17,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:17,689 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:38:17,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 17:38:17,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 17:38:17,889 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:38:17,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash -348719554, now seen corresponding path program 9 times [2023-12-02 17:38:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911102043] [2023-12-02 17:38:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 54 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:19,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:19,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911102043] [2023-12-02 17:38:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911102043] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:19,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316366173] [2023-12-02 17:38:19,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:38:19,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:19,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:19,557 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:19,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 17:38:19,857 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:38:19,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:38:19,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 17:38:19,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:19,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:38:19,980 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 0 case distinctions, treesize of input 66 treesize of output 50 [2023-12-02 17:38:19,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2023-12-02 17:38:20,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-02 17:38:20,266 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 0 case distinctions, treesize of input 123 treesize of output 95 [2023-12-02 17:38:20,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:20,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2023-12-02 17:38:20,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2023-12-02 17:38:20,941 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 0 case distinctions, treesize of input 237 treesize of output 185 [2023-12-02 17:38:20,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:20,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 175 [2023-12-02 17:38:21,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 149 [2023-12-02 17:38:22,754 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 0 case distinctions, treesize of input 465 treesize of output 365 [2023-12-02 17:38:22,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:22,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 289 [2023-12-02 17:38:22,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 391 treesize of output 345 [2023-12-02 17:38:43,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:43,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 911 treesize of output 407 [2023-12-02 17:38:43,906 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:43,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:38:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 16 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:46,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316366173] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:38:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1547028707] [2023-12-02 17:38:46,136 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 17:38:46,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:38:46,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2023-12-02 17:38:46,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352863854] [2023-12-02 17:38:46,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:38:46,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 17:38:46,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:46,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 17:38:46,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1327, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 17:38:46,138 INFO L87 Difference]: Start difference. First operand 622 states and 1346 transitions. Second operand has 42 states, 42 states have (on average 4.880952380952381) internal successors, (205), 42 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:38:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:52,684 INFO L93 Difference]: Finished difference Result 1127 states and 2413 transitions. [2023-12-02 17:38:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-02 17:38:52,684 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.880952380952381) internal successors, (205), 42 states have internal predecessors, (205), 0 states have call successors, (0), 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 69 [2023-12-02 17:38:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:52,685 INFO L225 Difference]: With dead ends: 1127 [2023-12-02 17:38:52,685 INFO L226 Difference]: Without dead ends: 508 [2023-12-02 17:38:52,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1115, Invalid=3307, Unknown=0, NotChecked=0, Total=4422 [2023-12-02 17:38:52,687 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 684 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 2427 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:52,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 504 Invalid, 2503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2427 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-02 17:38:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-12-02 17:38:52,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2023-12-02 17:38:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 2.1104536489151875) internal successors, (1070), 507 states have internal predecessors, (1070), 0 states have call successors, (0), 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 17:38:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1070 transitions. [2023-12-02 17:38:52,694 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1070 transitions. Word has length 69 [2023-12-02 17:38:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:52,694 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 1070 transitions. [2023-12-02 17:38:52,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.880952380952381) internal successors, (205), 42 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:38:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1070 transitions. [2023-12-02 17:38:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 17:38:52,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:52,695 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:38:52,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 17:38:52,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:52,896 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:38:52,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:52,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1842064056, now seen corresponding path program 10 times [2023-12-02 17:38:52,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:52,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769048907] [2023-12-02 17:38:52,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:52,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 54 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:38:54,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:54,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769048907] [2023-12-02 17:38:54,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769048907] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:54,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755244345] [2023-12-02 17:38:54,439 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:38:54,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:54,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:54,440 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:54,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 17:38:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:54,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 17:38:54,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:54,682 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 17:38:54,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 17:38:54,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:38:54,784 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 23 treesize of output 16 [2023-12-02 17:38:54,872 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 0 case distinctions, treesize of input 66 treesize of output 50 [2023-12-02 17:38:54,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2023-12-02 17:38:54,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2023-12-02 17:38:55,170 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 0 case distinctions, treesize of input 123 treesize of output 95 [2023-12-02 17:38:55,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:55,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2023-12-02 17:38:55,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2023-12-02 17:38:55,963 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 0 case distinctions, treesize of input 237 treesize of output 185 [2023-12-02 17:38:55,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:55,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 175 [2023-12-02 17:38:56,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 142 [2023-12-02 17:38:57,973 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 0 case distinctions, treesize of input 465 treesize of output 365 [2023-12-02 17:38:57,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:57,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 289 [2023-12-02 17:38:58,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 391 treesize of output 297 [2023-12-02 17:39:19,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:39:19,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 911 treesize of output 407 [2023-12-02 17:39:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:39:19,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:39:21,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:39:21,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 17:39:21,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-12-02 17:39:21,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2023-12-02 17:39:22,069 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:39:22,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755244345] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:39:22,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1240865328] [2023-12-02 17:39:22,070 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java: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 17:39:22,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:39:22,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 46 [2023-12-02 17:39:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148302957] [2023-12-02 17:39:22,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:39:22,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-02 17:39:22,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:39:22,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-02 17:39:22,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=1681, Unknown=0, NotChecked=0, Total=2162 [2023-12-02 17:39:22,072 INFO L87 Difference]: Start difference. First operand 508 states and 1070 transitions. Second operand has 47 states, 47 states have (on average 4.361702127659575) internal successors, (205), 46 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:39:25,571 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 17:39:27,590 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 17:39:29,730 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 17:39:32,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:34,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:37,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:39,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:41,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:43,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:45,997 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 17:39:49,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:39:51,290 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 17:39:53,344 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 17:39:56,187 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 17:39:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:39:59,498 INFO L93 Difference]: Finished difference Result 1323 states and 2795 transitions. [2023-12-02 17:39:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 17:39:59,498 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.361702127659575) internal successors, (205), 46 states have internal predecessors, (205), 0 states have call successors, (0), 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 69 [2023-12-02 17:39:59,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:39:59,499 INFO L225 Difference]: With dead ends: 1323 [2023-12-02 17:39:59,499 INFO L226 Difference]: Without dead ends: 762 [2023-12-02 17:39:59,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1622, Invalid=4857, Unknown=1, NotChecked=0, Total=6480 [2023-12-02 17:39:59,501 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 819 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 86 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:39:59,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 510 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2443 Invalid, 18 Unknown, 0 Unchecked, 31.1s Time] [2023-12-02 17:39:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-12-02 17:39:59,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 466. [2023-12-02 17:39:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 2.0946236559139786) internal successors, (974), 465 states have internal predecessors, (974), 0 states have call successors, (0), 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 17:39:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 974 transitions. [2023-12-02 17:39:59,511 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 974 transitions. Word has length 69 [2023-12-02 17:39:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:39:59,511 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 974 transitions. [2023-12-02 17:39:59,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.361702127659575) internal successors, (205), 46 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:39:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 974 transitions. [2023-12-02 17:39:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 17:39:59,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:39:59,513 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:39:59,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 17:39:59,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:39:59,714 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:39:59,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:39:59,714 INFO L85 PathProgramCache]: Analyzing trace with hash -349223432, now seen corresponding path program 11 times [2023-12-02 17:39:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:39:59,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192796457] [2023-12-02 17:39:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:39:59,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:39:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:40:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 54 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:40:01,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:40:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192796457] [2023-12-02 17:40:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192796457] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:40:01,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034220765] [2023-12-02 17:40:01,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:40:01,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:40:01,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:40:01,217 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:40:01,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 17:40:01,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 17:40:01,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:40:01,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 17:40:01,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:40:01,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:40:01,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:40:01,661 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2023-12-02 17:40:01,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 59 [2023-12-02 17:40:01,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:40:01,935 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 0 case distinctions, treesize of input 62 treesize of output 46 [2023-12-02 17:40:01,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2023-12-02 17:40:01,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 17:40:02,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:40:02,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2023-12-02 17:40:02,507 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 0 case distinctions, treesize of input 111 treesize of output 83 [2023-12-02 17:40:02,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2023-12-02 17:40:02,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 70 [2023-12-02 17:40:03,220 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 0 case distinctions, treesize of input 209 treesize of output 157 [2023-12-02 17:40:03,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 159 [2023-12-02 17:40:03,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 156 [2023-12-02 17:40:05,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 210 [2023-12-02 17:40:14,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 219 [2023-12-02 17:40:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:40:14,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:40:16,197 WARN L854 $PredicateComparison]: unable to prove that (or (< 2147483644 c_~top~0) (= 3 c_~top~0) (= 5 c_~top~0) (let ((.cse7 (* c_~top~0 4))) (let ((.cse3 (+ |c_~#arr~0.offset| (- 4) .cse7)) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (+ |c_~#arr~0.offset| .cse7))) (and (forall ((v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1444 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1444) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1445) |c_~#arr~0.base|)) (.cse2 (select v_ArrVal_1444 .cse1))) (or (= 4294967294 (mod (select .cse0 .cse1) 4294967296)) (< 2147483647 .cse2) (< .cse2 0) (not (= (mod (select .cse0 .cse3) 4294967296) 4294967294)) (not (= v_ArrVal_1444 (store .cse4 .cse1 .cse2)))))) (forall ((v_ArrVal_1445 (Array Int Int)) (v_ArrVal_1444 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1444) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1445) |c_~#arr~0.base|)) (.cse5 (select v_ArrVal_1444 .cse1))) (or (< (+ .cse5 2147483648) 0) (= 4294967294 (mod (select .cse6 .cse1) 4294967296)) (< 0 (+ .cse5 1)) (not (= (mod (select .cse6 .cse3) 4294967296) 4294967294)) (not (= v_ArrVal_1444 (store .cse4 .cse1 .cse5))))))))) (= 2 c_~top~0) (= c_~top~0 4) (< c_~top~0 1)) is different from false [2023-12-02 17:40:16,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 233 [2023-12-02 17:40:16,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:16,606 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 233 treesize of output 220 [2023-12-02 17:40:16,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:16,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 220 treesize of output 265 [2023-12-02 17:40:16,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 163 [2023-12-02 17:40:16,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-02 17:40:16,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 62 [2023-12-02 17:40:16,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:16,767 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 37 treesize of output 18 [2023-12-02 17:40:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 23 not checked. [2023-12-02 17:40:16,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034220765] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:40:16,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [697249395] [2023-12-02 17:40:16,899 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 17:40:16,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:40:16,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 47 [2023-12-02 17:40:16,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583476056] [2023-12-02 17:40:16,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:40:16,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 17:40:16,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:40:16,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 17:40:16,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1633, Unknown=3, NotChecked=90, Total=2256 [2023-12-02 17:40:16,902 INFO L87 Difference]: Start difference. First operand 466 states and 974 transitions. Second operand has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 47 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:40:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:40:23,619 INFO L93 Difference]: Finished difference Result 1211 states and 2563 transitions. [2023-12-02 17:40:23,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 17:40:23,620 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 47 states have internal predecessors, (205), 0 states have call successors, (0), 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 69 [2023-12-02 17:40:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:40:23,621 INFO L225 Difference]: With dead ends: 1211 [2023-12-02 17:40:23,621 INFO L226 Difference]: Without dead ends: 748 [2023-12-02 17:40:23,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1366, Invalid=4030, Unknown=10, NotChecked=144, Total=5550 [2023-12-02 17:40:23,622 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 628 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 61 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:40:23,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 406 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2082 Invalid, 30 Unknown, 276 Unchecked, 2.5s Time] [2023-12-02 17:40:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2023-12-02 17:40:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 424. [2023-12-02 17:40:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 2.07565011820331) internal successors, (878), 423 states have internal predecessors, (878), 0 states have call successors, (0), 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 17:40:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 878 transitions. [2023-12-02 17:40:23,629 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 878 transitions. Word has length 69 [2023-12-02 17:40:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:40:23,629 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 878 transitions. [2023-12-02 17:40:23,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 47 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:40:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 878 transitions. [2023-12-02 17:40:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 17:40:23,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:40:23,630 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:40:23,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 17:40:23,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:40:23,831 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:40:23,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:40:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1254600392, now seen corresponding path program 12 times [2023-12-02 17:40:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:40:23,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374849729] [2023-12-02 17:40:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:40:23,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:40:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:40:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 54 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:40:25,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:40:25,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374849729] [2023-12-02 17:40:25,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374849729] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:40:25,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618401897] [2023-12-02 17:40:25,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:40:25,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:40:25,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:40:25,178 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:40:25,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 17:40:25,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:40:25,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:40:25,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-02 17:40:25,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:40:25,693 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 17:40:25,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 17:40:25,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:40:25,831 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 0 case distinctions, treesize of input 66 treesize of output 50 [2023-12-02 17:40:25,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2023-12-02 17:40:25,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:25,863 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 1 case distinctions, treesize of input 56 treesize of output 31 [2023-12-02 17:40:26,132 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 0 case distinctions, treesize of input 123 treesize of output 95 [2023-12-02 17:40:26,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:26,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2023-12-02 17:40:26,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 80 [2023-12-02 17:40:26,737 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 194 treesize of output 151 [2023-12-02 17:40:27,295 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 0 case distinctions, treesize of input 237 treesize of output 185 [2023-12-02 17:40:27,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:27,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 175 [2023-12-02 17:40:27,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 29 [2023-12-02 17:40:29,037 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 0 case distinctions, treesize of input 465 treesize of output 365 [2023-12-02 17:40:29,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:29,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 289 [2023-12-02 17:40:29,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:29,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 435 treesize of output 377 [2023-12-02 17:40:50,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:50,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 911 treesize of output 407 [2023-12-02 17:40:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:40:50,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:40:52,561 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_~top~0))) (or (= c_~top~0 0) (= (+ c_~top~0 1) 0) (= .cse0 0) (= 3 c_~top~0) (= 5 c_~top~0) (= c_~top~0 4) (< .cse0 0) (let ((.cse6 (* c_~top~0 4))) (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (+ |c_~#arr~0.offset| .cse6 (- 8))) (.cse3 (+ |c_~#arr~0.offset| .cse6))) (and (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1568 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1568 .cse3))) (or (< 0 (+ .cse1 1)) (not (= (store .cse2 .cse3 .cse1) v_ArrVal_1568)) (< (+ .cse1 2147483648) 0) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1569) |c_~#arr~0.base|) .cse4) 4294967296)))))) (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1568 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1568 .cse3))) (or (< .cse5 0) (not (= (store .cse2 .cse3 .cse5) v_ArrVal_1568)) (< 2147483647 .cse5) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1569) |c_~#arr~0.base|) .cse4) 4294967296))))))))) (= c_~top~0 1) (< 2147483645 c_~top~0))) is different from false [2023-12-02 17:40:52,896 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_~top~0))) (or (= c_~top~0 0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= (+ c_~top~0 1) 0) (= .cse0 0) (= 3 c_~top~0) (= 5 c_~top~0) (= c_~top~0 4) (< .cse0 0) (let ((.cse6 (* c_~top~0 4))) (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (+ |c_~#arr~0.offset| .cse6 (- 8))) (.cse3 (+ |c_~#arr~0.offset| .cse6))) (and (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1568 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1568 .cse3))) (or (< 0 (+ .cse1 1)) (not (= (store .cse2 .cse3 .cse1) v_ArrVal_1568)) (< (+ .cse1 2147483648) 0) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1569) |c_~#arr~0.base|) .cse4) 4294967296)))))) (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1568 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1568 .cse3))) (or (< .cse5 0) (not (= (store .cse2 .cse3 .cse5) v_ArrVal_1568)) (< 2147483647 .cse5) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1569) |c_~#arr~0.base|) .cse4) 4294967296))))))))) (= c_~top~0 1) (< 2147483645 c_~top~0))) is different from false [2023-12-02 17:40:53,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (+ 3 c_~top~0))) (or (= c_~top~0 0) (< 2147483644 c_~top~0) (= (+ c_~top~0 1) 0) (= (+ 2 c_~top~0) 0) (let ((.cse12 (* c_~top~0 4))) (let ((.cse5 (+ |c_~#arr~0.offset| (- 4) .cse12)) (.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (+ |c_~#arr~0.offset| .cse12)) (.cse3 (+ |c_~#arr~0.offset| .cse12 4))) (and (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1568 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1568 .cse2)) (.cse4 (select v_ArrVal_1568 .cse3))) (or (< 0 (+ .cse0 1)) (not (= v_ArrVal_1568 (store (store .cse1 .cse2 .cse0) .cse3 .cse4))) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1569) |c_~#arr~0.base|) .cse5) 4294967296) 4294967294)) (< (+ .cse0 2147483648) 0) (< .cse4 0) (< 2147483647 .cse4)))) (forall ((v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int))) (let ((.cse6 (select v_prenex_18 .cse2)) (.cse7 (select v_prenex_18 .cse3))) (or (< 2147483647 .cse6) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_18) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_17) |c_~#arr~0.base|) .cse5) 4294967296))) (< .cse6 0) (< 0 (+ .cse7 1)) (not (= (store (store .cse1 .cse2 .cse6) .cse3 .cse7) v_prenex_18)) (< (+ .cse7 2147483648) 0)))) (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1568 (Array Int Int))) (let ((.cse8 (select v_ArrVal_1568 .cse2)) (.cse9 (select v_ArrVal_1568 .cse3))) (or (< .cse8 0) (not (= v_ArrVal_1568 (store (store .cse1 .cse2 .cse8) .cse3 .cse9))) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1569) |c_~#arr~0.base|) .cse5) 4294967296) 4294967294)) (< 2147483647 .cse8) (< .cse9 0) (< 2147483647 .cse9)))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int))) (let ((.cse11 (select v_prenex_20 .cse3)) (.cse10 (select v_prenex_20 .cse2))) (or (< 0 (+ .cse10 1)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_20) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_19) |c_~#arr~0.base|) .cse5) 4294967296))) (< (+ .cse11 2147483648) 0) (not (= v_prenex_20 (store (store .cse1 .cse2 .cse10) .cse3 .cse11))) (< 0 (+ .cse11 1)) (< (+ .cse10 2147483648) 0))))))) (= 3 c_~top~0) (= 5 c_~top~0) (< .cse13 0) (= 0 .cse13) (= 2 c_~top~0) (= c_~top~0 4))) is different from false [2023-12-02 17:40:54,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 489 treesize of output 481 [2023-12-02 17:40:54,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 481 treesize of output 475 [2023-12-02 17:40:54,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:54,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 475 treesize of output 794 [2023-12-02 17:40:54,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 321 [2023-12-02 17:40:54,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 315 [2023-12-02 17:40:54,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 309 [2023-12-02 17:40:54,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:40:54,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:40:54,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:40:54,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:40:54,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:40:54,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:40:54,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 39 [2023-12-02 17:40:54,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2023-12-02 17:40:54,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-12-02 17:40:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 40 not checked. [2023-12-02 17:40:55,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618401897] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:40:55,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [737658991] [2023-12-02 17:40:55,208 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 17:40:55,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:40:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 45 [2023-12-02 17:40:55,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415812811] [2023-12-02 17:40:55,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:40:55,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-02 17:40:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:40:55,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-02 17:40:55,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1433, Unknown=3, NotChecked=252, Total=2070 [2023-12-02 17:40:55,210 INFO L87 Difference]: Start difference. First operand 424 states and 878 transitions. Second operand has 46 states, 46 states have (on average 4.456521739130435) internal successors, (205), 45 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:41:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:02,407 INFO L93 Difference]: Finished difference Result 884 states and 1859 transitions. [2023-12-02 17:41:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 17:41:02,407 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.456521739130435) internal successors, (205), 45 states have internal predecessors, (205), 0 states have call successors, (0), 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 69 [2023-12-02 17:41:02,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:02,408 INFO L225 Difference]: With dead ends: 884 [2023-12-02 17:41:02,408 INFO L226 Difference]: Without dead ends: 463 [2023-12-02 17:41:02,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=883, Invalid=3284, Unknown=5, NotChecked=384, Total=4556 [2023-12-02 17:41:02,409 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 536 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 38 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 612 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:02,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 400 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2085 Invalid, 5 Unknown, 612 Unchecked, 2.1s Time] [2023-12-02 17:41:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-12-02 17:41:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 382. [2023-12-02 17:41:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 2.05249343832021) internal successors, (782), 381 states have internal predecessors, (782), 0 states have call successors, (0), 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 17:41:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 782 transitions. [2023-12-02 17:41:02,415 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 782 transitions. Word has length 69 [2023-12-02 17:41:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:02,415 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 782 transitions. [2023-12-02 17:41:02,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.456521739130435) internal successors, (205), 45 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:41:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 782 transitions. [2023-12-02 17:41:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 17:41:02,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:02,416 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:02,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 17:41:02,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:02,617 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:41:02,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -793064328, now seen corresponding path program 13 times [2023-12-02 17:41:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:41:02,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597266776] [2023-12-02 17:41:02,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:41:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 54 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:03,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:41:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597266776] [2023-12-02 17:41:03,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597266776] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:41:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515365385] [2023-12-02 17:41:03,994 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:41:03,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:03,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:41:04,006 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:41:04,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 17:41:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:04,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-02 17:41:04,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:04,267 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 17:41:04,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 17:41:04,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:41:04,450 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 0 case distinctions, treesize of input 62 treesize of output 46 [2023-12-02 17:41:04,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 64 [2023-12-02 17:41:04,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2023-12-02 17:41:04,800 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 0 case distinctions, treesize of input 111 treesize of output 83 [2023-12-02 17:41:04,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2023-12-02 17:41:04,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 74 [2023-12-02 17:41:05,588 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 0 case distinctions, treesize of input 209 treesize of output 157 [2023-12-02 17:41:05,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 159 [2023-12-02 17:41:05,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 128 [2023-12-02 17:41:07,119 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 366 treesize of output 275 [2023-12-02 17:41:08,841 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 0 case distinctions, treesize of input 405 treesize of output 305 [2023-12-02 17:41:08,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 269 [2023-12-02 17:41:09,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 234 [2023-12-02 17:41:30,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 791 treesize of output 407 [2023-12-02 17:41:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:30,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:41:31,711 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~top~0 1))) (or (= c_~top~0 0) (< 2147483646 c_~top~0) (= .cse0 0) (= 5 c_~top~0) (= 2 c_~top~0) (= c_~top~0 4) (= c_~top~0 1) (< .cse0 0) (let ((.cse6 (* c_~top~0 4))) (let ((.cse2 (+ |c_~#arr~0.offset| .cse6 (- 12))) (.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (+ |c_~#arr~0.offset| .cse6))) (and (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1693 .cse4))) (or (< 0 (+ .cse1 1)) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294)) (not (= v_ArrVal_1693 (store .cse3 .cse4 .cse1))) (< (+ .cse1 2147483648) 0)))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1693 .cse4))) (or (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294)) (< .cse5 0) (not (= v_ArrVal_1693 (store .cse3 .cse4 .cse5))) (< 2147483647 .cse5))))))))) is different from false [2023-12-02 17:41:31,999 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~top~0 1))) (or (= c_~top~0 0) (< 2147483646 c_~top~0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= .cse0 0) (= 5 c_~top~0) (= 2 c_~top~0) (= c_~top~0 4) (= c_~top~0 1) (< .cse0 0) (let ((.cse6 (* c_~top~0 4))) (let ((.cse2 (+ |c_~#arr~0.offset| .cse6 (- 12))) (.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (+ |c_~#arr~0.offset| .cse6))) (and (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1693 .cse4))) (or (< 0 (+ .cse1 1)) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294)) (not (= v_ArrVal_1693 (store .cse3 .cse4 .cse1))) (< (+ .cse1 2147483648) 0)))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse5 (select v_ArrVal_1693 .cse4))) (or (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294)) (< .cse5 0) (not (= v_ArrVal_1693 (store .cse3 .cse4 .cse5))) (< 2147483647 .cse5))))))))) is different from false [2023-12-02 17:41:32,250 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_~top~0))) (or (= c_~top~0 0) (= (+ c_~top~0 1) 0) (= .cse0 0) (= 3 c_~top~0) (= 5 c_~top~0) (let ((.cse13 (* c_~top~0 4))) (let ((.cse3 (+ |c_~#arr~0.offset| .cse13 (- 8))) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (+ |c_~#arr~0.offset| .cse13 4)) (.cse5 (+ |c_~#arr~0.offset| .cse13))) (and (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1693 .cse5)) (.cse2 (select v_ArrVal_1693 .cse6))) (or (< 0 (+ .cse1 1)) (< (+ .cse2 2147483648) 0) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse3) 4294967296) 4294967294)) (< (+ .cse1 2147483648) 0) (< 0 (+ .cse2 1)) (not (= (store (store .cse4 .cse5 .cse1) .cse6 .cse2) v_ArrVal_1693))))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse7 (select v_ArrVal_1693 .cse5)) (.cse8 (select v_ArrVal_1693 .cse6))) (or (< .cse7 0) (< (+ .cse8 2147483648) 0) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse3) 4294967296) 4294967294)) (< 0 (+ .cse8 1)) (< 2147483647 .cse7) (not (= (store (store .cse4 .cse5 .cse7) .cse6 .cse8) v_ArrVal_1693))))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse9 (select v_ArrVal_1693 .cse5)) (.cse10 (select v_ArrVal_1693 .cse6))) (or (< .cse9 0) (< 2147483647 .cse10) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse3) 4294967296) 4294967294)) (< 2147483647 .cse9) (< .cse10 0) (not (= (store (store .cse4 .cse5 .cse9) .cse6 .cse10) v_ArrVal_1693))))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse11 (select v_ArrVal_1693 .cse5)) (.cse12 (select v_ArrVal_1693 .cse6))) (or (< 0 (+ .cse11 1)) (< 2147483647 .cse12) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse3) 4294967296) 4294967294)) (< (+ .cse11 2147483648) 0) (< .cse12 0) (not (= (store (store .cse4 .cse5 .cse11) .cse6 .cse12) v_ArrVal_1693)))))))) (= c_~top~0 4) (< .cse0 0) (= c_~top~0 1) (< 2147483645 c_~top~0))) is different from false [2023-12-02 17:41:33,017 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_~top~0))) (or (= c_~top~0 0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= (+ c_~top~0 1) 0) (= .cse0 0) (= 3 c_~top~0) (= 5 c_~top~0) (let ((.cse13 (* c_~top~0 4))) (let ((.cse3 (+ |c_~#arr~0.offset| .cse13 (- 8))) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (+ |c_~#arr~0.offset| .cse13 4)) (.cse5 (+ |c_~#arr~0.offset| .cse13))) (and (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1693 .cse5)) (.cse2 (select v_ArrVal_1693 .cse6))) (or (< 0 (+ .cse1 1)) (< (+ .cse2 2147483648) 0) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse3) 4294967296) 4294967294)) (< (+ .cse1 2147483648) 0) (< 0 (+ .cse2 1)) (not (= (store (store .cse4 .cse5 .cse1) .cse6 .cse2) v_ArrVal_1693))))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse7 (select v_ArrVal_1693 .cse5)) (.cse8 (select v_ArrVal_1693 .cse6))) (or (< .cse7 0) (< (+ .cse8 2147483648) 0) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse3) 4294967296) 4294967294)) (< 0 (+ .cse8 1)) (< 2147483647 .cse7) (not (= (store (store .cse4 .cse5 .cse7) .cse6 .cse8) v_ArrVal_1693))))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse9 (select v_ArrVal_1693 .cse5)) (.cse10 (select v_ArrVal_1693 .cse6))) (or (< .cse9 0) (< 2147483647 .cse10) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse3) 4294967296) 4294967294)) (< 2147483647 .cse9) (< .cse10 0) (not (= (store (store .cse4 .cse5 .cse9) .cse6 .cse10) v_ArrVal_1693))))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse11 (select v_ArrVal_1693 .cse5)) (.cse12 (select v_ArrVal_1693 .cse6))) (or (< 0 (+ .cse11 1)) (< 2147483647 .cse12) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse3) 4294967296) 4294967294)) (< (+ .cse11 2147483648) 0) (< .cse12 0) (not (= (store (store .cse4 .cse5 .cse11) .cse6 .cse12) v_ArrVal_1693)))))))) (= c_~top~0 4) (< .cse0 0) (= c_~top~0 1) (< 2147483645 c_~top~0))) is different from false [2023-12-02 17:41:33,695 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 c_~top~0))) (or (= c_~top~0 0) (< 2147483644 c_~top~0) (= (+ c_~top~0 1) 0) (= (+ 2 c_~top~0) 0) (= 3 c_~top~0) (= 5 c_~top~0) (< .cse0 0) (= 0 .cse0) (= 2 c_~top~0) (= c_~top~0 4) (let ((.cse30 (* c_~top~0 4))) (let ((.cse5 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (+ |c_~#arr~0.offset| (- 4) .cse30)) (.cse6 (+ |c_~#arr~0.offset| .cse30)) (.cse7 (+ |c_~#arr~0.offset| .cse30 4)) (.cse8 (+ |c_~#arr~0.offset| .cse30 8))) (and (forall ((v_prenex_43 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse3 (select v_prenex_44 .cse7)) (.cse4 (select v_prenex_44 .cse6)) (.cse1 (select v_prenex_44 .cse8))) (or (< 2147483647 .cse1) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_44) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_43) |c_~#arr~0.base|) .cse2) 4294967296))) (< 2147483647 .cse3) (< .cse3 0) (< (+ .cse4 2147483648) 0) (not (= v_prenex_44 (store (store (store .cse5 .cse6 .cse4) .cse7 .cse3) .cse8 .cse1))) (< 0 (+ .cse4 1)) (< .cse1 0)))) (forall ((v_prenex_46 (Array Int Int)) (v_prenex_45 (Array Int Int))) (let ((.cse10 (select v_prenex_46 .cse7)) (.cse11 (select v_prenex_46 .cse6)) (.cse9 (select v_prenex_46 .cse8))) (or (< .cse9 0) (< (+ .cse10 2147483648) 0) (not (= (store (store (store .cse5 .cse6 .cse11) .cse7 .cse10) .cse8 .cse9) v_prenex_46)) (< 0 (+ .cse10 1)) (< .cse11 0) (< 2147483647 .cse11) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_46) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_45) |c_~#arr~0.base|) .cse2) 4294967296))) (< 2147483647 .cse9)))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse12 (select v_ArrVal_1693 .cse6)) (.cse13 (select v_ArrVal_1693 .cse7)) (.cse14 (select v_ArrVal_1693 .cse8))) (or (< 0 (+ .cse12 1)) (< 2147483647 .cse13) (not (= (store (store (store .cse5 .cse6 .cse12) .cse7 .cse13) .cse8 .cse14) v_ArrVal_1693)) (< 0 (+ .cse14 1)) (< (+ .cse12 2147483648) 0) (< .cse13 0) (< (+ .cse14 2147483648) 0) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294))))) (forall ((v_prenex_47 (Array Int Int)) (v_prenex_48 (Array Int Int))) (let ((.cse15 (select v_prenex_48 .cse7)) (.cse17 (select v_prenex_48 .cse8)) (.cse16 (select v_prenex_48 .cse6))) (or (< (+ .cse15 2147483648) 0) (not (= v_prenex_48 (store (store (store .cse5 .cse6 .cse16) .cse7 .cse15) .cse8 .cse17))) (< 0 (+ .cse15 1)) (< (+ .cse17 2147483648) 0) (< 0 (+ .cse17 1)) (< .cse16 0) (< 2147483647 .cse16) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_48) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_47) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294))))) (forall ((v_prenex_40 (Array Int Int)) (v_prenex_39 (Array Int Int))) (let ((.cse20 (select v_prenex_40 .cse6)) (.cse19 (select v_prenex_40 .cse7)) (.cse18 (select v_prenex_40 .cse8))) (or (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_40) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_39) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294)) (< .cse18 0) (< 0 (+ .cse19 1)) (< 0 (+ .cse20 1)) (< (+ .cse19 2147483648) 0) (< (+ .cse20 2147483648) 0) (< 2147483647 .cse18) (not (= (store (store (store .cse5 .cse6 .cse20) .cse7 .cse19) .cse8 .cse18) v_prenex_40))))) (forall ((v_prenex_42 (Array Int Int)) (v_prenex_41 (Array Int Int))) (let ((.cse21 (select v_prenex_42 .cse6)) (.cse22 (select v_prenex_42 .cse8)) (.cse23 (select v_prenex_42 .cse7))) (or (< (+ .cse21 2147483648) 0) (< (+ .cse22 2147483648) 0) (< 0 (+ .cse21 1)) (not (= 4294967294 (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_42) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_41) |c_~#arr~0.base|) .cse2) 4294967296))) (< (+ .cse23 2147483648) 0) (< 0 (+ .cse22 1)) (not (= v_prenex_42 (store (store (store .cse5 .cse6 .cse21) .cse7 .cse23) .cse8 .cse22))) (< 0 (+ .cse23 1))))) (forall ((v_ArrVal_1694 (Array Int Int)) (v_ArrVal_1693 (Array Int Int))) (let ((.cse24 (select v_ArrVal_1693 .cse6)) (.cse25 (select v_ArrVal_1693 .cse7)) (.cse26 (select v_ArrVal_1693 .cse8))) (or (< .cse24 0) (< 2147483647 .cse25) (not (= (store (store (store .cse5 .cse6 .cse24) .cse7 .cse25) .cse8 .cse26) v_ArrVal_1693)) (< 0 (+ .cse26 1)) (< 2147483647 .cse24) (< .cse25 0) (< (+ .cse26 2147483648) 0) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1694) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294))))) (forall ((v_prenex_50 (Array Int Int)) (v_prenex_49 (Array Int Int))) (let ((.cse29 (select v_prenex_50 .cse8)) (.cse28 (select v_prenex_50 .cse7)) (.cse27 (select v_prenex_50 .cse6))) (or (not (= v_prenex_50 (store (store (store .cse5 .cse6 .cse27) .cse7 .cse28) .cse8 .cse29))) (not (= (mod (select (select (store (store |c_#memory_int| |c_~#arr~0.base| v_prenex_50) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_49) |c_~#arr~0.base|) .cse2) 4294967296) 4294967294)) (< 2147483647 .cse28) (< 2147483647 .cse27) (< 2147483647 .cse29) (< .cse29 0) (< .cse28 0) (< .cse27 0))))))))) is different from false [2023-12-02 17:41:36,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1289 treesize of output 1273 [2023-12-02 17:41:36,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1273 treesize of output 1267 [2023-12-02 17:41:36,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1267 treesize of output 1261 [2023-12-02 17:41:36,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1261 treesize of output 1255 [2023-12-02 17:41:36,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:36,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 32 case distinctions, treesize of input 1255 treesize of output 3088 [2023-12-02 17:41:37,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 823 treesize of output 817 [2023-12-02 17:41:37,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 817 treesize of output 811 [2023-12-02 17:41:37,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 811 treesize of output 805 [2023-12-02 17:41:37,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 805 treesize of output 799 [2023-12-02 17:41:37,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 799 treesize of output 793 [2023-12-02 17:41:39,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 17:41:39,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 17:41:39,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 17:41:39,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 17:41:39,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 17:41:39,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 17:41:40,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 17:41:42,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 17:41:42,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2023-12-02 17:41:42,422 INFO L349 Elim1Store]: treesize reduction 256, result has 0.4 percent of original size [2023-12-02 17:41:42,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 32 case distinctions, treesize of input 631 treesize of output 894 [2023-12-02 17:41:42,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:42,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 40 [2023-12-02 17:41:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2023-12-02 17:41:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515365385] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:41:42,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2038445222] [2023-12-02 17:41:42,629 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 17:41:42,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:41:42,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 45 [2023-12-02 17:41:42,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734694625] [2023-12-02 17:41:42,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:41:42,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-02 17:41:42,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:41:42,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-02 17:41:42,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1278, Unknown=6, NotChecked=410, Total=2070 [2023-12-02 17:41:42,632 INFO L87 Difference]: Start difference. First operand 382 states and 782 transitions. Second operand has 46 states, 46 states have (on average 4.456521739130435) internal successors, (205), 45 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:41:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:41:48,014 INFO L93 Difference]: Finished difference Result 719 states and 1497 transitions. [2023-12-02 17:41:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 17:41:48,014 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.456521739130435) internal successors, (205), 45 states have internal predecessors, (205), 0 states have call successors, (0), 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 69 [2023-12-02 17:41:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:41:48,015 INFO L225 Difference]: With dead ends: 719 [2023-12-02 17:41:48,015 INFO L226 Difference]: Without dead ends: 340 [2023-12-02 17:41:48,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=713, Invalid=2723, Unknown=6, NotChecked=590, Total=4032 [2023-12-02 17:41:48,016 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 509 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 774 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:41:48,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 264 Invalid, 2052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1251 Invalid, 0 Unknown, 774 Unchecked, 1.2s Time] [2023-12-02 17:41:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-12-02 17:41:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2023-12-02 17:41:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 2.023598820058997) internal successors, (686), 339 states have internal predecessors, (686), 0 states have call successors, (0), 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 17:41:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 686 transitions. [2023-12-02 17:41:48,022 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 686 transitions. Word has length 69 [2023-12-02 17:41:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:41:48,022 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 686 transitions. [2023-12-02 17:41:48,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.456521739130435) internal successors, (205), 45 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:41:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 686 transitions. [2023-12-02 17:41:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 17:41:48,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:41:48,023 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:41:48,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 17:41:48,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:48,224 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 17:41:48,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:41:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash -738508290, now seen corresponding path program 14 times [2023-12-02 17:41:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:41:48,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974421267] [2023-12-02 17:41:48,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:41:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:41:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:41:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 58 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:41:49,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:41:49,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974421267] [2023-12-02 17:41:49,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974421267] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:41:49,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376363910] [2023-12-02 17:41:49,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:41:49,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:41:49,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:41:49,666 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:41:49,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 17:41:50,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 17:41:50,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:41:50,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-02 17:41:50,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:41:50,136 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-12-02 17:41:50,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-12-02 17:41:50,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:41:50,317 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 0 case distinctions, treesize of input 66 treesize of output 50 [2023-12-02 17:41:50,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2023-12-02 17:41:50,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 25 [2023-12-02 17:41:50,662 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 0 case distinctions, treesize of input 123 treesize of output 95 [2023-12-02 17:41:50,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:50,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 111 [2023-12-02 17:41:50,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:41:50,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2023-12-02 17:41:51,411 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 0 case distinctions, treesize of input 237 treesize of output 185 [2023-12-02 17:41:51,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:51,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 175 [2023-12-02 17:41:51,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:51,643 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 1 case distinctions, treesize of input 215 treesize of output 164 [2023-12-02 17:41:53,384 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 0 case distinctions, treesize of input 465 treesize of output 365 [2023-12-02 17:41:53,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:41:53,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 289 [2023-12-02 17:41:53,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 36 [2023-12-02 17:41:55,752 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 878 treesize of output 691 [2023-12-02 17:42:18,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:18,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 923 treesize of output 413 [2023-12-02 17:42:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:42:18,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:42:19,581 WARN L854 $PredicateComparison]: unable to prove that (or (= 5 c_~top~0) (< c_~top~0 4) (let ((.cse8 (* c_~top~0 4))) (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (+ |c_~#arr~0.offset| .cse8 (- 12))) (.cse5 (+ (- 16) |c_~#arr~0.offset| .cse8)) (.cse2 (+ |c_~#arr~0.offset| .cse8))) (and (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1817 .cse2)) (.cse3 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 0 (+ .cse0 1)) (< (+ .cse0 2147483648) 0) (not (= v_ArrVal_1817 (store .cse1 .cse2 .cse0))) (= (mod (select .cse3 .cse4) 4294967296) 4294967294) (not (= (mod (select .cse3 .cse5) 4294967296) 4294967294))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse6 (select v_ArrVal_1817 .cse2)) (.cse7 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 2147483647 .cse6) (< .cse6 0) (not (= v_ArrVal_1817 (store .cse1 .cse2 .cse6))) (= (mod (select .cse7 .cse4) 4294967296) 4294967294) (not (= (mod (select .cse7 .cse5) 4294967296) 4294967294)))))))) (< 2147483647 c_~top~0)) is different from false [2023-12-02 17:42:19,823 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 5 c_~top~0) (< c_~top~0 4) (let ((.cse8 (* c_~top~0 4))) (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (+ |c_~#arr~0.offset| .cse8 (- 12))) (.cse5 (+ (- 16) |c_~#arr~0.offset| .cse8)) (.cse2 (+ |c_~#arr~0.offset| .cse8))) (and (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1817 .cse2)) (.cse3 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 0 (+ .cse0 1)) (< (+ .cse0 2147483648) 0) (not (= v_ArrVal_1817 (store .cse1 .cse2 .cse0))) (= (mod (select .cse3 .cse4) 4294967296) 4294967294) (not (= (mod (select .cse3 .cse5) 4294967296) 4294967294))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse6 (select v_ArrVal_1817 .cse2)) (.cse7 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 2147483647 .cse6) (< .cse6 0) (not (= v_ArrVal_1817 (store .cse1 .cse2 .cse6))) (= (mod (select .cse7 .cse4) 4294967296) 4294967294) (not (= (mod (select .cse7 .cse5) 4294967296) 4294967294)))))))) (< 2147483647 c_~top~0)) is different from false [2023-12-02 17:42:20,085 WARN L854 $PredicateComparison]: unable to prove that (or (< 2147483646 c_~top~0) (= 5 c_~top~0) (< c_~top~0 3) (= c_~top~0 4) (let ((.cse17 (* c_~top~0 4))) (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (+ |c_~#arr~0.offset| .cse17 (- 8))) (.cse7 (+ |c_~#arr~0.offset| .cse17 (- 12))) (.cse3 (+ |c_~#arr~0.offset| .cse17 4)) (.cse2 (+ |c_~#arr~0.offset| .cse17))) (and (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1817 .cse2)) (.cse4 (select v_ArrVal_1817 .cse3)) (.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 2147483647 .cse0) (not (= v_ArrVal_1817 (store (store .cse1 .cse2 .cse0) .cse3 .cse4))) (< .cse0 0) (< 2147483647 .cse4) (< .cse4 0) (= (mod (select .cse5 .cse6) 4294967296) 4294967294) (not (= (mod (select .cse5 .cse7) 4294967296) 4294967294))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse9 (select v_ArrVal_1817 .cse2)) (.cse8 (select v_ArrVal_1817 .cse3)) (.cse10 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse8 2147483648) 0) (< 2147483647 .cse9) (not (= v_ArrVal_1817 (store (store .cse1 .cse2 .cse9) .cse3 .cse8))) (< .cse9 0) (< 0 (+ .cse8 1)) (= (mod (select .cse10 .cse6) 4294967296) 4294967294) (not (= (mod (select .cse10 .cse7) 4294967296) 4294967294))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse11 (select v_ArrVal_1817 .cse2)) (.cse12 (select v_ArrVal_1817 .cse3)) (.cse13 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (not (= v_ArrVal_1817 (store (store .cse1 .cse2 .cse11) .cse3 .cse12))) (< 0 (+ .cse11 1)) (< (+ .cse11 2147483648) 0) (< 2147483647 .cse12) (< .cse12 0) (= (mod (select .cse13 .cse6) 4294967296) 4294967294) (not (= (mod (select .cse13 .cse7) 4294967296) 4294967294))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse15 (select v_ArrVal_1817 .cse2)) (.cse14 (select v_ArrVal_1817 .cse3)) (.cse16 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse14 2147483648) 0) (not (= v_ArrVal_1817 (store (store .cse1 .cse2 .cse15) .cse3 .cse14))) (< 0 (+ .cse15 1)) (< (+ .cse15 2147483648) 0) (< 0 (+ .cse14 1)) (= (mod (select .cse16 .cse6) 4294967296) 4294967294) (not (= (mod (select .cse16 .cse7) 4294967296) 4294967294))))))))) is different from false [2023-12-02 17:42:20,954 WARN L854 $PredicateComparison]: unable to prove that (or (< 2147483646 c_~top~0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 5 c_~top~0) (< c_~top~0 3) (= c_~top~0 4) (let ((.cse17 (* c_~top~0 4))) (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (+ |c_~#arr~0.offset| .cse17 (- 8))) (.cse7 (+ |c_~#arr~0.offset| .cse17 (- 12))) (.cse3 (+ |c_~#arr~0.offset| .cse17 4)) (.cse2 (+ |c_~#arr~0.offset| .cse17))) (and (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse0 (select v_ArrVal_1817 .cse2)) (.cse4 (select v_ArrVal_1817 .cse3)) (.cse5 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 2147483647 .cse0) (not (= v_ArrVal_1817 (store (store .cse1 .cse2 .cse0) .cse3 .cse4))) (< .cse0 0) (< 2147483647 .cse4) (< .cse4 0) (= (mod (select .cse5 .cse6) 4294967296) 4294967294) (not (= (mod (select .cse5 .cse7) 4294967296) 4294967294))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse9 (select v_ArrVal_1817 .cse2)) (.cse8 (select v_ArrVal_1817 .cse3)) (.cse10 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse8 2147483648) 0) (< 2147483647 .cse9) (not (= v_ArrVal_1817 (store (store .cse1 .cse2 .cse9) .cse3 .cse8))) (< .cse9 0) (< 0 (+ .cse8 1)) (= (mod (select .cse10 .cse6) 4294967296) 4294967294) (not (= (mod (select .cse10 .cse7) 4294967296) 4294967294))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse11 (select v_ArrVal_1817 .cse2)) (.cse12 (select v_ArrVal_1817 .cse3)) (.cse13 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (not (= v_ArrVal_1817 (store (store .cse1 .cse2 .cse11) .cse3 .cse12))) (< 0 (+ .cse11 1)) (< (+ .cse11 2147483648) 0) (< 2147483647 .cse12) (< .cse12 0) (= (mod (select .cse13 .cse6) 4294967296) 4294967294) (not (= (mod (select .cse13 .cse7) 4294967296) 4294967294))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse15 (select v_ArrVal_1817 .cse2)) (.cse14 (select v_ArrVal_1817 .cse3)) (.cse16 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse14 2147483648) 0) (not (= v_ArrVal_1817 (store (store .cse1 .cse2 .cse15) .cse3 .cse14))) (< 0 (+ .cse15 1)) (< (+ .cse15 2147483648) 0) (< 0 (+ .cse14 1)) (= (mod (select .cse16 .cse6) 4294967296) 4294967294) (not (= (mod (select .cse16 .cse7) 4294967296) 4294967294))))))))) is different from false [2023-12-02 17:42:21,618 WARN L854 $PredicateComparison]: unable to prove that (or (= 3 c_~top~0) (= 5 c_~top~0) (= c_~top~0 4) (< 2147483645 c_~top~0) (let ((.cse38 (* c_~top~0 4))) (let ((.cse4 (+ |c_~#arr~0.offset| .cse38 (- 8))) (.cse5 (+ |c_~#arr~0.offset| (- 4) .cse38)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse9 (+ |c_~#arr~0.offset| .cse38 8)) (.cse8 (+ |c_~#arr~0.offset| .cse38 4)) (.cse7 (+ |c_~#arr~0.offset| .cse38))) (and (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse1 (select v_ArrVal_1817 .cse7)) (.cse0 (select v_ArrVal_1817 .cse8)) (.cse2 (select v_ArrVal_1817 .cse9))) (or (< (+ .cse0 2147483648) 0) (< 2147483647 .cse1) (< .cse2 0) (not (= (mod (select .cse3 .cse4) 4294967296) 4294967294)) (< .cse1 0) (< 2147483647 .cse2) (< 0 (+ .cse0 1)) (= 4294967294 (mod (select .cse3 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse1) .cse8 .cse0) .cse9 .cse2)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse10 (select v_ArrVal_1817 .cse7)) (.cse13 (select v_ArrVal_1817 .cse8)) (.cse11 (select v_ArrVal_1817 .cse9))) (or (< 0 (+ .cse10 1)) (< .cse11 0) (not (= (mod (select .cse12 .cse4) 4294967296) 4294967294)) (< (+ .cse10 2147483648) 0) (< 2147483647 .cse11) (< 2147483647 .cse13) (< .cse13 0) (= 4294967294 (mod (select .cse12 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse10) .cse8 .cse13) .cse9 .cse11)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse15 (select v_ArrVal_1817 .cse7)) (.cse14 (select v_ArrVal_1817 .cse8)) (.cse16 (select v_ArrVal_1817 .cse9))) (or (< (+ .cse14 2147483648) 0) (< 2147483647 .cse15) (< 0 (+ .cse16 1)) (not (= (mod (select .cse17 .cse4) 4294967296) 4294967294)) (< (+ .cse16 2147483648) 0) (< .cse15 0) (< 0 (+ .cse14 1)) (= 4294967294 (mod (select .cse17 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse15) .cse8 .cse14) .cse9 .cse16)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse18 (select v_ArrVal_1817 .cse7)) (.cse21 (select v_ArrVal_1817 .cse8)) (.cse19 (select v_ArrVal_1817 .cse9))) (or (< 2147483647 .cse18) (< .cse19 0) (not (= (mod (select .cse20 .cse4) 4294967296) 4294967294)) (< .cse18 0) (< 2147483647 .cse19) (< 2147483647 .cse21) (< .cse21 0) (= 4294967294 (mod (select .cse20 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse18) .cse8 .cse21) .cse9 .cse19)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse23 (select v_ArrVal_1817 .cse7)) (.cse25 (select v_ArrVal_1817 .cse8)) (.cse22 (select v_ArrVal_1817 .cse9))) (or (< 0 (+ .cse22 1)) (< 0 (+ .cse23 1)) (not (= (mod (select .cse24 .cse4) 4294967296) 4294967294)) (< (+ .cse23 2147483648) 0) (< (+ .cse22 2147483648) 0) (< 2147483647 .cse25) (< .cse25 0) (= 4294967294 (mod (select .cse24 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse23) .cse8 .cse25) .cse9 .cse22)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse26 (select v_ArrVal_1817 .cse7)) (.cse29 (select v_ArrVal_1817 .cse8)) (.cse27 (select v_ArrVal_1817 .cse9))) (or (< 2147483647 .cse26) (< 0 (+ .cse27 1)) (not (= (mod (select .cse28 .cse4) 4294967296) 4294967294)) (< (+ .cse27 2147483648) 0) (< .cse26 0) (< 2147483647 .cse29) (< .cse29 0) (= 4294967294 (mod (select .cse28 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse26) .cse8 .cse29) .cse9 .cse27)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse31 (select v_ArrVal_1817 .cse7)) (.cse30 (select v_ArrVal_1817 .cse8)) (.cse32 (select v_ArrVal_1817 .cse9))) (or (< (+ .cse30 2147483648) 0) (< 0 (+ .cse31 1)) (< .cse32 0) (not (= (mod (select .cse33 .cse4) 4294967296) 4294967294)) (< (+ .cse31 2147483648) 0) (< 2147483647 .cse32) (< 0 (+ .cse30 1)) (= 4294967294 (mod (select .cse33 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse31) .cse8 .cse30) .cse9 .cse32)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse36 (select v_ArrVal_1817 .cse7)) (.cse34 (select v_ArrVal_1817 .cse8)) (.cse35 (select v_ArrVal_1817 .cse9))) (or (< (+ .cse34 2147483648) 0) (< 0 (+ .cse35 1)) (< 0 (+ .cse36 1)) (not (= (mod (select .cse37 .cse4) 4294967296) 4294967294)) (< (+ .cse36 2147483648) 0) (< (+ .cse35 2147483648) 0) (< 0 (+ .cse34 1)) (= 4294967294 (mod (select .cse37 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse36) .cse8 .cse34) .cse9 .cse35))))))))) (< c_~top~0 2)) is different from false [2023-12-02 17:42:23,892 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 3 c_~top~0) (= 5 c_~top~0) (= c_~top~0 4) (< 2147483645 c_~top~0) (let ((.cse38 (* c_~top~0 4))) (let ((.cse4 (+ |c_~#arr~0.offset| .cse38 (- 8))) (.cse5 (+ |c_~#arr~0.offset| (- 4) .cse38)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse9 (+ |c_~#arr~0.offset| .cse38 8)) (.cse8 (+ |c_~#arr~0.offset| .cse38 4)) (.cse7 (+ |c_~#arr~0.offset| .cse38))) (and (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse1 (select v_ArrVal_1817 .cse7)) (.cse0 (select v_ArrVal_1817 .cse8)) (.cse2 (select v_ArrVal_1817 .cse9))) (or (< (+ .cse0 2147483648) 0) (< 2147483647 .cse1) (< .cse2 0) (not (= (mod (select .cse3 .cse4) 4294967296) 4294967294)) (< .cse1 0) (< 2147483647 .cse2) (< 0 (+ .cse0 1)) (= 4294967294 (mod (select .cse3 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse1) .cse8 .cse0) .cse9 .cse2)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse10 (select v_ArrVal_1817 .cse7)) (.cse13 (select v_ArrVal_1817 .cse8)) (.cse11 (select v_ArrVal_1817 .cse9))) (or (< 0 (+ .cse10 1)) (< .cse11 0) (not (= (mod (select .cse12 .cse4) 4294967296) 4294967294)) (< (+ .cse10 2147483648) 0) (< 2147483647 .cse11) (< 2147483647 .cse13) (< .cse13 0) (= 4294967294 (mod (select .cse12 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse10) .cse8 .cse13) .cse9 .cse11)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse15 (select v_ArrVal_1817 .cse7)) (.cse14 (select v_ArrVal_1817 .cse8)) (.cse16 (select v_ArrVal_1817 .cse9))) (or (< (+ .cse14 2147483648) 0) (< 2147483647 .cse15) (< 0 (+ .cse16 1)) (not (= (mod (select .cse17 .cse4) 4294967296) 4294967294)) (< (+ .cse16 2147483648) 0) (< .cse15 0) (< 0 (+ .cse14 1)) (= 4294967294 (mod (select .cse17 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse15) .cse8 .cse14) .cse9 .cse16)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse18 (select v_ArrVal_1817 .cse7)) (.cse21 (select v_ArrVal_1817 .cse8)) (.cse19 (select v_ArrVal_1817 .cse9))) (or (< 2147483647 .cse18) (< .cse19 0) (not (= (mod (select .cse20 .cse4) 4294967296) 4294967294)) (< .cse18 0) (< 2147483647 .cse19) (< 2147483647 .cse21) (< .cse21 0) (= 4294967294 (mod (select .cse20 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse18) .cse8 .cse21) .cse9 .cse19)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse23 (select v_ArrVal_1817 .cse7)) (.cse25 (select v_ArrVal_1817 .cse8)) (.cse22 (select v_ArrVal_1817 .cse9))) (or (< 0 (+ .cse22 1)) (< 0 (+ .cse23 1)) (not (= (mod (select .cse24 .cse4) 4294967296) 4294967294)) (< (+ .cse23 2147483648) 0) (< (+ .cse22 2147483648) 0) (< 2147483647 .cse25) (< .cse25 0) (= 4294967294 (mod (select .cse24 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse23) .cse8 .cse25) .cse9 .cse22)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse26 (select v_ArrVal_1817 .cse7)) (.cse29 (select v_ArrVal_1817 .cse8)) (.cse27 (select v_ArrVal_1817 .cse9))) (or (< 2147483647 .cse26) (< 0 (+ .cse27 1)) (not (= (mod (select .cse28 .cse4) 4294967296) 4294967294)) (< (+ .cse27 2147483648) 0) (< .cse26 0) (< 2147483647 .cse29) (< .cse29 0) (= 4294967294 (mod (select .cse28 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse26) .cse8 .cse29) .cse9 .cse27)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse31 (select v_ArrVal_1817 .cse7)) (.cse30 (select v_ArrVal_1817 .cse8)) (.cse32 (select v_ArrVal_1817 .cse9))) (or (< (+ .cse30 2147483648) 0) (< 0 (+ .cse31 1)) (< .cse32 0) (not (= (mod (select .cse33 .cse4) 4294967296) 4294967294)) (< (+ .cse31 2147483648) 0) (< 2147483647 .cse32) (< 0 (+ .cse30 1)) (= 4294967294 (mod (select .cse33 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse31) .cse8 .cse30) .cse9 .cse32)))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse36 (select v_ArrVal_1817 .cse7)) (.cse34 (select v_ArrVal_1817 .cse8)) (.cse35 (select v_ArrVal_1817 .cse9))) (or (< (+ .cse34 2147483648) 0) (< 0 (+ .cse35 1)) (< 0 (+ .cse36 1)) (not (= (mod (select .cse37 .cse4) 4294967296) 4294967294)) (< (+ .cse36 2147483648) 0) (< (+ .cse35 2147483648) 0) (< 0 (+ .cse34 1)) (= 4294967294 (mod (select .cse37 .cse5) 4294967296)) (not (= v_ArrVal_1817 (store (store (store .cse6 .cse7 .cse36) .cse8 .cse34) .cse9 .cse35))))))))) (< c_~top~0 2)) is different from false [2023-12-02 17:42:25,582 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse86 (* c_~top~0 4))) (let ((.cse4 (+ |c_~#arr~0.offset| (- 4) .cse86)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse10 (+ |c_~#arr~0.offset| .cse86 12)) (.cse8 (+ |c_~#arr~0.offset| .cse86 4)) (.cse9 (+ |c_~#arr~0.offset| .cse86 8)) (.cse7 (+ |c_~#arr~0.offset| .cse86))) (and (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse2 (select v_ArrVal_1817 .cse7)) (.cse1 (select v_ArrVal_1817 .cse9)) (.cse0 (select v_ArrVal_1817 .cse8)) (.cse3 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse5 (select v_ArrVal_1817 .cse10))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ .cse1 1)) (< 0 (+ .cse2 1)) (< (+ .cse2 2147483648) 0) (< (+ .cse1 2147483648) 0) (not (= 4294967294 (mod (select .cse3 .cse4) 4294967296))) (< 2147483647 .cse5) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse2) .cse8 .cse0) .cse9 .cse1) .cse10 .cse5))) (< 0 (+ .cse0 1)) (= 4294967294 (mod (select .cse3 .cse7) 4294967296)) (< .cse5 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse12 (select v_ArrVal_1817 .cse7)) (.cse11 (select v_ArrVal_1817 .cse9)) (.cse15 (select v_ArrVal_1817 .cse8)) (.cse13 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse14 (select v_ArrVal_1817 .cse10))) (or (< 0 (+ .cse11 1)) (< 0 (+ .cse12 1)) (< (+ .cse12 2147483648) 0) (< (+ .cse11 2147483648) 0) (not (= 4294967294 (mod (select .cse13 .cse4) 4294967296))) (< 2147483647 .cse14) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse12) .cse8 .cse15) .cse9 .cse11) .cse10 .cse14))) (< 2147483647 .cse15) (< .cse15 0) (= 4294967294 (mod (select .cse13 .cse7) 4294967296)) (< .cse14 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse17 (select v_ArrVal_1817 .cse7)) (.cse18 (select v_ArrVal_1817 .cse9)) (.cse16 (select v_ArrVal_1817 .cse8)) (.cse20 (select v_ArrVal_1817 .cse10)) (.cse19 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse16 2147483648) 0) (< 0 (+ .cse17 1)) (< .cse18 0) (< (+ .cse17 2147483648) 0) (not (= 4294967294 (mod (select .cse19 .cse4) 4294967296))) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse17) .cse8 .cse16) .cse9 .cse18) .cse10 .cse20))) (< (+ .cse20 2147483648) 0) (< 2147483647 .cse18) (< 0 (+ .cse16 1)) (< 0 (+ .cse20 1)) (= 4294967294 (mod (select .cse19 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse22 (select v_ArrVal_1817 .cse7)) (.cse23 (select v_ArrVal_1817 .cse9)) (.cse21 (select v_ArrVal_1817 .cse8)) (.cse24 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse25 (select v_ArrVal_1817 .cse10))) (or (< (+ .cse21 2147483648) 0) (< 2147483647 .cse22) (< 0 (+ .cse23 1)) (< (+ .cse23 2147483648) 0) (not (= 4294967294 (mod (select .cse24 .cse4) 4294967296))) (< .cse22 0) (< 2147483647 .cse25) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse22) .cse8 .cse21) .cse9 .cse23) .cse10 .cse25))) (< 0 (+ .cse21 1)) (= 4294967294 (mod (select .cse24 .cse7) 4294967296)) (< .cse25 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse27 (select v_ArrVal_1817 .cse7)) (.cse28 (select v_ArrVal_1817 .cse9)) (.cse26 (select v_ArrVal_1817 .cse8)) (.cse30 (select v_ArrVal_1817 .cse10)) (.cse29 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse26 2147483648) 0) (< 2147483647 .cse27) (< .cse28 0) (not (= 4294967294 (mod (select .cse29 .cse4) 4294967296))) (< .cse27 0) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse27) .cse8 .cse26) .cse9 .cse28) .cse10 .cse30))) (< (+ .cse30 2147483648) 0) (< 2147483647 .cse28) (< 0 (+ .cse26 1)) (< 0 (+ .cse30 1)) (= 4294967294 (mod (select .cse29 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse31 (select v_ArrVal_1817 .cse7)) (.cse32 (select v_ArrVal_1817 .cse9)) (.cse34 (select v_ArrVal_1817 .cse8)) (.cse35 (select v_ArrVal_1817 .cse10)) (.cse33 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 0 (+ .cse31 1)) (< .cse32 0) (< (+ .cse31 2147483648) 0) (not (= 4294967294 (mod (select .cse33 .cse4) 4294967296))) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse31) .cse8 .cse34) .cse9 .cse32) .cse10 .cse35))) (< (+ .cse35 2147483648) 0) (< 2147483647 .cse32) (< 2147483647 .cse34) (< .cse34 0) (< 0 (+ .cse35 1)) (= 4294967294 (mod (select .cse33 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse36 (select v_ArrVal_1817 .cse7)) (.cse37 (select v_ArrVal_1817 .cse9)) (.cse39 (select v_ArrVal_1817 .cse8)) (.cse40 (select v_ArrVal_1817 .cse10)) (.cse38 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 2147483647 .cse36) (< 0 (+ .cse37 1)) (< (+ .cse37 2147483648) 0) (not (= 4294967294 (mod (select .cse38 .cse4) 4294967296))) (< .cse36 0) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse36) .cse8 .cse39) .cse9 .cse37) .cse10 .cse40))) (< (+ .cse40 2147483648) 0) (< 2147483647 .cse39) (< .cse39 0) (< 0 (+ .cse40 1)) (= 4294967294 (mod (select .cse38 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse41 (select v_ArrVal_1817 .cse7)) (.cse42 (select v_ArrVal_1817 .cse9)) (.cse45 (select v_ArrVal_1817 .cse8)) (.cse43 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse44 (select v_ArrVal_1817 .cse10))) (or (< 0 (+ .cse41 1)) (< .cse42 0) (< (+ .cse41 2147483648) 0) (not (= 4294967294 (mod (select .cse43 .cse4) 4294967296))) (< 2147483647 .cse44) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse41) .cse8 .cse45) .cse9 .cse42) .cse10 .cse44))) (< 2147483647 .cse42) (< 2147483647 .cse45) (< .cse45 0) (= 4294967294 (mod (select .cse43 .cse7) 4294967296)) (< .cse44 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse46 (select v_ArrVal_1817 .cse7)) (.cse47 (select v_ArrVal_1817 .cse9)) (.cse50 (select v_ArrVal_1817 .cse8)) (.cse48 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse49 (select v_ArrVal_1817 .cse10))) (or (< 2147483647 .cse46) (< .cse47 0) (not (= 4294967294 (mod (select .cse48 .cse4) 4294967296))) (< .cse46 0) (< 2147483647 .cse49) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse46) .cse8 .cse50) .cse9 .cse47) .cse10 .cse49))) (< 2147483647 .cse47) (< 2147483647 .cse50) (< .cse50 0) (= 4294967294 (mod (select .cse48 .cse7) 4294967296)) (< .cse49 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse51 (select v_ArrVal_1817 .cse7)) (.cse52 (select v_ArrVal_1817 .cse9)) (.cse54 (select v_ArrVal_1817 .cse8)) (.cse55 (select v_ArrVal_1817 .cse10)) (.cse53 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 2147483647 .cse51) (< .cse52 0) (not (= 4294967294 (mod (select .cse53 .cse4) 4294967296))) (< .cse51 0) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse51) .cse8 .cse54) .cse9 .cse52) .cse10 .cse55))) (< (+ .cse55 2147483648) 0) (< 2147483647 .cse52) (< 2147483647 .cse54) (< .cse54 0) (< 0 (+ .cse55 1)) (= 4294967294 (mod (select .cse53 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse57 (select v_ArrVal_1817 .cse7)) (.cse56 (select v_ArrVal_1817 .cse9)) (.cse59 (select v_ArrVal_1817 .cse8)) (.cse60 (select v_ArrVal_1817 .cse10)) (.cse58 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 0 (+ .cse56 1)) (< 0 (+ .cse57 1)) (< (+ .cse57 2147483648) 0) (< (+ .cse56 2147483648) 0) (not (= 4294967294 (mod (select .cse58 .cse4) 4294967296))) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse57) .cse8 .cse59) .cse9 .cse56) .cse10 .cse60))) (< (+ .cse60 2147483648) 0) (< 2147483647 .cse59) (< .cse59 0) (< 0 (+ .cse60 1)) (= 4294967294 (mod (select .cse58 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse62 (select v_ArrVal_1817 .cse7)) (.cse63 (select v_ArrVal_1817 .cse9)) (.cse61 (select v_ArrVal_1817 .cse8)) (.cse64 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse65 (select v_ArrVal_1817 .cse10))) (or (< (+ .cse61 2147483648) 0) (< 2147483647 .cse62) (< .cse63 0) (not (= 4294967294 (mod (select .cse64 .cse4) 4294967296))) (< .cse62 0) (< 2147483647 .cse65) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse62) .cse8 .cse61) .cse9 .cse63) .cse10 .cse65))) (< 2147483647 .cse63) (< 0 (+ .cse61 1)) (= 4294967294 (mod (select .cse64 .cse7) 4294967296)) (< .cse65 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse67 (select v_ArrVal_1817 .cse7)) (.cse68 (select v_ArrVal_1817 .cse9)) (.cse66 (select v_ArrVal_1817 .cse8)) (.cse70 (select v_ArrVal_1817 .cse10)) (.cse69 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse66 2147483648) 0) (< 2147483647 .cse67) (< 0 (+ .cse68 1)) (< (+ .cse68 2147483648) 0) (not (= 4294967294 (mod (select .cse69 .cse4) 4294967296))) (< .cse67 0) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse67) .cse8 .cse66) .cse9 .cse68) .cse10 .cse70))) (< (+ .cse70 2147483648) 0) (< 0 (+ .cse66 1)) (< 0 (+ .cse70 1)) (= 4294967294 (mod (select .cse69 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse71 (select v_ArrVal_1817 .cse7)) (.cse72 (select v_ArrVal_1817 .cse9)) (.cse75 (select v_ArrVal_1817 .cse8)) (.cse73 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse74 (select v_ArrVal_1817 .cse10))) (or (< 2147483647 .cse71) (< 0 (+ .cse72 1)) (< (+ .cse72 2147483648) 0) (not (= 4294967294 (mod (select .cse73 .cse4) 4294967296))) (< .cse71 0) (< 2147483647 .cse74) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse71) .cse8 .cse75) .cse9 .cse72) .cse10 .cse74))) (< 2147483647 .cse75) (< .cse75 0) (= 4294967294 (mod (select .cse73 .cse7) 4294967296)) (< .cse74 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse78 (select v_ArrVal_1817 .cse7)) (.cse77 (select v_ArrVal_1817 .cse9)) (.cse76 (select v_ArrVal_1817 .cse8)) (.cse80 (select v_ArrVal_1817 .cse10)) (.cse79 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse76 2147483648) 0) (< 0 (+ .cse77 1)) (< 0 (+ .cse78 1)) (< (+ .cse78 2147483648) 0) (< (+ .cse77 2147483648) 0) (not (= 4294967294 (mod (select .cse79 .cse4) 4294967296))) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse78) .cse8 .cse76) .cse9 .cse77) .cse10 .cse80))) (< (+ .cse80 2147483648) 0) (< 0 (+ .cse76 1)) (< 0 (+ .cse80 1)) (= 4294967294 (mod (select .cse79 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse82 (select v_ArrVal_1817 .cse7)) (.cse83 (select v_ArrVal_1817 .cse9)) (.cse81 (select v_ArrVal_1817 .cse8)) (.cse84 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse85 (select v_ArrVal_1817 .cse10))) (or (< (+ .cse81 2147483648) 0) (< 0 (+ .cse82 1)) (< .cse83 0) (< (+ .cse82 2147483648) 0) (not (= 4294967294 (mod (select .cse84 .cse4) 4294967296))) (< 2147483647 .cse85) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse82) .cse8 .cse81) .cse9 .cse83) .cse10 .cse85))) (< 2147483647 .cse83) (< 0 (+ .cse81 1)) (= 4294967294 (mod (select .cse84 .cse7) 4294967296)) (< .cse85 0))))))) (< 2147483644 c_~top~0) (= 3 c_~top~0) (= 5 c_~top~0) (= 2 c_~top~0) (= c_~top~0 4) (< c_~top~0 1)) is different from false [2023-12-02 17:42:32,007 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse86 (* c_~top~0 4))) (let ((.cse4 (+ |c_~#arr~0.offset| (- 4) .cse86)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse10 (+ |c_~#arr~0.offset| .cse86 12)) (.cse8 (+ |c_~#arr~0.offset| .cse86 4)) (.cse9 (+ |c_~#arr~0.offset| .cse86 8)) (.cse7 (+ |c_~#arr~0.offset| .cse86))) (and (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse2 (select v_ArrVal_1817 .cse7)) (.cse1 (select v_ArrVal_1817 .cse9)) (.cse0 (select v_ArrVal_1817 .cse8)) (.cse3 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse5 (select v_ArrVal_1817 .cse10))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ .cse1 1)) (< 0 (+ .cse2 1)) (< (+ .cse2 2147483648) 0) (< (+ .cse1 2147483648) 0) (not (= 4294967294 (mod (select .cse3 .cse4) 4294967296))) (< 2147483647 .cse5) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse2) .cse8 .cse0) .cse9 .cse1) .cse10 .cse5))) (< 0 (+ .cse0 1)) (= 4294967294 (mod (select .cse3 .cse7) 4294967296)) (< .cse5 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse12 (select v_ArrVal_1817 .cse7)) (.cse11 (select v_ArrVal_1817 .cse9)) (.cse15 (select v_ArrVal_1817 .cse8)) (.cse13 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse14 (select v_ArrVal_1817 .cse10))) (or (< 0 (+ .cse11 1)) (< 0 (+ .cse12 1)) (< (+ .cse12 2147483648) 0) (< (+ .cse11 2147483648) 0) (not (= 4294967294 (mod (select .cse13 .cse4) 4294967296))) (< 2147483647 .cse14) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse12) .cse8 .cse15) .cse9 .cse11) .cse10 .cse14))) (< 2147483647 .cse15) (< .cse15 0) (= 4294967294 (mod (select .cse13 .cse7) 4294967296)) (< .cse14 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse17 (select v_ArrVal_1817 .cse7)) (.cse18 (select v_ArrVal_1817 .cse9)) (.cse16 (select v_ArrVal_1817 .cse8)) (.cse20 (select v_ArrVal_1817 .cse10)) (.cse19 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse16 2147483648) 0) (< 0 (+ .cse17 1)) (< .cse18 0) (< (+ .cse17 2147483648) 0) (not (= 4294967294 (mod (select .cse19 .cse4) 4294967296))) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse17) .cse8 .cse16) .cse9 .cse18) .cse10 .cse20))) (< (+ .cse20 2147483648) 0) (< 2147483647 .cse18) (< 0 (+ .cse16 1)) (< 0 (+ .cse20 1)) (= 4294967294 (mod (select .cse19 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse22 (select v_ArrVal_1817 .cse7)) (.cse23 (select v_ArrVal_1817 .cse9)) (.cse21 (select v_ArrVal_1817 .cse8)) (.cse24 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse25 (select v_ArrVal_1817 .cse10))) (or (< (+ .cse21 2147483648) 0) (< 2147483647 .cse22) (< 0 (+ .cse23 1)) (< (+ .cse23 2147483648) 0) (not (= 4294967294 (mod (select .cse24 .cse4) 4294967296))) (< .cse22 0) (< 2147483647 .cse25) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse22) .cse8 .cse21) .cse9 .cse23) .cse10 .cse25))) (< 0 (+ .cse21 1)) (= 4294967294 (mod (select .cse24 .cse7) 4294967296)) (< .cse25 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse27 (select v_ArrVal_1817 .cse7)) (.cse28 (select v_ArrVal_1817 .cse9)) (.cse26 (select v_ArrVal_1817 .cse8)) (.cse30 (select v_ArrVal_1817 .cse10)) (.cse29 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse26 2147483648) 0) (< 2147483647 .cse27) (< .cse28 0) (not (= 4294967294 (mod (select .cse29 .cse4) 4294967296))) (< .cse27 0) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse27) .cse8 .cse26) .cse9 .cse28) .cse10 .cse30))) (< (+ .cse30 2147483648) 0) (< 2147483647 .cse28) (< 0 (+ .cse26 1)) (< 0 (+ .cse30 1)) (= 4294967294 (mod (select .cse29 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse31 (select v_ArrVal_1817 .cse7)) (.cse32 (select v_ArrVal_1817 .cse9)) (.cse34 (select v_ArrVal_1817 .cse8)) (.cse35 (select v_ArrVal_1817 .cse10)) (.cse33 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 0 (+ .cse31 1)) (< .cse32 0) (< (+ .cse31 2147483648) 0) (not (= 4294967294 (mod (select .cse33 .cse4) 4294967296))) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse31) .cse8 .cse34) .cse9 .cse32) .cse10 .cse35))) (< (+ .cse35 2147483648) 0) (< 2147483647 .cse32) (< 2147483647 .cse34) (< .cse34 0) (< 0 (+ .cse35 1)) (= 4294967294 (mod (select .cse33 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse36 (select v_ArrVal_1817 .cse7)) (.cse37 (select v_ArrVal_1817 .cse9)) (.cse39 (select v_ArrVal_1817 .cse8)) (.cse40 (select v_ArrVal_1817 .cse10)) (.cse38 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 2147483647 .cse36) (< 0 (+ .cse37 1)) (< (+ .cse37 2147483648) 0) (not (= 4294967294 (mod (select .cse38 .cse4) 4294967296))) (< .cse36 0) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse36) .cse8 .cse39) .cse9 .cse37) .cse10 .cse40))) (< (+ .cse40 2147483648) 0) (< 2147483647 .cse39) (< .cse39 0) (< 0 (+ .cse40 1)) (= 4294967294 (mod (select .cse38 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse41 (select v_ArrVal_1817 .cse7)) (.cse42 (select v_ArrVal_1817 .cse9)) (.cse45 (select v_ArrVal_1817 .cse8)) (.cse43 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse44 (select v_ArrVal_1817 .cse10))) (or (< 0 (+ .cse41 1)) (< .cse42 0) (< (+ .cse41 2147483648) 0) (not (= 4294967294 (mod (select .cse43 .cse4) 4294967296))) (< 2147483647 .cse44) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse41) .cse8 .cse45) .cse9 .cse42) .cse10 .cse44))) (< 2147483647 .cse42) (< 2147483647 .cse45) (< .cse45 0) (= 4294967294 (mod (select .cse43 .cse7) 4294967296)) (< .cse44 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse46 (select v_ArrVal_1817 .cse7)) (.cse47 (select v_ArrVal_1817 .cse9)) (.cse50 (select v_ArrVal_1817 .cse8)) (.cse48 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse49 (select v_ArrVal_1817 .cse10))) (or (< 2147483647 .cse46) (< .cse47 0) (not (= 4294967294 (mod (select .cse48 .cse4) 4294967296))) (< .cse46 0) (< 2147483647 .cse49) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse46) .cse8 .cse50) .cse9 .cse47) .cse10 .cse49))) (< 2147483647 .cse47) (< 2147483647 .cse50) (< .cse50 0) (= 4294967294 (mod (select .cse48 .cse7) 4294967296)) (< .cse49 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse51 (select v_ArrVal_1817 .cse7)) (.cse52 (select v_ArrVal_1817 .cse9)) (.cse54 (select v_ArrVal_1817 .cse8)) (.cse55 (select v_ArrVal_1817 .cse10)) (.cse53 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 2147483647 .cse51) (< .cse52 0) (not (= 4294967294 (mod (select .cse53 .cse4) 4294967296))) (< .cse51 0) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse51) .cse8 .cse54) .cse9 .cse52) .cse10 .cse55))) (< (+ .cse55 2147483648) 0) (< 2147483647 .cse52) (< 2147483647 .cse54) (< .cse54 0) (< 0 (+ .cse55 1)) (= 4294967294 (mod (select .cse53 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse57 (select v_ArrVal_1817 .cse7)) (.cse56 (select v_ArrVal_1817 .cse9)) (.cse59 (select v_ArrVal_1817 .cse8)) (.cse60 (select v_ArrVal_1817 .cse10)) (.cse58 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< 0 (+ .cse56 1)) (< 0 (+ .cse57 1)) (< (+ .cse57 2147483648) 0) (< (+ .cse56 2147483648) 0) (not (= 4294967294 (mod (select .cse58 .cse4) 4294967296))) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse57) .cse8 .cse59) .cse9 .cse56) .cse10 .cse60))) (< (+ .cse60 2147483648) 0) (< 2147483647 .cse59) (< .cse59 0) (< 0 (+ .cse60 1)) (= 4294967294 (mod (select .cse58 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse62 (select v_ArrVal_1817 .cse7)) (.cse63 (select v_ArrVal_1817 .cse9)) (.cse61 (select v_ArrVal_1817 .cse8)) (.cse64 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse65 (select v_ArrVal_1817 .cse10))) (or (< (+ .cse61 2147483648) 0) (< 2147483647 .cse62) (< .cse63 0) (not (= 4294967294 (mod (select .cse64 .cse4) 4294967296))) (< .cse62 0) (< 2147483647 .cse65) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse62) .cse8 .cse61) .cse9 .cse63) .cse10 .cse65))) (< 2147483647 .cse63) (< 0 (+ .cse61 1)) (= 4294967294 (mod (select .cse64 .cse7) 4294967296)) (< .cse65 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse67 (select v_ArrVal_1817 .cse7)) (.cse68 (select v_ArrVal_1817 .cse9)) (.cse66 (select v_ArrVal_1817 .cse8)) (.cse70 (select v_ArrVal_1817 .cse10)) (.cse69 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse66 2147483648) 0) (< 2147483647 .cse67) (< 0 (+ .cse68 1)) (< (+ .cse68 2147483648) 0) (not (= 4294967294 (mod (select .cse69 .cse4) 4294967296))) (< .cse67 0) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse67) .cse8 .cse66) .cse9 .cse68) .cse10 .cse70))) (< (+ .cse70 2147483648) 0) (< 0 (+ .cse66 1)) (< 0 (+ .cse70 1)) (= 4294967294 (mod (select .cse69 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse71 (select v_ArrVal_1817 .cse7)) (.cse72 (select v_ArrVal_1817 .cse9)) (.cse75 (select v_ArrVal_1817 .cse8)) (.cse73 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse74 (select v_ArrVal_1817 .cse10))) (or (< 2147483647 .cse71) (< 0 (+ .cse72 1)) (< (+ .cse72 2147483648) 0) (not (= 4294967294 (mod (select .cse73 .cse4) 4294967296))) (< .cse71 0) (< 2147483647 .cse74) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse71) .cse8 .cse75) .cse9 .cse72) .cse10 .cse74))) (< 2147483647 .cse75) (< .cse75 0) (= 4294967294 (mod (select .cse73 .cse7) 4294967296)) (< .cse74 0)))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse78 (select v_ArrVal_1817 .cse7)) (.cse77 (select v_ArrVal_1817 .cse9)) (.cse76 (select v_ArrVal_1817 .cse8)) (.cse80 (select v_ArrVal_1817 .cse10)) (.cse79 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|))) (or (< (+ .cse76 2147483648) 0) (< 0 (+ .cse77 1)) (< 0 (+ .cse78 1)) (< (+ .cse78 2147483648) 0) (< (+ .cse77 2147483648) 0) (not (= 4294967294 (mod (select .cse79 .cse4) 4294967296))) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse78) .cse8 .cse76) .cse9 .cse77) .cse10 .cse80))) (< (+ .cse80 2147483648) 0) (< 0 (+ .cse76 1)) (< 0 (+ .cse80 1)) (= 4294967294 (mod (select .cse79 .cse7) 4294967296))))) (forall ((v_ArrVal_1818 (Array Int Int)) (v_ArrVal_1817 (Array Int Int))) (let ((.cse82 (select v_ArrVal_1817 .cse7)) (.cse83 (select v_ArrVal_1817 .cse9)) (.cse81 (select v_ArrVal_1817 .cse8)) (.cse84 (select (store (store |c_#memory_int| |c_~#arr~0.base| v_ArrVal_1817) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1818) |c_~#arr~0.base|)) (.cse85 (select v_ArrVal_1817 .cse10))) (or (< (+ .cse81 2147483648) 0) (< 0 (+ .cse82 1)) (< .cse83 0) (< (+ .cse82 2147483648) 0) (not (= 4294967294 (mod (select .cse84 .cse4) 4294967296))) (< 2147483647 .cse85) (not (= v_ArrVal_1817 (store (store (store (store .cse6 .cse7 .cse82) .cse8 .cse81) .cse9 .cse83) .cse10 .cse85))) (< 2147483647 .cse83) (< 0 (+ .cse81 1)) (= 4294967294 (mod (select .cse84 .cse7) 4294967296)) (< .cse85 0))))))) (< 2147483644 c_~top~0) (= (+ |c_t1Thread1of1ForFork1_#t~ret41#1| 1) 0) (= 3 c_~top~0) (= 5 c_~top~0) (= 2 c_~top~0) (= c_~top~0 4) (< c_~top~0 1)) is different from false [2023-12-02 17:42:32,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3665 treesize of output 3633 [2023-12-02 17:42:32,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:32,773 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 3633 treesize of output 3620 [2023-12-02 17:42:38,288 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 350 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 17:42:38,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:38,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 16 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 16 new quantified variables, introduced 80 case distinctions, treesize of input 3620 treesize of output 13101 [2023-12-02 17:42:39,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2548 treesize of output 2535 [2023-12-02 17:42:39,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2535 treesize of output 2522 [2023-12-02 17:42:40,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2522 treesize of output 2509 [2023-12-02 17:42:40,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2509 treesize of output 2496 [2023-12-02 17:42:41,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2496 treesize of output 2483 [2023-12-02 17:42:42,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2483 treesize of output 2470 [2023-12-02 17:42:42,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2470 treesize of output 2457 [2023-12-02 17:42:43,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2457 treesize of output 2444 [2023-12-02 17:42:43,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2444 treesize of output 2431 [2023-12-02 17:42:44,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2431 treesize of output 2418 [2023-12-02 17:42:44,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2418 treesize of output 2405 [2023-12-02 17:42:45,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2405 treesize of output 2392 [2023-12-02 17:42:46,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2392 treesize of output 2379 [2023-12-02 17:42:46,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2379 treesize of output 2366 [2023-12-02 17:42:47,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2366 treesize of output 2353 [2023-12-02 17:43:04,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:05,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:06,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:06,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:07,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:08,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:09,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:10,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:11,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:12,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:13,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:13,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:15,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:16,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:17,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:37,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:38,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:39,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:39,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:40,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:41,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:43,304 INFO L224 Elim1Store]: Index analysis took 395 ms [2023-12-02 17:43:43,431 INFO L349 Elim1Store]: treesize reduction 874, result has 0.1 percent of original size [2023-12-02 17:43:43,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 16 new quantified variables, introduced 110 case distinctions, treesize of input 3952 treesize of output 9259 [2023-12-02 17:43:43,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 17:43:43,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:43:43,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 27 [2023-12-02 17:43:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 56 not checked. [2023-12-02 17:43:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376363910] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:43:43,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1442673326] [2023-12-02 17:43:43,697 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 17:43:43,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:43:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 19] total 49 [2023-12-02 17:43:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913001727] [2023-12-02 17:43:43,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:43:43,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 17:43:43,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:43:43,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 17:43:43,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1434, Unknown=9, NotChecked=696, Total=2450 [2023-12-02 17:43:43,699 INFO L87 Difference]: Start difference. First operand 340 states and 686 transitions. Second operand has 50 states, 50 states have (on average 4.1) internal successors, (205), 49 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:43:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:43:56,933 INFO L93 Difference]: Finished difference Result 372 states and 746 transitions. [2023-12-02 17:43:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 17:43:56,933 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.1) internal successors, (205), 49 states have internal predecessors, (205), 0 states have call successors, (0), 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 69 [2023-12-02 17:43:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:43:56,933 INFO L225 Difference]: With dead ends: 372 [2023-12-02 17:43:56,934 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 17:43:56,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=680, Invalid=3125, Unknown=9, NotChecked=1016, Total=4830 [2023-12-02 17:43:56,934 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 613 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 988 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:43:56,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 403 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2024 Invalid, 0 Unknown, 988 Unchecked, 2.1s Time] [2023-12-02 17:43:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 17:43:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 17:43:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 17:43:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 17:43:56,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2023-12-02 17:43:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:43:56,936 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 17:43:56,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.1) internal successors, (205), 49 states have internal predecessors, (205), 0 states have call successors, (0), 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 17:43:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 17:43:56,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 17:43:56,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-02 17:43:56,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-12-02 17:43:56,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-12-02 17:43:56,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-12-02 17:43:56,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-02 17:43:56,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-02 17:43:56,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 17:43:57,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:43:57,142 INFO L445 BasicCegarLoop]: Path program histogram: [14, 3, 2, 2, 1, 1, 1] [2023-12-02 17:43:57,146 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 17:43:57,146 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 17:43:57,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:43:57 BasicIcfg [2023-12-02 17:43:57,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 17:43:57,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 17:43:57,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 17:43:57,148 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 17:43:57,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:35:53" (3/4) ... [2023-12-02 17:43:57,149 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 17:43:57,152 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2023-12-02 17:43:57,152 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2023-12-02 17:43:57,154 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2023-12-02 17:43:57,155 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-12-02 17:43:57,155 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-12-02 17:43:57,155 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-12-02 17:43:57,217 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 17:43:57,218 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 17:43:57,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 17:43:57,218 INFO L158 Benchmark]: Toolchain (without parser) took 484733.40ms. Allocated memory was 132.1MB in the beginning and 851.4MB in the end (delta: 719.3MB). Free memory was 93.2MB in the beginning and 512.9MB in the end (delta: -419.7MB). Peak memory consumption was 303.4MB. Max. memory is 16.1GB. [2023-12-02 17:43:57,219 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:43:57,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.32ms. Allocated memory is still 132.1MB. Free memory was 92.7MB in the beginning and 62.8MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-12-02 17:43:57,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.20ms. Allocated memory is still 132.1MB. Free memory was 62.8MB in the beginning and 60.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:43:57,220 INFO L158 Benchmark]: Boogie Preprocessor took 34.46ms. Allocated memory is still 132.1MB. Free memory was 60.2MB in the beginning and 58.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:43:57,220 INFO L158 Benchmark]: RCFGBuilder took 688.11ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 58.1MB in the beginning and 95.4MB in the end (delta: -37.3MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2023-12-02 17:43:57,220 INFO L158 Benchmark]: TraceAbstraction took 483284.40ms. Allocated memory was 161.5MB in the beginning and 851.4MB in the end (delta: 690.0MB). Free memory was 95.4MB in the beginning and 517.0MB in the end (delta: -421.6MB). Peak memory consumption was 269.3MB. Max. memory is 16.1GB. [2023-12-02 17:43:57,220 INFO L158 Benchmark]: Witness Printer took 70.06ms. Allocated memory is still 851.4MB. Free memory was 517.0MB in the beginning and 512.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 17:43:57,221 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.32ms. Allocated memory is still 132.1MB. Free memory was 92.7MB in the beginning and 62.8MB in the end (delta: 29.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.20ms. Allocated memory is still 132.1MB. Free memory was 62.8MB in the beginning and 60.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.46ms. Allocated memory is still 132.1MB. Free memory was 60.2MB in the beginning and 58.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 688.11ms. Allocated memory was 132.1MB in the beginning and 161.5MB in the end (delta: 29.4MB). Free memory was 58.1MB in the beginning and 95.4MB in the end (delta: -37.3MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 483284.40ms. Allocated memory was 161.5MB in the beginning and 851.4MB in the end (delta: 690.0MB). Free memory was 95.4MB in the beginning and 517.0MB in the end (delta: -421.6MB). Peak memory consumption was 269.3MB. Max. memory is 16.1GB. * Witness Printer took 70.06ms. Allocated memory is still 851.4MB. Free memory was 517.0MB in the beginning and 512.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 54 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 483.2s, OverallIterations: 24, TraceHistogramMax: 6, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.1s, AutomataDifference: 154.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 205 mSolverCounterUnknown, 14456 SdHoareTripleChecker+Valid, 78.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14456 mSDsluCounter, 6178 SdHoareTripleChecker+Invalid, 74.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7285 IncrementalHoareTripleChecker+Unchecked, 5734 mSDsCounter, 1373 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28540 IncrementalHoareTripleChecker+Invalid, 37403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1373 mSolverCounterUnsat, 444 mSDtfsCounter, 28540 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2667 GetRequests, 1487 SyntacticMatches, 59 SemanticMatches, 1121 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 19673 ImplicationChecksByTransitivity, 101.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5230occurred in iteration=12, InterpolantAutomatonStates: 720, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 26448 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 317.7s InterpolantComputationTime, 1903 NumberOfCodeBlocks, 1890 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 2681 ConstructedInterpolants, 126 QuantifiedInterpolants, 334616 SizeOfPredicates, 337 NumberOfNonLiveVariables, 5634 ConjunctsInSsa, 644 ConjunctsInUnsatCore, 61 InterpolantComputations, 7 PerfectInterpolantSequences, 664/3456 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-02 17:43:57,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75adf439-26d8-4dc0-b266-da38ad9b9fc2/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE