./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:19:11,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:19:11,805 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-24 23:19:11,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:19:11,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:19:11,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:19:11,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:19:11,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:19:11,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:19:11,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:19:11,844 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:19:11,845 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:19:11,846 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:19:11,846 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:19:11,847 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:19:11,848 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:19:11,848 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:19:11,849 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:19:11,850 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:19:11,850 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:19:11,851 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:19:11,852 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:19:11,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:19:11,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 23:19:11,854 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 23:19:11,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:19:11,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 23:19:11,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:19:11,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 23:19:11,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:19:11,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 23:19:11,881 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-24 23:19:11,881 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:19:11,882 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 23:19:11,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 23:19:11,883 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:19:11,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:19:11,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:19:11,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:19:11,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:19:11,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:19:11,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:19:11,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 23:19:11,889 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:19:11,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:19:11,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:19:11,890 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 23:19:11,890 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:19:11,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:19:11,891 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_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/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_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91 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 ! overflow) ) 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2023-11-24 23:19:12,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:19:12,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:19:12,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:19:12,263 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:19:12,280 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:19:12,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2023-11-24 23:19:15,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:19:15,884 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:19:15,885 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/sv-benchmarks/c/pthread/queue_ok_longer.i [2023-11-24 23:19:15,916 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/data/1ca00174e/e40e904b733c40eda18a7e510003d022/FLAG51b207dc8 [2023-11-24 23:19:15,965 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/data/1ca00174e/e40e904b733c40eda18a7e510003d022 [2023-11-24 23:19:15,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:19:15,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:19:15,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:19:15,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:19:15,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:19:15,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:19:15" (1/1) ... [2023-11-24 23:19:15,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ad439d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:15, skipping insertion in model container [2023-11-24 23:19:15,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:19:15" (1/1) ... [2023-11-24 23:19:16,068 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:19:16,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:19:16,647 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:19:16,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:19:16,828 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:19:16,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16 WrapperNode [2023-11-24 23:19:16,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:19:16,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:19:16,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:19:16,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:19:16,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,898 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 226 [2023-11-24 23:19:16,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:19:16,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:19:16,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:19:16,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:19:16,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:19:16,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:19:16,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:19:16,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:19:16,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (1/1) ... [2023-11-24 23:19:16,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:19:16,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:19:17,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:19:17,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:19:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-24 23:19:17,061 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-24 23:19:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-24 23:19:17,062 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-24 23:19:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 23:19:17,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:19:17,064 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-24 23:19:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 23:19:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 23:19:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-24 23:19:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 23:19:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 23:19:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:19:17,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:19:17,069 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 23:19:17,411 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:19:17,414 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:19:17,924 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:19:18,243 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:19:18,243 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 23:19:18,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:19:18 BoogieIcfgContainer [2023-11-24 23:19:18,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:19:18,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:19:18,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:19:18,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:19:18,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:19:15" (1/3) ... [2023-11-24 23:19:18,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40288671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:19:18, skipping insertion in model container [2023-11-24 23:19:18,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:19:16" (2/3) ... [2023-11-24 23:19:18,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40288671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:19:18, skipping insertion in model container [2023-11-24 23:19:18,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:19:18" (3/3) ... [2023-11-24 23:19:18,255 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2023-11-24 23:19:18,267 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 23:19:18,280 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:19:18,280 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-24 23:19:18,281 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 23:19:18,411 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 23:19:18,465 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 62 transitions, 138 flow [2023-11-24 23:19:18,604 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1126 states, 1078 states have (on average 2.7764378478664193) internal successors, (2993), 1125 states have internal predecessors, (2993), 0 states have call successors, (0), 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-11-24 23:19:18,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:19:18,635 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;@1dbc6b57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:19:18,636 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-24 23:19:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 1126 states, 1078 states have (on average 2.7764378478664193) internal successors, (2993), 1125 states have internal predecessors, (2993), 0 states have call successors, (0), 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-11-24 23:19:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-24 23:19:18,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:18,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:18,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:18,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1388236445, now seen corresponding path program 1 times [2023-11-24 23:19:18,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:18,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235966521] [2023-11-24 23:19:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:18,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:19,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235966521] [2023-11-24 23:19:19,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235966521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:19,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:19,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:19:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850134626] [2023-11-24 23:19:19,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:19,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:19:19,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:19:19,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:19:19,659 INFO L87 Difference]: Start difference. First operand has 1126 states, 1078 states have (on average 2.7764378478664193) internal successors, (2993), 1125 states have internal predecessors, (2993), 0 states have call successors, (0), 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, 3 states have (on average 2.6666666666666665) 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-11-24 23:19:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:19,956 INFO L93 Difference]: Finished difference Result 1230 states and 3261 transitions. [2023-11-24 23:19:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 23:19:19,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-11-24 23:19:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:19,989 INFO L225 Difference]: With dead ends: 1230 [2023-11-24 23:19:19,989 INFO L226 Difference]: Without dead ends: 1230 [2023-11-24 23:19:19,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:19:19,996 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:19,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 89 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:19:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2023-11-24 23:19:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1227. [2023-11-24 23:19:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1179 states have (on average 2.761662425784563) internal successors, (3256), 1226 states have internal predecessors, (3256), 0 states have call successors, (0), 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-11-24 23:19:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 3256 transitions. [2023-11-24 23:19:20,156 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 3256 transitions. Word has length 8 [2023-11-24 23:19:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:20,156 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 3256 transitions. [2023-11-24 23:19:20,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-11-24 23:19:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 3256 transitions. [2023-11-24 23:19:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-24 23:19:20,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:20,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:20,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:19:20,162 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:20,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1089532431, now seen corresponding path program 1 times [2023-11-24 23:19:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:20,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924497533] [2023-11-24 23:19:20,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:20,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:20,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:20,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924497533] [2023-11-24 23:19:20,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924497533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:20,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:20,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:19:20,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145223593] [2023-11-24 23:19:20,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:20,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:19:20,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:20,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:19:20,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:19:20,676 INFO L87 Difference]: Start difference. First operand 1227 states and 3256 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-24 23:19:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:20,964 INFO L93 Difference]: Finished difference Result 1712 states and 4510 transitions. [2023-11-24 23:19:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 23:19:20,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-24 23:19:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:20,986 INFO L225 Difference]: With dead ends: 1712 [2023-11-24 23:19:20,986 INFO L226 Difference]: Without dead ends: 1712 [2023-11-24 23:19:20,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:19:20,988 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 108 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:20,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 87 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:19:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2023-11-24 23:19:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1376. [2023-11-24 23:19:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1328 states have (on average 2.7808734939759034) internal successors, (3693), 1375 states have internal predecessors, (3693), 0 states have call successors, (0), 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-11-24 23:19:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 3693 transitions. [2023-11-24 23:19:21,061 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 3693 transitions. Word has length 9 [2023-11-24 23:19:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:21,062 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 3693 transitions. [2023-11-24 23:19:21,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-24 23:19:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 3693 transitions. [2023-11-24 23:19:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 23:19:21,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:21,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:21,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:19:21,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:21,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1691643503, now seen corresponding path program 1 times [2023-11-24 23:19:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:21,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390284821] [2023-11-24 23:19:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:21,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390284821] [2023-11-24 23:19:21,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390284821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:21,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:21,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:19:21,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896045775] [2023-11-24 23:19:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:21,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:19:21,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:21,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:19:21,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:19:21,174 INFO L87 Difference]: Start difference. First operand 1376 states and 3693 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:21,255 INFO L93 Difference]: Finished difference Result 566 states and 1315 transitions. [2023-11-24 23:19:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:19:21,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-24 23:19:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:21,260 INFO L225 Difference]: With dead ends: 566 [2023-11-24 23:19:21,261 INFO L226 Difference]: Without dead ends: 528 [2023-11-24 23:19:21,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:19:21,262 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 29 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:21,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 33 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:19:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-11-24 23:19:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2023-11-24 23:19:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 516 states have (on average 2.393410852713178) internal successors, (1235), 527 states have internal predecessors, (1235), 0 states have call successors, (0), 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-11-24 23:19:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1235 transitions. [2023-11-24 23:19:21,284 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1235 transitions. Word has length 11 [2023-11-24 23:19:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:21,285 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 1235 transitions. [2023-11-24 23:19:21,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1235 transitions. [2023-11-24 23:19:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 23:19:21,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:21,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:21,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:19:21,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:21,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash -711202270, now seen corresponding path program 1 times [2023-11-24 23:19:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:21,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636999851] [2023-11-24 23:19:21,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:21,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636999851] [2023-11-24 23:19:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636999851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:21,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:21,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:19:21,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171051725] [2023-11-24 23:19:21,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:21,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:19:21,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:21,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:19:21,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:19:21,659 INFO L87 Difference]: Start difference. First operand 528 states and 1235 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:21,857 INFO L93 Difference]: Finished difference Result 564 states and 1317 transitions. [2023-11-24 23:19:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:19:21,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-24 23:19:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:21,863 INFO L225 Difference]: With dead ends: 564 [2023-11-24 23:19:21,863 INFO L226 Difference]: Without dead ends: 564 [2023-11-24 23:19:21,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:19:21,865 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:21,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 89 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:19:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2023-11-24 23:19:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 561. [2023-11-24 23:19:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 549 states have (on average 2.389799635701275) internal successors, (1312), 560 states have internal predecessors, (1312), 0 states have call successors, (0), 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-11-24 23:19:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1312 transitions. [2023-11-24 23:19:21,889 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1312 transitions. Word has length 11 [2023-11-24 23:19:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:21,890 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 1312 transitions. [2023-11-24 23:19:21,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1312 transitions. [2023-11-24 23:19:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-24 23:19:21,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:21,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:21,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:19:21,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:21,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:21,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1193433590, now seen corresponding path program 1 times [2023-11-24 23:19:21,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:21,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060721955] [2023-11-24 23:19:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:21,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:22,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060721955] [2023-11-24 23:19:22,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060721955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:22,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:22,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:19:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056441469] [2023-11-24 23:19:22,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:22,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:19:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:22,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:19:22,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:19:22,328 INFO L87 Difference]: Start difference. First operand 561 states and 1312 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:22,582 INFO L93 Difference]: Finished difference Result 762 states and 1775 transitions. [2023-11-24 23:19:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:19:22,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-24 23:19:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:22,589 INFO L225 Difference]: With dead ends: 762 [2023-11-24 23:19:22,590 INFO L226 Difference]: Without dead ends: 762 [2023-11-24 23:19:22,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:19:22,591 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 95 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:22,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 91 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:19:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2023-11-24 23:19:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 606. [2023-11-24 23:19:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 594 states have (on average 2.410774410774411) internal successors, (1432), 605 states have internal predecessors, (1432), 0 states have call successors, (0), 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-11-24 23:19:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1432 transitions. [2023-11-24 23:19:22,620 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1432 transitions. Word has length 12 [2023-11-24 23:19:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:22,621 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1432 transitions. [2023-11-24 23:19:22,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1432 transitions. [2023-11-24 23:19:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-24 23:19:22,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:22,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:22,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:19:22,623 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:22,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash -572463128, now seen corresponding path program 2 times [2023-11-24 23:19:22,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854171257] [2023-11-24 23:19:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:23,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:23,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:23,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854171257] [2023-11-24 23:19:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854171257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:19:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174710534] [2023-11-24 23:19:23,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:23,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:19:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:19:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:19:23,030 INFO L87 Difference]: Start difference. First operand 606 states and 1432 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:23,326 INFO L93 Difference]: Finished difference Result 777 states and 1825 transitions. [2023-11-24 23:19:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:19:23,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-24 23:19:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:23,332 INFO L225 Difference]: With dead ends: 777 [2023-11-24 23:19:23,332 INFO L226 Difference]: Without dead ends: 777 [2023-11-24 23:19:23,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:19:23,333 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 72 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:23,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 90 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:19:23,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2023-11-24 23:19:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 576. [2023-11-24 23:19:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 564 states have (on average 2.4148936170212765) internal successors, (1362), 575 states have internal predecessors, (1362), 0 states have call successors, (0), 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-11-24 23:19:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1362 transitions. [2023-11-24 23:19:23,364 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1362 transitions. Word has length 12 [2023-11-24 23:19:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:23,365 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 1362 transitions. [2023-11-24 23:19:23,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1362 transitions. [2023-11-24 23:19:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-24 23:19:23,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:23,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:23,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:19:23,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:23,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash -572432247, now seen corresponding path program 1 times [2023-11-24 23:19:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:23,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239704523] [2023-11-24 23:19:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:23,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239704523] [2023-11-24 23:19:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239704523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:23,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:23,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 23:19:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818304561] [2023-11-24 23:19:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:23,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 23:19:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 23:19:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 23:19:23,457 INFO L87 Difference]: Start difference. First operand 576 states and 1362 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:23,613 INFO L93 Difference]: Finished difference Result 624 states and 1463 transitions. [2023-11-24 23:19:23,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 23:19:23,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-24 23:19:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:23,620 INFO L225 Difference]: With dead ends: 624 [2023-11-24 23:19:23,620 INFO L226 Difference]: Without dead ends: 624 [2023-11-24 23:19:23,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:19:23,622 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 68 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-11-24 23:19:23,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 68 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:19:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2023-11-24 23:19:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2023-11-24 23:19:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 612 states have (on average 2.3905228758169934) internal successors, (1463), 623 states have internal predecessors, (1463), 0 states have call successors, (0), 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-11-24 23:19:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1463 transitions. [2023-11-24 23:19:23,648 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1463 transitions. Word has length 12 [2023-11-24 23:19:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:23,649 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 1463 transitions. [2023-11-24 23:19:23,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 23:19:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1463 transitions. [2023-11-24 23:19:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-24 23:19:23,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:23,650 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:23,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 23:19:23,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:23,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1986709928, now seen corresponding path program 1 times [2023-11-24 23:19:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:23,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399473041] [2023-11-24 23:19:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:23,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:23,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:23,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399473041] [2023-11-24 23:19:23,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399473041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:23,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:23,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:19:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384142793] [2023-11-24 23:19:23,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:23,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:19:23,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:23,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:19:23,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:19:23,999 INFO L87 Difference]: Start difference. First operand 624 states and 1463 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-11-24 23:19:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:24,173 INFO L93 Difference]: Finished difference Result 639 states and 1497 transitions. [2023-11-24 23:19:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:19:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-11-24 23:19:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:24,179 INFO L225 Difference]: With dead ends: 639 [2023-11-24 23:19:24,179 INFO L226 Difference]: Without dead ends: 639 [2023-11-24 23:19:24,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:19:24,181 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:24,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:19:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2023-11-24 23:19:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2023-11-24 23:19:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 627 states have (on average 2.38755980861244) internal successors, (1497), 638 states have internal predecessors, (1497), 0 states have call successors, (0), 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-11-24 23:19:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1497 transitions. [2023-11-24 23:19:24,229 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1497 transitions. Word has length 15 [2023-11-24 23:19:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:24,230 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 1497 transitions. [2023-11-24 23:19:24,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-11-24 23:19:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1497 transitions. [2023-11-24 23:19:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:19:24,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:24,232 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:24,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 23:19:24,232 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:24,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash -590532740, now seen corresponding path program 1 times [2023-11-24 23:19:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609835940] [2023-11-24 23:19:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:24,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:24,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609835940] [2023-11-24 23:19:24,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609835940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:24,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:24,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:19:24,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313453337] [2023-11-24 23:19:24,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:24,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:19:24,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:24,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:19:24,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:19:24,688 INFO L87 Difference]: Start difference. First operand 639 states and 1497 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-24 23:19:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:24,904 INFO L93 Difference]: Finished difference Result 745 states and 1744 transitions. [2023-11-24 23:19:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:19:24,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-24 23:19:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:24,911 INFO L225 Difference]: With dead ends: 745 [2023-11-24 23:19:24,911 INFO L226 Difference]: Without dead ends: 745 [2023-11-24 23:19:24,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:19:24,914 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:24,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:19:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-11-24 23:19:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 669. [2023-11-24 23:19:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 657 states have (on average 2.385083713850837) internal successors, (1567), 668 states have internal predecessors, (1567), 0 states have call successors, (0), 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-11-24 23:19:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1567 transitions. [2023-11-24 23:19:24,947 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1567 transitions. Word has length 16 [2023-11-24 23:19:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:24,948 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 1567 transitions. [2023-11-24 23:19:24,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-24 23:19:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1567 transitions. [2023-11-24 23:19:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-24 23:19:24,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:24,950 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:24,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 23:19:24,950 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:24,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1150868502, now seen corresponding path program 2 times [2023-11-24 23:19:24,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:24,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891656593] [2023-11-24 23:19:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:24,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:25,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:25,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891656593] [2023-11-24 23:19:25,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891656593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:19:25,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:19:25,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 23:19:25,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848260820] [2023-11-24 23:19:25,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:19:25,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 23:19:25,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:25,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 23:19:25,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:19:25,421 INFO L87 Difference]: Start difference. First operand 669 states and 1567 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-24 23:19:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:25,675 INFO L93 Difference]: Finished difference Result 669 states and 1552 transitions. [2023-11-24 23:19:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 23:19:25,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-24 23:19:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:25,681 INFO L225 Difference]: With dead ends: 669 [2023-11-24 23:19:25,682 INFO L226 Difference]: Without dead ends: 669 [2023-11-24 23:19:25,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:19:25,683 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:25,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:19:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2023-11-24 23:19:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 624. [2023-11-24 23:19:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 612 states have (on average 2.3643790849673203) internal successors, (1447), 623 states have internal predecessors, (1447), 0 states have call successors, (0), 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-11-24 23:19:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1447 transitions. [2023-11-24 23:19:25,709 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1447 transitions. Word has length 16 [2023-11-24 23:19:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:25,710 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 1447 transitions. [2023-11-24 23:19:25,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-11-24 23:19:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1447 transitions. [2023-11-24 23:19:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-24 23:19:25,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:25,712 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:25,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 23:19:25,712 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:25,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash -429872346, now seen corresponding path program 1 times [2023-11-24 23:19:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:25,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023839963] [2023-11-24 23:19:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:26,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:26,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023839963] [2023-11-24 23:19:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023839963] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:19:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054093069] [2023-11-24 23:19:26,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:26,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:19:26,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:19:26,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:19:26,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:19:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:26,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-24 23:19:26,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:19:26,951 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-11-24 23:19:27,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 25 treesize of output 13 [2023-11-24 23:19:27,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:19:27,106 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 18 treesize of output 13 [2023-11-24 23:19:27,201 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 26 treesize of output 20 [2023-11-24 23:19:27,210 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 30 treesize of output 22 [2023-11-24 23:19:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:27,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:19:27,536 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 Int) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_272 Int)) (or (< (+ v_ArrVal_272 2147483648) 0) (< 0 (+ (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_269)) |c_~#stored_elements~0.base| v_ArrVal_271) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_272)) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2023-11-24 23:19:27,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:19:27,604 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 2 case distinctions, treesize of input 60 treesize of output 51 [2023-11-24 23:19:27,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:19:27,627 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 65 treesize of output 67 [2023-11-24 23:19:27,643 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 36 treesize of output 24 [2023-11-24 23:19:27,659 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 9 treesize of output 5 [2023-11-24 23:19:27,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:19:27,684 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 49 treesize of output 51 [2023-11-24 23:19:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054093069] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:19:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1422347917] [2023-11-24 23:19:29,888 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-11-24 23:19:29,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:19:29,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2023-11-24 23:19:29,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372968796] [2023-11-24 23:19:29,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:19:29,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-24 23:19:29,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:29,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-24 23:19:29,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=293, Unknown=5, NotChecked=36, Total=420 [2023-11-24 23:19:29,895 INFO L87 Difference]: Start difference. First operand 624 states and 1447 transitions. Second operand has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 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-11-24 23:19:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:30,924 INFO L93 Difference]: Finished difference Result 1338 states and 3122 transitions. [2023-11-24 23:19:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 23:19:30,925 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 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-11-24 23:19:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:30,936 INFO L225 Difference]: With dead ends: 1338 [2023-11-24 23:19:30,936 INFO L226 Difference]: Without dead ends: 1338 [2023-11-24 23:19:30,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=177, Invalid=524, Unknown=5, NotChecked=50, Total=756 [2023-11-24 23:19:30,938 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 313 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:30,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 276 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 574 Invalid, 0 Unknown, 195 Unchecked, 0.7s Time] [2023-11-24 23:19:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2023-11-24 23:19:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 833. [2023-11-24 23:19:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 821 states have (on average 2.459196102314251) internal successors, (2019), 832 states have internal predecessors, (2019), 0 states have call successors, (0), 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-11-24 23:19:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2019 transitions. [2023-11-24 23:19:30,997 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2019 transitions. Word has length 17 [2023-11-24 23:19:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:30,999 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 2019 transitions. [2023-11-24 23:19:31,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 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-11-24 23:19:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2019 transitions. [2023-11-24 23:19:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 23:19:31,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:31,001 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:31,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:19:31,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-24 23:19:31,210 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:31,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2118827658, now seen corresponding path program 1 times [2023-11-24 23:19:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567556310] [2023-11-24 23:19:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:32,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:32,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567556310] [2023-11-24 23:19:32,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567556310] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:19:32,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740011070] [2023-11-24 23:19:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:32,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:19:32,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:19:32,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:19:32,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:19:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:32,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-24 23:19:32,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:19:32,352 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-24 23:19:32,353 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-11-24 23:19:32,560 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-11-24 23:19:32,647 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 18 treesize of output 13 [2023-11-24 23:19:32,725 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 25 treesize of output 13 [2023-11-24 23:19:32,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:19:32,769 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 18 treesize of output 13 [2023-11-24 23:19:32,849 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 26 treesize of output 20 [2023-11-24 23:19:32,856 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 30 treesize of output 22 [2023-11-24 23:19:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:32,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:19:33,082 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 Int) (v_ArrVal_334 (Array Int Int)) (v_ArrVal_336 Int)) (or (< (+ v_ArrVal_336 2147483648) 0) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_332)) |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) v_ArrVal_336)) (+ 1608 |c_~#queue~0.offset|)))))) is different from false [2023-11-24 23:19:33,117 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_332 Int) (v_ArrVal_331 (Array Int Int)) (v_ArrVal_334 (Array Int Int)) (v_ArrVal_336 Int)) (or (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_331))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_332))) |c_~#stored_elements~0.base| v_ArrVal_334) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_336)) (+ 1608 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_336 2147483648) 0))) is different from false [2023-11-24 23:19:33,202 INFO L349 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2023-11-24 23:19:33,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2582 treesize of output 2260 [2023-11-24 23:19:33,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:19:33,259 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 263 treesize of output 255 [2023-11-24 23:19:33,309 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 419 treesize of output 367 [2023-11-24 23:19:33,353 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 162 treesize of output 114 [2023-11-24 23:19:33,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-24 23:19:33,507 INFO L349 Elim1Store]: treesize reduction 34, result has 54.7 percent of original size [2023-11-24 23:19:33,508 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 4 case distinctions, treesize of input 262 treesize of output 281 [2023-11-24 23:19:35,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:19:35,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 57 [2023-11-24 23:19:35,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 23:19:35,205 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 516 treesize of output 458 [2023-11-24 23:19:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:35,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740011070] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:19:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924005506] [2023-11-24 23:19:35,571 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-11-24 23:19:35,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:19:35,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-11-24 23:19:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856334528] [2023-11-24 23:19:35,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:19:35,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-24 23:19:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:35,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-24 23:19:35,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=405, Unknown=6, NotChecked=86, Total=600 [2023-11-24 23:19:35,574 INFO L87 Difference]: Start difference. First operand 833 states and 2019 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 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-11-24 23:19:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:36,773 INFO L93 Difference]: Finished difference Result 1126 states and 2689 transitions. [2023-11-24 23:19:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-24 23:19:36,774 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-24 23:19:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:36,782 INFO L225 Difference]: With dead ends: 1126 [2023-11-24 23:19:36,782 INFO L226 Difference]: Without dead ends: 1126 [2023-11-24 23:19:36,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=746, Unknown=6, NotChecked=122, Total=1122 [2023-11-24 23:19:36,783 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 562 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:36,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 273 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 580 Invalid, 0 Unknown, 358 Unchecked, 0.7s Time] [2023-11-24 23:19:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2023-11-24 23:19:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 608. [2023-11-24 23:19:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 597 states have (on average 2.3618090452261304) internal successors, (1410), 607 states have internal predecessors, (1410), 0 states have call successors, (0), 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-11-24 23:19:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1410 transitions. [2023-11-24 23:19:36,809 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1410 transitions. Word has length 18 [2023-11-24 23:19:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:36,810 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 1410 transitions. [2023-11-24 23:19:36,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 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-11-24 23:19:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1410 transitions. [2023-11-24 23:19:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 23:19:36,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:36,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:36,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:19:37,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-24 23:19:37,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:37,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash -441140196, now seen corresponding path program 1 times [2023-11-24 23:19:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913090439] [2023-11-24 23:19:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:37,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:37,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:37,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913090439] [2023-11-24 23:19:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913090439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:19:37,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858429301] [2023-11-24 23:19:37,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:37,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:19:37,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:19:37,729 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:19:37,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:19:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:37,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-24 23:19:37,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:19:37,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:19:37,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:19:37,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:19:37,913 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-11-24 23:19:37,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-24 23:19:37,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:19:37,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 23:19:38,024 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 43 treesize of output 34 [2023-11-24 23:19:38,101 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 51 treesize of output 42 [2023-11-24 23:19:38,258 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 49 [2023-11-24 23:19:38,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:19:38,316 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 53 treesize of output 38 [2023-11-24 23:19:38,397 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 61 treesize of output 45 [2023-11-24 23:19:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:38,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:19:38,542 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_396 (Array Int Int))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_395) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_397)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-11-24 23:19:38,571 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_395) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_397)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-24 23:19:38,594 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_392 Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_395) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_392) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_392) .cse1 v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_397)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-24 23:19:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 23:19:42,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858429301] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:19:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [572308132] [2023-11-24 23:19:42,905 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-11-24 23:19:42,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:19:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-11-24 23:19:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594374458] [2023-11-24 23:19:42,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:19:42,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-24 23:19:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-24 23:19:42,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=245, Unknown=6, NotChecked=108, Total=462 [2023-11-24 23:19:42,909 INFO L87 Difference]: Start difference. First operand 608 states and 1410 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-24 23:19:43,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_397 Int)) (< (select (store .cse0 .cse1 v_ArrVal_397) .cse2) 2147483647)) (forall ((v_ArrVal_397 Int) (v_ArrVal_396 (Array Int Int))) (< (select (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) v_ArrVal_397)) .cse2) 2147483647)) (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ (select .cse5 .cse6) 1) v_ArrVal_395) (< (select (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_397)) .cse2) 2147483647)))) (forall ((v_ArrVal_397 Int) (v_ArrVal_395 Int) (v_ArrVal_392 Int) (v_ArrVal_390 Int) (v_ArrVal_396 (Array Int Int))) (let ((.cse8 (store .cse0 .cse1 v_ArrVal_390))) (or (< (+ (select .cse8 .cse4) 1) v_ArrVal_395) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse8 .cse2 v_ArrVal_392) .cse4 v_ArrVal_395)) |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse4)) |c_~#queue~0.offset|) v_ArrVal_397)) .cse2) 2147483647) (< (+ (select .cse8 .cse2) 1) v_ArrVal_392))))))) is different from false [2023-11-24 23:19:43,539 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_397 Int)) (< (select (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_397)) .cse2) 2147483647)) (forall ((v_ArrVal_397 Int) (v_ArrVal_396 (Array Int Int))) (< (select (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_396) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse1)) |c_~#queue~0.offset|) v_ArrVal_397)) .cse2) 2147483647)))) is different from false [2023-11-24 23:19:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:43,736 INFO L93 Difference]: Finished difference Result 717 states and 1662 transitions. [2023-11-24 23:19:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 23:19:43,737 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-24 23:19:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:43,743 INFO L225 Difference]: With dead ends: 717 [2023-11-24 23:19:43,743 INFO L226 Difference]: Without dead ends: 717 [2023-11-24 23:19:43,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=146, Invalid=328, Unknown=8, NotChecked=220, Total=702 [2023-11-24 23:19:43,744 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 491 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:43,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 221 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 392 Invalid, 2 Unknown, 491 Unchecked, 0.6s Time] [2023-11-24 23:19:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2023-11-24 23:19:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 650. [2023-11-24 23:19:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 639 states have (on average 2.3646322378716746) internal successors, (1511), 649 states have internal predecessors, (1511), 0 states have call successors, (0), 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-11-24 23:19:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1511 transitions. [2023-11-24 23:19:43,769 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1511 transitions. Word has length 18 [2023-11-24 23:19:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:43,770 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 1511 transitions. [2023-11-24 23:19:43,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-24 23:19:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1511 transitions. [2023-11-24 23:19:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 23:19:43,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:43,772 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:43,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:19:43,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-24 23:19:43,979 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:43,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2052888008, now seen corresponding path program 1 times [2023-11-24 23:19:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:43,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018672290] [2023-11-24 23:19:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:44,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:44,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018672290] [2023-11-24 23:19:44,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018672290] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:19:44,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672869419] [2023-11-24 23:19:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:44,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:19:44,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:19:44,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:19:44,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:19:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:45,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-24 23:19:45,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:19:45,149 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-24 23:19:45,150 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-11-24 23:19:45,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:19:45,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:19:45,175 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-11-24 23:19:45,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-24 23:19:45,227 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 24 treesize of output 19 [2023-11-24 23:19:45,311 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 43 treesize of output 34 [2023-11-24 23:19:45,385 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 51 treesize of output 42 [2023-11-24 23:19:45,549 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 49 [2023-11-24 23:19:45,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:19:45,609 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 53 treesize of output 38 [2023-11-24 23:19:45,699 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 61 treesize of output 45 [2023-11-24 23:19:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:45,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:19:45,810 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 Int) (v_ArrVal_464 (Array Int Int))) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_465)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)) is different from false [2023-11-24 23:19:45,827 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_464 (Array Int Int))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_465)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_463))) is different from false [2023-11-24 23:19:45,940 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_460 Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_460) (< (+ (select .cse0 .cse1) 1) v_ArrVal_463) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_460) .cse1 v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_465)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-24 23:19:50,189 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_460 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_458 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_457))) (let ((.cse0 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) v_ArrVal_458))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_463) (< (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_460) .cse1 v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_465)) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_460))))) is different from false [2023-11-24 23:19:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 23:19:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672869419] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:19:50,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1673915356] [2023-11-24 23:19:50,211 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-11-24 23:19:50,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:19:50,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-11-24 23:19:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629823679] [2023-11-24 23:19:50,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:19:50,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-24 23:19:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:50,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-24 23:19:50,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=294, Unknown=10, NotChecked=164, Total=600 [2023-11-24 23:19:50,215 INFO L87 Difference]: Start difference. First operand 650 states and 1511 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-24 23:19:50,816 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_460 Int) (v_ArrVal_464 (Array Int Int)) (v_ArrVal_458 Int)) (let ((.cse0 (store .cse4 .cse5 v_ArrVal_458))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_460) (< (+ (select .cse0 .cse2) 1) v_ArrVal_463) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_460) .cse2 v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_465)) .cse1) 2147483647)))) (forall ((v_ArrVal_465 Int) (v_ArrVal_463 Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_463)) |c_~#stored_elements~0.base| v_ArrVal_464) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_465)) .cse1) 2147483647) (< (+ (select .cse7 .cse8) 1) v_ArrVal_463)))) (forall ((v_ArrVal_465 Int)) (< (select (store .cse4 .cse5 v_ArrVal_465) .cse1) 2147483647))))) is different from false [2023-11-24 23:19:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:19:51,261 INFO L93 Difference]: Finished difference Result 1264 states and 2962 transitions. [2023-11-24 23:19:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 23:19:51,262 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 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 19 [2023-11-24 23:19:51,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:19:51,271 INFO L225 Difference]: With dead ends: 1264 [2023-11-24 23:19:51,271 INFO L226 Difference]: Without dead ends: 1264 [2023-11-24 23:19:51,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=161, Invalid=354, Unknown=11, NotChecked=230, Total=756 [2023-11-24 23:19:51,272 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 264 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1496 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-24 23:19:51,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 393 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 600 Invalid, 0 Unknown, 1496 Unchecked, 0.8s Time] [2023-11-24 23:19:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2023-11-24 23:19:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 920. [2023-11-24 23:19:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 909 states have (on average 2.4576457645764576) internal successors, (2234), 919 states have internal predecessors, (2234), 0 states have call successors, (0), 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-11-24 23:19:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2234 transitions. [2023-11-24 23:19:51,312 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2234 transitions. Word has length 19 [2023-11-24 23:19:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:19:51,312 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 2234 transitions. [2023-11-24 23:19:51,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-24 23:19:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2234 transitions. [2023-11-24 23:19:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-24 23:19:51,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:19:51,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:19:51,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:19:51,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:19:51,520 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-24 23:19:51,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:19:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1259148600, now seen corresponding path program 2 times [2023-11-24 23:19:51,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:19:51,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251779957] [2023-11-24 23:19:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:19:51,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:19:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:19:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:52,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:19:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251779957] [2023-11-24 23:19:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251779957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:19:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221466856] [2023-11-24 23:19:52,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-24 23:19:52,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:19:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:19:52,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:19:52,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_771e4b1c-2d1a-44af-af9c-84ad7b6f2b2e/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:19:52,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-24 23:19:52,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 23:19:52,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-24 23:19:52,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:19:52,566 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-24 23:19:52,566 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-11-24 23:19:52,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:19:52,577 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 23:19:52,590 INFO L349 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2023-11-24 23:19:52,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-11-24 23:19:52,702 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 43 treesize of output 34 [2023-11-24 23:19:52,783 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 51 treesize of output 42 [2023-11-24 23:19:52,934 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 49 treesize of output 36 [2023-11-24 23:19:53,027 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 49 [2023-11-24 23:19:53,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:19:53,089 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 53 treesize of output 38 [2023-11-24 23:19:53,171 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 61 treesize of output 45 [2023-11-24 23:19:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:19:53,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:19:53,337 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_531 Int) (v_ArrVal_532 (Array Int Int))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_531) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_531)) |c_~#stored_elements~0.base| v_ArrVal_532) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_533)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-11-24 23:19:53,364 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_531 Int) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_531) (< (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_529))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_531))) |c_~#stored_elements~0.base| v_ArrVal_532) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_533)) (+ 1608 |c_~#queue~0.offset|)) 2147483647))) is different from false [2023-11-24 23:19:53,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_531 Int) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_529))) (store .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse1 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2 v_ArrVal_531))) |c_~#stored_elements~0.base| v_ArrVal_532) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) v_ArrVal_533)) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse2) 1) v_ArrVal_531)))) is different from false [2023-11-24 23:19:53,411 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_531 Int) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_527 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_527) (< (+ (select .cse0 .cse1) 1) v_ArrVal_531) (< (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_529) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_527)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_529) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse1 v_ArrVal_531)) |c_~#stored_elements~0.base| v_ArrVal_532) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) v_ArrVal_533)) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-24 23:19:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 23:19:57,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221466856] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 23:19:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [796463506] [2023-11-24 23:19:57,646 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-11-24 23:19:57,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 23:19:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2023-11-24 23:19:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979445735] [2023-11-24 23:19:57,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 23:19:57,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-24 23:19:57,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:19:57,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-24 23:19:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=313, Unknown=7, NotChecked=164, Total=600 [2023-11-24 23:19:57,650 INFO L87 Difference]: Start difference. First operand 920 states and 2234 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 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-11-24 23:20:00,091 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-11-24 23:20:02,098 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-11-24 23:20:04,106 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]