./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a0165632 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_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje --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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:55:53,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:55:53,529 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-09 06:55:53,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:55:53,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:55:53,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:55:53,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:55:53,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:55:53,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:55:53,583 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:55:53,583 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:55:53,584 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:55:53,585 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:55:53,585 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:55:53,585 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:55:53,586 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:55:53,586 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:55:53,587 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:55:53,587 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:55:53,588 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:55:53,588 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:55:53,589 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:55:53,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:55:53,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:55:53,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:55:53,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:55:53,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:55:53,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:55:53,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:55:53,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:55:53,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:55:53,597 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:55:53,612 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 06:55:53,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:55:53,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:55:53,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:55:53,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:55:53,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:55:53,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:55:53,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:55:53,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:55:53,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:55:53,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:55:53,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:55:53,618 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:55:53,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:55:53,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:55:53,620 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:55:53,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:55:53,620 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_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/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_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2024-11-09 06:55:53,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:55:54,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:55:54,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:55:54,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:55:54,012 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:55:54,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/pthread/queue_longer.i Unable to find full path for "g++" [2024-11-09 06:55:56,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:55:56,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:55:56,557 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/sv-benchmarks/c/pthread/queue_longer.i [2024-11-09 06:55:56,585 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/data/056ca1f61/9f3faf42270744c791769f85002e96e7/FLAGf98006c10 [2024-11-09 06:55:56,792 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/data/056ca1f61/9f3faf42270744c791769f85002e96e7 [2024-11-09 06:55:56,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:55:56,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:55:56,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:56,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:55:56,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:55:56,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:56" (1/1) ... [2024-11-09 06:55:56,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e05d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:56, skipping insertion in model container [2024-11-09 06:55:56,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:56" (1/1) ... [2024-11-09 06:55:56,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:55:57,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:57,630 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:55:57,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:57,950 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:55:57,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57 WrapperNode [2024-11-09 06:55:57,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:57,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:57,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:55:57,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:55:57,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,122 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1062 [2024-11-09 06:55:58,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:58,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:55:58,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:55:58,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:55:58,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:55:58,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:55:58,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:55:58,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:55:58,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (1/1) ... [2024-11-09 06:55:58,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:55:58,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:55:58,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:55:58,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:55:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 06:55:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 06:55:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 06:55:58,374 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 06:55:58,375 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:55:58,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:55:58,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:55:58,377 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:55:58,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:55:58,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:55:58,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:55:58,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:55:58,380 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:55:58,581 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:55:58,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:56:00,463 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:56:00,465 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:56:10,220 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:56:10,224 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:56:10,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:56:10 BoogieIcfgContainer [2024-11-09 06:56:10,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:56:10,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:56:10,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:56:10,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:56:10,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:55:56" (1/3) ... [2024-11-09 06:56:10,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26850f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:56:10, skipping insertion in model container [2024-11-09 06:56:10,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:57" (2/3) ... [2024-11-09 06:56:10,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26850f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:56:10, skipping insertion in model container [2024-11-09 06:56:10,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:56:10" (3/3) ... [2024-11-09 06:56:10,246 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-09 06:56:10,269 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:56:10,272 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-11-09 06:56:10,273 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:56:10,654 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 06:56:10,705 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 89 transitions, 192 flow [2024-11-09 06:56:10,908 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2308 states, 2218 states have (on average 2.8259693417493237) internal successors, (6268), 2307 states have internal predecessors, (6268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:10,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:56:10,948 INFO L333 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, 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;@39fb7ae3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:56:10,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2024-11-09 06:56:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 2308 states, 2218 states have (on average 2.8259693417493237) internal successors, (6268), 2307 states have internal predecessors, (6268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 06:56:10,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:10,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 06:56:10,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:10,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash -666629363, now seen corresponding path program 1 times [2024-11-09 06:56:10,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:10,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335301037] [2024-11-09 06:56:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:10,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:13,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:13,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335301037] [2024-11-09 06:56:13,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335301037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:13,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:13,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:13,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579892928] [2024-11-09 06:56:13,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:13,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:13,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:13,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:13,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:13,697 INFO L87 Difference]: Start difference. First operand has 2308 states, 2218 states have (on average 2.8259693417493237) internal successors, (6268), 2307 states have internal predecessors, (6268), 0 states have call successors, (0), 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.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:14,176 INFO L93 Difference]: Finished difference Result 2662 states and 7180 transitions. [2024-11-09 06:56:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:14,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 06:56:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:14,225 INFO L225 Difference]: With dead ends: 2662 [2024-11-09 06:56:14,225 INFO L226 Difference]: Without dead ends: 2498 [2024-11-09 06:56:14,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:14,239 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 54 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:14,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 131 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:56:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2024-11-09 06:56:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2452. [2024-11-09 06:56:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2356 states have (on average 2.8017826825127337) internal successors, (6601), 2451 states have internal predecessors, (6601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 6601 transitions. [2024-11-09 06:56:14,562 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 6601 transitions. Word has length 6 [2024-11-09 06:56:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:14,563 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 6601 transitions. [2024-11-09 06:56:14,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 6601 transitions. [2024-11-09 06:56:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:56:14,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:14,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:14,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:56:14,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:14,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 809328587, now seen corresponding path program 1 times [2024-11-09 06:56:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121618320] [2024-11-09 06:56:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:15,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:15,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121618320] [2024-11-09 06:56:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121618320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:15,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:15,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019416006] [2024-11-09 06:56:15,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:15,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:15,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:15,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:15,915 INFO L87 Difference]: Start difference. First operand 2452 states and 6601 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:16,326 INFO L93 Difference]: Finished difference Result 2612 states and 7055 transitions. [2024-11-09 06:56:16,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:56:16,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-09 06:56:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:16,348 INFO L225 Difference]: With dead ends: 2612 [2024-11-09 06:56:16,349 INFO L226 Difference]: Without dead ends: 2562 [2024-11-09 06:56:16,352 INFO L431 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 [2024-11-09 06:56:16,354 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:16,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 145 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:56:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2024-11-09 06:56:16,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2494. [2024-11-09 06:56:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2398 states have (on average 2.799416180150125) internal successors, (6713), 2493 states have internal predecessors, (6713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 6713 transitions. [2024-11-09 06:56:16,462 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 6713 transitions. Word has length 7 [2024-11-09 06:56:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:16,463 INFO L471 AbstractCegarLoop]: Abstraction has 2494 states and 6713 transitions. [2024-11-09 06:56:16,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 6713 transitions. [2024-11-09 06:56:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:56:16,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:16,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:16,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:56:16,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:16,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash 375767086, now seen corresponding path program 1 times [2024-11-09 06:56:16,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:16,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205485994] [2024-11-09 06:56:16,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:16,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:17,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:17,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205485994] [2024-11-09 06:56:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205485994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:17,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:17,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284713680] [2024-11-09 06:56:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:17,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:56:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:56:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:17,633 INFO L87 Difference]: Start difference. First operand 2494 states and 6713 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) [2024-11-09 06:56:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:18,180 INFO L93 Difference]: Finished difference Result 2848 states and 7744 transitions. [2024-11-09 06:56:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:56:18,180 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 [2024-11-09 06:56:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:18,205 INFO L225 Difference]: With dead ends: 2848 [2024-11-09 06:56:18,205 INFO L226 Difference]: Without dead ends: 2748 [2024-11-09 06:56:18,209 INFO L431 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 [2024-11-09 06:56:18,212 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 121 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:18,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 227 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:56:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2024-11-09 06:56:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2680. [2024-11-09 06:56:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2584 states have (on average 2.8010835913312695) internal successors, (7238), 2679 states have internal predecessors, (7238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 7238 transitions. [2024-11-09 06:56:18,401 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 7238 transitions. Word has length 9 [2024-11-09 06:56:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:18,402 INFO L471 AbstractCegarLoop]: Abstraction has 2680 states and 7238 transitions. [2024-11-09 06:56:18,402 INFO L472 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) [2024-11-09 06:56:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 7238 transitions. [2024-11-09 06:56:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:56:18,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:18,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:18,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:56:18,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:18,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:18,407 INFO L85 PathProgramCache]: Analyzing trace with hash 114417956, now seen corresponding path program 1 times [2024-11-09 06:56:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:18,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163819223] [2024-11-09 06:56:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:18,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:18,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163819223] [2024-11-09 06:56:18,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163819223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:18,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:18,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:18,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593855350] [2024-11-09 06:56:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:18,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:18,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:18,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:18,817 INFO L87 Difference]: Start difference. First operand 2680 states and 7238 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) [2024-11-09 06:56:19,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:19,085 INFO L93 Difference]: Finished difference Result 5021 states and 13589 transitions. [2024-11-09 06:56:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:19,086 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 [2024-11-09 06:56:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:19,108 INFO L225 Difference]: With dead ends: 5021 [2024-11-09 06:56:19,108 INFO L226 Difference]: Without dead ends: 2668 [2024-11-09 06:56:19,115 INFO L431 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 [2024-11-09 06:56:19,118 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 58 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:19,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 70 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:56:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2024-11-09 06:56:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2454. [2024-11-09 06:56:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2454 states, 2390 states have (on average 2.810878661087866) internal successors, (6718), 2453 states have internal predecessors, (6718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2454 states and 6718 transitions. [2024-11-09 06:56:19,232 INFO L78 Accepts]: Start accepts. Automaton has 2454 states and 6718 transitions. Word has length 11 [2024-11-09 06:56:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:19,233 INFO L471 AbstractCegarLoop]: Abstraction has 2454 states and 6718 transitions. [2024-11-09 06:56:19,233 INFO L472 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) [2024-11-09 06:56:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 6718 transitions. [2024-11-09 06:56:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:56:19,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:19,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:19,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:56:19,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:19,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:19,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1713448281, now seen corresponding path program 1 times [2024-11-09 06:56:19,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:19,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490329916] [2024-11-09 06:56:19,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:19,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:19,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:19,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490329916] [2024-11-09 06:56:19,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490329916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:19,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123692135] [2024-11-09 06:56:19,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:19,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:19,521 INFO L87 Difference]: Start difference. First operand 2454 states and 6718 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:20,039 INFO L93 Difference]: Finished difference Result 4624 states and 12768 transitions. [2024-11-09 06:56:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:20,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:56:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:20,073 INFO L225 Difference]: With dead ends: 4624 [2024-11-09 06:56:20,074 INFO L226 Difference]: Without dead ends: 4302 [2024-11-09 06:56:20,077 INFO L431 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 [2024-11-09 06:56:20,078 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 113 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:20,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 165 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:56:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4302 states. [2024-11-09 06:56:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4302 to 4074. [2024-11-09 06:56:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4074 states, 4010 states have (on average 2.8124688279301746) internal successors, (11278), 4073 states have internal predecessors, (11278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 11278 transitions. [2024-11-09 06:56:20,335 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 11278 transitions. Word has length 13 [2024-11-09 06:56:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:20,336 INFO L471 AbstractCegarLoop]: Abstraction has 4074 states and 11278 transitions. [2024-11-09 06:56:20,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 11278 transitions. [2024-11-09 06:56:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:56:20,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:20,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:20,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:56:20,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash -616648967, now seen corresponding path program 1 times [2024-11-09 06:56:20,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:20,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597388042] [2024-11-09 06:56:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:20,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:21,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:21,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597388042] [2024-11-09 06:56:21,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597388042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:56:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856364381] [2024-11-09 06:56:21,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:21,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:56:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:56:21,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:21,395 INFO L87 Difference]: Start difference. First operand 4074 states and 11278 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:21,960 INFO L93 Difference]: Finished difference Result 7882 states and 21862 transitions. [2024-11-09 06:56:21,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:56:21,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 [2024-11-09 06:56:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:22,023 INFO L225 Difference]: With dead ends: 7882 [2024-11-09 06:56:22,026 INFO L226 Difference]: Without dead ends: 4194 [2024-11-09 06:56:22,036 INFO L431 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 [2024-11-09 06:56:22,037 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 102 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:22,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 190 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:56:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2024-11-09 06:56:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 4074. [2024-11-09 06:56:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4074 states, 4010 states have (on average 2.800498753117207) internal successors, (11230), 4073 states have internal predecessors, (11230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4074 states to 4074 states and 11230 transitions. [2024-11-09 06:56:22,225 INFO L78 Accepts]: Start accepts. Automaton has 4074 states and 11230 transitions. Word has length 19 [2024-11-09 06:56:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:22,226 INFO L471 AbstractCegarLoop]: Abstraction has 4074 states and 11230 transitions. [2024-11-09 06:56:22,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4074 states and 11230 transitions. [2024-11-09 06:56:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:56:22,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:22,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:22,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:56:22,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:22,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1257950647, now seen corresponding path program 1 times [2024-11-09 06:56:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:22,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600366286] [2024-11-09 06:56:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:26,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:26,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600366286] [2024-11-09 06:56:26,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600366286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:26,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:26,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:56:26,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307790746] [2024-11-09 06:56:26,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:26,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:56:26,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:26,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:56:26,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:56:26,961 INFO L87 Difference]: Start difference. First operand 4074 states and 11230 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:27,939 INFO L93 Difference]: Finished difference Result 4689 states and 12854 transitions. [2024-11-09 06:56:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:56:27,940 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 06:56:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:27,973 INFO L225 Difference]: With dead ends: 4689 [2024-11-09 06:56:27,974 INFO L226 Difference]: Without dead ends: 4641 [2024-11-09 06:56:27,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:56:27,977 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 186 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:27,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 466 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:56:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2024-11-09 06:56:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 4400. [2024-11-09 06:56:28,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4400 states, 4336 states have (on average 2.8201107011070112) internal successors, (12228), 4399 states have internal predecessors, (12228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 12228 transitions. [2024-11-09 06:56:28,251 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 12228 transitions. Word has length 21 [2024-11-09 06:56:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:28,252 INFO L471 AbstractCegarLoop]: Abstraction has 4400 states and 12228 transitions. [2024-11-09 06:56:28,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 12228 transitions. [2024-11-09 06:56:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:56:28,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:28,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:28,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:56:28,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:28,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:28,257 INFO L85 PathProgramCache]: Analyzing trace with hash 341766783, now seen corresponding path program 1 times [2024-11-09 06:56:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:28,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528531226] [2024-11-09 06:56:28,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:32,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528531226] [2024-11-09 06:56:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528531226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:56:32,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872495521] [2024-11-09 06:56:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:32,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:56:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:32,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:56:32,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:56:32,709 INFO L87 Difference]: Start difference. First operand 4400 states and 12228 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:33,614 INFO L93 Difference]: Finished difference Result 4641 states and 12733 transitions. [2024-11-09 06:56:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:56:33,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 06:56:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:33,654 INFO L225 Difference]: With dead ends: 4641 [2024-11-09 06:56:33,655 INFO L226 Difference]: Without dead ends: 4593 [2024-11-09 06:56:33,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:56:33,660 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 273 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:33,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 306 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:56:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2024-11-09 06:56:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4420. [2024-11-09 06:56:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4420 states, 4356 states have (on average 2.819329660238751) internal successors, (12281), 4419 states have internal predecessors, (12281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 12281 transitions. [2024-11-09 06:56:33,944 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 12281 transitions. Word has length 22 [2024-11-09 06:56:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:33,945 INFO L471 AbstractCegarLoop]: Abstraction has 4420 states and 12281 transitions. [2024-11-09 06:56:33,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 12281 transitions. [2024-11-09 06:56:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:56:33,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:33,947 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:33,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:56:33,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:33,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash 443557662, now seen corresponding path program 1 times [2024-11-09 06:56:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:33,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935520849] [2024-11-09 06:56:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:34,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935520849] [2024-11-09 06:56:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935520849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:34,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142882116] [2024-11-09 06:56:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:34,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:34,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:56:34,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:56:34,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:56:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:34,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 06:56:34,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:34,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:56:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142882116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:34,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:56:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 06:56:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396502668] [2024-11-09 06:56:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:34,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:56:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:34,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:56:34,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:56:34,982 INFO L87 Difference]: Start difference. First operand 4420 states and 12281 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:35,890 INFO L93 Difference]: Finished difference Result 4648 states and 12645 transitions. [2024-11-09 06:56:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:56:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 06:56:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:35,926 INFO L225 Difference]: With dead ends: 4648 [2024-11-09 06:56:35,926 INFO L226 Difference]: Without dead ends: 4541 [2024-11-09 06:56:35,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:56:35,930 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 230 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:35,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 386 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:56:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2024-11-09 06:56:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 4313. [2024-11-09 06:56:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4313 states, 4259 states have (on average 2.8032401972293965) internal successors, (11939), 4312 states have internal predecessors, (11939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 11939 transitions. [2024-11-09 06:56:36,197 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 11939 transitions. Word has length 22 [2024-11-09 06:56:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:36,199 INFO L471 AbstractCegarLoop]: Abstraction has 4313 states and 11939 transitions. [2024-11-09 06:56:36,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 11939 transitions. [2024-11-09 06:56:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:56:36,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:36,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:36,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:56:36,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:36,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:36,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2004806298, now seen corresponding path program 1 times [2024-11-09 06:56:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:36,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292643524] [2024-11-09 06:56:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:36,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:36,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292643524] [2024-11-09 06:56:36,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292643524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:36,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:36,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:36,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067053782] [2024-11-09 06:56:36,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:36,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:36,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:36,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:36,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:36,742 INFO L87 Difference]: Start difference. First operand 4313 states and 11939 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:37,269 INFO L93 Difference]: Finished difference Result 6077 states and 16691 transitions. [2024-11-09 06:56:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:37,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 06:56:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:37,314 INFO L225 Difference]: With dead ends: 6077 [2024-11-09 06:56:37,315 INFO L226 Difference]: Without dead ends: 5603 [2024-11-09 06:56:37,319 INFO L431 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 [2024-11-09 06:56:37,320 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 73 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:37,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 121 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:56:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2024-11-09 06:56:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 5511. [2024-11-09 06:56:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5511 states, 5457 states have (on average 2.79036100421477) internal successors, (15227), 5510 states have internal predecessors, (15227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5511 states to 5511 states and 15227 transitions. [2024-11-09 06:56:37,648 INFO L78 Accepts]: Start accepts. Automaton has 5511 states and 15227 transitions. Word has length 23 [2024-11-09 06:56:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 5511 states and 15227 transitions. [2024-11-09 06:56:37,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5511 states and 15227 transitions. [2024-11-09 06:56:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 06:56:37,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:37,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:37,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:56:37,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:37,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:37,701 INFO L85 PathProgramCache]: Analyzing trace with hash 865388061, now seen corresponding path program 1 times [2024-11-09 06:56:37,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:37,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635442428] [2024-11-09 06:56:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:56:37,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635442428] [2024-11-09 06:56:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635442428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:37,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:37,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:37,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24801714] [2024-11-09 06:56:37,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:37,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:37,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:37,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:37,892 INFO L87 Difference]: Start difference. First operand 5511 states and 15227 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:38,382 INFO L93 Difference]: Finished difference Result 5791 states and 15823 transitions. [2024-11-09 06:56:38,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:38,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 06:56:38,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:38,415 INFO L225 Difference]: With dead ends: 5791 [2024-11-09 06:56:38,415 INFO L226 Difference]: Without dead ends: 5169 [2024-11-09 06:56:38,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:38,420 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 110 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:38,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 150 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:56:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2024-11-09 06:56:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 3275. [2024-11-09 06:56:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3231 states have (on average 2.6709996904982978) internal successors, (8630), 3274 states have internal predecessors, (8630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 8630 transitions. [2024-11-09 06:56:38,578 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 8630 transitions. Word has length 23 [2024-11-09 06:56:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:38,583 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 8630 transitions. [2024-11-09 06:56:38,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 8630 transitions. [2024-11-09 06:56:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 06:56:38,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:38,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:38,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:56:38,585 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:38,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2020440548, now seen corresponding path program 1 times [2024-11-09 06:56:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:38,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370547474] [2024-11-09 06:56:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:40,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:40,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370547474] [2024-11-09 06:56:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370547474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:40,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:40,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:56:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881881153] [2024-11-09 06:56:40,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:40,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:56:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:56:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:56:40,748 INFO L87 Difference]: Start difference. First operand 3275 states and 8630 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:41,560 INFO L93 Difference]: Finished difference Result 3529 states and 9246 transitions. [2024-11-09 06:56:41,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:56:41,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 06:56:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:41,579 INFO L225 Difference]: With dead ends: 3529 [2024-11-09 06:56:41,579 INFO L226 Difference]: Without dead ends: 3473 [2024-11-09 06:56:41,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:56:41,583 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 187 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:41,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 375 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:56:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2024-11-09 06:56:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 3329. [2024-11-09 06:56:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3285 states have (on average 2.658447488584475) internal successors, (8733), 3328 states have internal predecessors, (8733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 8733 transitions. [2024-11-09 06:56:41,735 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 8733 transitions. Word has length 24 [2024-11-09 06:56:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:41,736 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 8733 transitions. [2024-11-09 06:56:41,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 8733 transitions. [2024-11-09 06:56:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 06:56:41,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:41,741 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:41,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:56:41,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:41,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1727092756, now seen corresponding path program 1 times [2024-11-09 06:56:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:41,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304391125] [2024-11-09 06:56:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:42,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:42,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304391125] [2024-11-09 06:56:42,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304391125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653536650] [2024-11-09 06:56:42,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:42,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:56:42,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:56:42,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:56:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:42,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 1822 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:56:42,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:42,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:56:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653536650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:42,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:56:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-09 06:56:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399588055] [2024-11-09 06:56:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:42,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:56:42,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:42,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:56:42,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:56:42,538 INFO L87 Difference]: Start difference. First operand 3329 states and 8733 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:43,054 INFO L93 Difference]: Finished difference Result 3329 states and 8733 transitions. [2024-11-09 06:56:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:43,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 06:56:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:43,074 INFO L225 Difference]: With dead ends: 3329 [2024-11-09 06:56:43,075 INFO L226 Difference]: Without dead ends: 3185 [2024-11-09 06:56:43,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:56:43,078 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 79 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:43,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 110 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:56:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2024-11-09 06:56:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3185. [2024-11-09 06:56:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 3151 states have (on average 2.6477308790860046) internal successors, (8343), 3184 states have internal predecessors, (8343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 8343 transitions. [2024-11-09 06:56:43,217 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 8343 transitions. Word has length 32 [2024-11-09 06:56:43,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:43,217 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 8343 transitions. [2024-11-09 06:56:43,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 8343 transitions. [2024-11-09 06:56:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 06:56:43,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:43,221 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:43,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:56:43,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 06:56:43,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:43,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2000265488, now seen corresponding path program 1 times [2024-11-09 06:56:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204999905] [2024-11-09 06:56:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:43,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:56:43,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204999905] [2024-11-09 06:56:43,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204999905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:43,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:43,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:43,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502237317] [2024-11-09 06:56:43,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:43,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:56:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:56:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:56:43,626 INFO L87 Difference]: Start difference. First operand 3185 states and 8343 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:44,034 INFO L93 Difference]: Finished difference Result 3324 states and 8638 transitions. [2024-11-09 06:56:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:56:44,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-09 06:56:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:44,061 INFO L225 Difference]: With dead ends: 3324 [2024-11-09 06:56:44,062 INFO L226 Difference]: Without dead ends: 3041 [2024-11-09 06:56:44,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:56:44,072 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 70 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:44,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 90 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:56:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2024-11-09 06:56:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 2301. [2024-11-09 06:56:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2277 states have (on average 2.6359244620114186) internal successors, (6002), 2300 states have internal predecessors, (6002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 6002 transitions. [2024-11-09 06:56:44,193 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 6002 transitions. Word has length 33 [2024-11-09 06:56:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:44,194 INFO L471 AbstractCegarLoop]: Abstraction has 2301 states and 6002 transitions. [2024-11-09 06:56:44,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 6002 transitions. [2024-11-09 06:56:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 06:56:44,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:44,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:44,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:56:44,198 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:44,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash 688380048, now seen corresponding path program 1 times [2024-11-09 06:56:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:44,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933825437] [2024-11-09 06:56:44,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:44,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:44,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933825437] [2024-11-09 06:56:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933825437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:44,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570689824] [2024-11-09 06:56:44,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:44,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:44,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:44,510 INFO L87 Difference]: Start difference. First operand 2301 states and 6002 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:44,754 INFO L93 Difference]: Finished difference Result 3649 states and 9517 transitions. [2024-11-09 06:56:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:44,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 06:56:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:44,764 INFO L225 Difference]: With dead ends: 3649 [2024-11-09 06:56:44,764 INFO L226 Difference]: Without dead ends: 1713 [2024-11-09 06:56:44,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:44,769 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:44,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 49 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:56:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2024-11-09 06:56:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1551. [2024-11-09 06:56:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1535 states have (on average 2.502931596091205) internal successors, (3842), 1550 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 3842 transitions. [2024-11-09 06:56:44,873 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 3842 transitions. Word has length 35 [2024-11-09 06:56:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:44,873 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 3842 transitions. [2024-11-09 06:56:44,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 3842 transitions. [2024-11-09 06:56:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 06:56:44,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:44,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:44,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:56:44,878 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:44,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1067048611, now seen corresponding path program 1 times [2024-11-09 06:56:44,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:44,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145403336] [2024-11-09 06:56:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:47,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:47,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145403336] [2024-11-09 06:56:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145403336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:47,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:47,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:56:47,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253488835] [2024-11-09 06:56:47,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:47,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:56:47,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:47,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:56:47,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:56:47,060 INFO L87 Difference]: Start difference. First operand 1551 states and 3842 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:47,819 INFO L93 Difference]: Finished difference Result 2452 states and 6093 transitions. [2024-11-09 06:56:47,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:56:47,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-09 06:56:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:47,833 INFO L225 Difference]: With dead ends: 2452 [2024-11-09 06:56:47,833 INFO L226 Difference]: Without dead ends: 1551 [2024-11-09 06:56:47,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:56:47,836 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 99 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:47,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 278 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:56:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-11-09 06:56:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2024-11-09 06:56:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1535 states have (on average 2.488599348534202) internal successors, (3820), 1550 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 3820 transitions. [2024-11-09 06:56:47,936 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 3820 transitions. Word has length 36 [2024-11-09 06:56:47,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:47,937 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 3820 transitions. [2024-11-09 06:56:47,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 3820 transitions. [2024-11-09 06:56:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 06:56:47,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:47,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:47,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:56:47,940 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:47,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1246895333, now seen corresponding path program 1 times [2024-11-09 06:56:47,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:47,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145397778] [2024-11-09 06:56:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:47,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:52,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145397778] [2024-11-09 06:56:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145397778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:52,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:52,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 06:56:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793055321] [2024-11-09 06:56:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:52,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:56:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:52,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:56:52,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:56:52,564 INFO L87 Difference]: Start difference. First operand 1551 states and 3820 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:53,783 INFO L93 Difference]: Finished difference Result 2003 states and 4945 transitions. [2024-11-09 06:56:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:56:53,784 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 06:56:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:53,794 INFO L225 Difference]: With dead ends: 2003 [2024-11-09 06:56:53,794 INFO L226 Difference]: Without dead ends: 1984 [2024-11-09 06:56:53,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-09 06:56:53,796 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 218 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:53,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 450 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:56:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-09 06:56:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1898. [2024-11-09 06:56:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1882 states have (on average 2.5026567481402764) internal successors, (4710), 1897 states have internal predecessors, (4710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 4710 transitions. [2024-11-09 06:56:53,926 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 4710 transitions. Word has length 38 [2024-11-09 06:56:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:53,927 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 4710 transitions. [2024-11-09 06:56:53,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 4710 transitions. [2024-11-09 06:56:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 06:56:53,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:53,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:53,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:56:53,931 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:53,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash -79601134, now seen corresponding path program 1 times [2024-11-09 06:56:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:53,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201845740] [2024-11-09 06:56:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:54,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:54,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201845740] [2024-11-09 06:56:54,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201845740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:54,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758966832] [2024-11-09 06:56:54,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:54,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:54,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:54,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:54,238 INFO L87 Difference]: Start difference. First operand 1898 states and 4710 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:54,649 INFO L93 Difference]: Finished difference Result 2696 states and 6700 transitions. [2024-11-09 06:56:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:54,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-09 06:56:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:54,659 INFO L225 Difference]: With dead ends: 2696 [2024-11-09 06:56:54,659 INFO L226 Difference]: Without dead ends: 1639 [2024-11-09 06:56:54,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:54,662 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:54,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 58 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:56:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-09 06:56:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1561. [2024-11-09 06:56:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1545 states have (on average 2.453074433656958) internal successors, (3790), 1560 states have internal predecessors, (3790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 3790 transitions. [2024-11-09 06:56:54,753 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 3790 transitions. Word has length 38 [2024-11-09 06:56:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:54,754 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 3790 transitions. [2024-11-09 06:56:54,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 3790 transitions. [2024-11-09 06:56:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 06:56:54,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:54,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:54,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:56:54,760 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:54,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash -947920, now seen corresponding path program 1 times [2024-11-09 06:56:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:54,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554258281] [2024-11-09 06:56:54,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:58,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:56:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554258281] [2024-11-09 06:56:58,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554258281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:58,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:58,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:56:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162995593] [2024-11-09 06:56:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:58,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:56:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:56:58,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:56:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:56:58,343 INFO L87 Difference]: Start difference. First operand 1561 states and 3790 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:56:59,574 INFO L93 Difference]: Finished difference Result 1886 states and 4592 transitions. [2024-11-09 06:56:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:56:59,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-09 06:56:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:56:59,581 INFO L225 Difference]: With dead ends: 1886 [2024-11-09 06:56:59,581 INFO L226 Difference]: Without dead ends: 1867 [2024-11-09 06:56:59,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-09 06:56:59,583 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 230 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:56:59,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 457 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:56:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2024-11-09 06:56:59,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1580. [2024-11-09 06:56:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1564 states have (on average 2.4520460358056266) internal successors, (3835), 1579 states have internal predecessors, (3835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 3835 transitions. [2024-11-09 06:56:59,652 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 3835 transitions. Word has length 39 [2024-11-09 06:56:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:56:59,652 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 3835 transitions. [2024-11-09 06:56:59,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 3835 transitions. [2024-11-09 06:56:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 06:56:59,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:56:59,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:59,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:56:59,656 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:56:59,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash -910873547, now seen corresponding path program 1 times [2024-11-09 06:56:59,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:56:59,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980730518] [2024-11-09 06:56:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:02,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980730518] [2024-11-09 06:57:02,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980730518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:02,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:02,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:57:02,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382919550] [2024-11-09 06:57:02,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:02,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:57:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:02,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:57:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:57:02,138 INFO L87 Difference]: Start difference. First operand 1580 states and 3835 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:02,651 INFO L93 Difference]: Finished difference Result 1699 states and 4121 transitions. [2024-11-09 06:57:02,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:57:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-09 06:57:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:02,659 INFO L225 Difference]: With dead ends: 1699 [2024-11-09 06:57:02,659 INFO L226 Difference]: Without dead ends: 1680 [2024-11-09 06:57:02,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:57:02,661 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 159 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:02,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 245 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:57:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2024-11-09 06:57:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1618. [2024-11-09 06:57:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1618 states, 1602 states have (on average 2.457553058676654) internal successors, (3937), 1617 states have internal predecessors, (3937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3937 transitions. [2024-11-09 06:57:02,762 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3937 transitions. Word has length 41 [2024-11-09 06:57:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:02,763 INFO L471 AbstractCegarLoop]: Abstraction has 1618 states and 3937 transitions. [2024-11-09 06:57:02,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3937 transitions. [2024-11-09 06:57:02,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 06:57:02,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:02,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:02,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:57:02,770 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:57:02,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1827693547, now seen corresponding path program 1 times [2024-11-09 06:57:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652956568] [2024-11-09 06:57:02,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:02,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:05,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:05,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652956568] [2024-11-09 06:57:05,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652956568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:05,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:05,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 06:57:05,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505210924] [2024-11-09 06:57:05,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:05,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:57:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:05,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:57:05,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:57:05,708 INFO L87 Difference]: Start difference. First operand 1618 states and 3937 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:06,346 INFO L93 Difference]: Finished difference Result 1668 states and 4048 transitions. [2024-11-09 06:57:06,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:57:06,346 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-09 06:57:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:06,356 INFO L225 Difference]: With dead ends: 1668 [2024-11-09 06:57:06,356 INFO L226 Difference]: Without dead ends: 1538 [2024-11-09 06:57:06,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:57:06,358 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 192 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:06,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 326 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:57:06,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-09 06:57:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1526. [2024-11-09 06:57:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1510 states have (on average 2.4556291390728475) internal successors, (3708), 1525 states have internal predecessors, (3708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 3708 transitions. [2024-11-09 06:57:06,454 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 3708 transitions. Word has length 42 [2024-11-09 06:57:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:06,454 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 3708 transitions. [2024-11-09 06:57:06,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 3708 transitions. [2024-11-09 06:57:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 06:57:06,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:06,459 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:06,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:57:06,460 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:57:06,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash 255628850, now seen corresponding path program 1 times [2024-11-09 06:57:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:06,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327643406] [2024-11-09 06:57:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:09,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:09,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327643406] [2024-11-09 06:57:09,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327643406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:57:09,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938490536] [2024-11-09 06:57:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:09,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:09,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:09,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:57:09,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:57:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:09,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 1970 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-09 06:57:09,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:09,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-09 06:57:09,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:57:09,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:57:10,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 06:57:10,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:57:10,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 06:57:10,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:57:10,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:57:10,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 06:57:10,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:57:10,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:57:10,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 06:57:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:10,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:57:11,578 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_602 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_607 (Array Int Int)) (v_ArrVal_604 Int) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_602) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|)))) (or (not (= 400 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_604) .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse0 .cse1)))))) is different from false [2024-11-09 06:57:11,624 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_602 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_607 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| Int) (v_ArrVal_604 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (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) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (let ((.cse3 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_602) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|)))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_604) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| 1))) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse1 .cse2)))))) is different from false [2024-11-09 06:57:11,698 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_602 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_607 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| Int) (v_ArrVal_604 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))))) (let ((.cse0 (let ((.cse3 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_602) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|)))) (or (= 400 (select .cse0 .cse1)) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_604) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| 1))) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2024-11-09 06:57:11,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select .cse4 .cse5))) (or (forall ((v_ArrVal_602 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_607 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| Int) (v_ArrVal_604 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse6 1))))) (let ((.cse1 (let ((.cse3 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_602) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|)))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_604) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| 1))) |c_~#stored_elements~0.base| v_ArrVal_607) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (= 400 (select .cse1 .cse2)))))) (= 400 .cse6)))) is different from false [2024-11-09 06:57:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:12,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938490536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:57:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1812078404] [2024-11-09 06:57:12,180 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 06:57:12,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:57:12,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 35 [2024-11-09 06:57:12,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528625931] [2024-11-09 06:57:12,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:57:12,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 06:57:12,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:12,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 06:57:12,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=758, Unknown=14, NotChecked=252, Total=1260 [2024-11-09 06:57:12,186 INFO L87 Difference]: Start difference. First operand 1526 states and 3708 transitions. Second operand has 36 states, 36 states have (on average 3.9166666666666665) internal successors, (141), 35 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:13,989 INFO L93 Difference]: Finished difference Result 2288 states and 5582 transitions. [2024-11-09 06:57:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:57:13,989 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.9166666666666665) internal successors, (141), 35 states have internal predecessors, (141), 0 states have call successors, (0), 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 51 [2024-11-09 06:57:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:13,998 INFO L225 Difference]: With dead ends: 2288 [2024-11-09 06:57:13,998 INFO L226 Difference]: Without dead ends: 1538 [2024-11-09 06:57:14,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=285, Invalid=907, Unknown=14, NotChecked=276, Total=1482 [2024-11-09 06:57:14,001 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 229 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 727 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:14,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 829 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1054 Invalid, 0 Unknown, 727 Unchecked, 1.4s Time] [2024-11-09 06:57:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-09 06:57:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1526. [2024-11-09 06:57:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1510 states have (on average 2.447682119205298) internal successors, (3696), 1525 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 3696 transitions. [2024-11-09 06:57:14,083 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 3696 transitions. Word has length 51 [2024-11-09 06:57:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:14,084 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 3696 transitions. [2024-11-09 06:57:14,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.9166666666666665) internal successors, (141), 35 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 3696 transitions. [2024-11-09 06:57:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 06:57:14,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:14,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:14,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:57:14,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 06:57:14,286 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:57:14,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:14,287 INFO L85 PathProgramCache]: Analyzing trace with hash -634766956, now seen corresponding path program 1 times [2024-11-09 06:57:14,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:14,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697894835] [2024-11-09 06:57:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:18,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697894835] [2024-11-09 06:57:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697894835] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:57:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758748761] [2024-11-09 06:57:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:18,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:18,513 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:57:18,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:57:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:19,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 06:57:19,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:19,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:57:19,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 06:57:19,490 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 34 treesize of output 28 [2024-11-09 06:57:19,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:19,504 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 38 treesize of output 22 [2024-11-09 06:57:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:57:19,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:57:19,990 INFO L349 Elim1Store]: treesize reduction 51, result has 52.3 percent of original size [2024-11-09 06:57:19,990 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 214 treesize of output 195 [2024-11-09 06:57:20,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:20,017 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 154 treesize of output 148 [2024-11-09 06:57:20,129 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 [2024-11-09 06:57:20,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:20,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 193 [2024-11-09 06:57:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:57:20,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758748761] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 06:57:20,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:57:20,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 6] total 26 [2024-11-09 06:57:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309443315] [2024-11-09 06:57:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:20,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:57:20,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:57:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-11-09 06:57:20,707 INFO L87 Difference]: Start difference. First operand 1526 states and 3696 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:21,607 INFO L93 Difference]: Finished difference Result 1526 states and 3696 transitions. [2024-11-09 06:57:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:57:21,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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 53 [2024-11-09 06:57:21,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:21,615 INFO L225 Difference]: With dead ends: 1526 [2024-11-09 06:57:21,615 INFO L226 Difference]: Without dead ends: 1510 [2024-11-09 06:57:21,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-11-09 06:57:21,616 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 102 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:21,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 189 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:57:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-09 06:57:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2024-11-09 06:57:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1496 states have (on average 2.445187165775401) internal successors, (3658), 1509 states have internal predecessors, (3658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 3658 transitions. [2024-11-09 06:57:21,744 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 3658 transitions. Word has length 53 [2024-11-09 06:57:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:21,744 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 3658 transitions. [2024-11-09 06:57:21,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 3658 transitions. [2024-11-09 06:57:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 06:57:21,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:21,748 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:21,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:57:21,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:21,949 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:57:21,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1797063234, now seen corresponding path program 1 times [2024-11-09 06:57:21,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:57:21,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807583677] [2024-11-09 06:57:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:21,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:26,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:57:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807583677] [2024-11-09 06:57:26,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807583677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:57:26,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574190647] [2024-11-09 06:57:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:26,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:26,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:26,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:57:26,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:57:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:26,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 1976 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 06:57:26,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:26,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-09 06:57:26,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:57:26,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:57:26,993 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 23 treesize of output 3 [2024-11-09 06:57:27,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:57:27,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:57:27,149 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-09 06:57:27,149 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-09 06:57:27,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:57:27,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-09 06:57:27,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:57:27,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 06:57:27,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-09 06:57:27,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:57:27,985 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 31 treesize of output 23 [2024-11-09 06:57:27,988 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 33 treesize of output 23 [2024-11-09 06:57:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:27,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:57:30,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int) (v_ArrVal_795 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int) (v_ArrVal_794 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|) (< (select .cse2 .cse3) (+ v_ArrVal_795 1)) (< (select (store (store (store .cse2 .cse3 v_ArrVal_795) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse2 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|) .cse3) 2147483647))))) is different from false [2024-11-09 06:57:30,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int) (v_ArrVal_795 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int) (v_ArrVal_791 Int) (v_ArrVal_794 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_791) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_795) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|) .cse1) 2147483647) (< 2147483647 v_ArrVal_791) (< (select .cse0 .cse1) (+ v_ArrVal_795 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|))))) is different from false [2024-11-09 06:57:31,575 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int) (v_ArrVal_795 Int) (v_ArrVal_789 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int) (v_ArrVal_791 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_20| Int) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_787 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (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_787)))) (let ((.cse3 (let ((.cse5 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_789) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_20|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_791) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_795 1)) (< 2147483647 v_ArrVal_791) (< (select (store (store (store .cse0 .cse1 v_ArrVal_795) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|) .cse1) 2147483647) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_787) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|)))))) is different from false [2024-11-09 06:57:31,715 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int) (v_ArrVal_795 Int) (v_ArrVal_789 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int) (v_ArrVal_791 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_20| Int) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_787 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_787)))) (let ((.cse3 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_789) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_20|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_791) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_795 1)) (< 2147483647 v_ArrVal_791) (< (select (store (store (store .cse0 .cse1 v_ArrVal_795) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|) .cse1) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|) (< (+ (select .cse4 .cse5) 1) v_ArrVal_787))))))) is different from false [2024-11-09 06:57:31,770 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int) (v_ArrVal_795 Int) (v_ArrVal_789 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_791 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_20| Int) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_787 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_787)))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_789) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_20|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_791) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_795) (+ 1600 |c_~#queue~0.offset|) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|) .cse1) 2147483647) (< 2147483647 v_ArrVal_791) (< (+ (select .cse3 .cse4) 1) v_ArrVal_787) (< (select .cse0 .cse1) (+ v_ArrVal_795 1)) (< (select .cse5 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|))))))) is different from false [2024-11-09 06:57:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 06:57:36,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574190647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:57:36,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [845007463] [2024-11-09 06:57:36,490 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 06:57:36,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:57:36,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 39 [2024-11-09 06:57:36,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98453966] [2024-11-09 06:57:36,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:57:36,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 06:57:36,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:36,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 06:57:36,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1033, Unknown=25, NotChecked=360, Total=1640 [2024-11-09 06:57:36,493 INFO L87 Difference]: Start difference. First operand 1510 states and 3658 transitions. Second operand has 41 states, 40 states have (on average 3.95) internal successors, (158), 40 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:40,632 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] [2024-11-09 06:57:42,640 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] [2024-11-09 06:57:44,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:57:46,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 06:57:48,662 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] [2024-11-09 06:57:50,665 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] [2024-11-09 06:57:52,676 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] [2024-11-09 06:57:52,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| Int) (v_ArrVal_795 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int) (v_ArrVal_794 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47| 1))) |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_47|) (< (select .cse2 .cse3) (+ v_ArrVal_795 1)) (< (select (store (store (store .cse2 .cse3 v_ArrVal_795) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* 4 (select .cse2 .cse5)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|) .cse3) 2147483647))))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_795 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse6 .cse3) (+ v_ArrVal_795 1)) (< (select (store (store (store .cse6 .cse3 v_ArrVal_795) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|) .cse3) 2147483647)))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_795 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_18| Int) (v_ArrVal_794 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_794) |c_~#queue~0.base|))) (or (< (select .cse7 .cse3) (+ v_ArrVal_795 1)) (< (select (store (store (store .cse7 .cse3 v_ArrVal_795) .cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (+ |c_~#queue~0.offset| (* (select .cse7 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_18|) .cse3) 2147483647)))))) is different from false [2024-11-09 06:57:54,841 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] [2024-11-09 06:57:56,995 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] [2024-11-09 06:57:59,122 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] [2024-11-09 06:58:01,215 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] [2024-11-09 06:58:03,227 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] [2024-11-09 06:58:05,251 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] [2024-11-09 06:58:07,400 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] [2024-11-09 06:58:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:11,424 INFO L93 Difference]: Finished difference Result 2498 states and 6125 transitions. [2024-11-09 06:58:11,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 06:58:11,425 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.95) internal successors, (158), 40 states have internal predecessors, (158), 0 states have call successors, (0), 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 54 [2024-11-09 06:58:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:11,437 INFO L225 Difference]: With dead ends: 2498 [2024-11-09 06:58:11,437 INFO L226 Difference]: Without dead ends: 2482 [2024-11-09 06:58:11,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=432, Invalid=1821, Unknown=27, NotChecked=582, Total=2862 [2024-11-09 06:58:11,440 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 613 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 39 mSolverCounterUnsat, 80 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 80 IncrementalHoareTripleChecker+Unknown, 2031 IncrementalHoareTripleChecker+Unchecked, 31.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:11,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1059 Invalid, 3394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1244 Invalid, 80 Unknown, 2031 Unchecked, 31.8s Time] [2024-11-09 06:58:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2024-11-09 06:58:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2190. [2024-11-09 06:58:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2176 states have (on average 2.5183823529411766) internal successors, (5480), 2189 states have internal predecessors, (5480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 5480 transitions. [2024-11-09 06:58:11,622 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 5480 transitions. Word has length 54 [2024-11-09 06:58:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:11,623 INFO L471 AbstractCegarLoop]: Abstraction has 2190 states and 5480 transitions. [2024-11-09 06:58:11,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.95) internal successors, (158), 40 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 5480 transitions. [2024-11-09 06:58:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 06:58:11,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:11,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:11,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 06:58:11,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:11,827 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:58:11,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 400991463, now seen corresponding path program 1 times [2024-11-09 06:58:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:58:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111580368] [2024-11-09 06:58:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:14,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:58:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111580368] [2024-11-09 06:58:14,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111580368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:58:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248937066] [2024-11-09 06:58:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:14,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:14,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:58:14,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:58:14,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:58:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:15,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 06:58:15,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:15,492 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 35 treesize of output 9 [2024-11-09 06:58:15,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:15,573 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 06:58:15,574 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-11-09 06:58:15,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:15,711 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 29 treesize of output 13 [2024-11-09 06:58:15,840 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 23 treesize of output 13 [2024-11-09 06:58:15,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:15,880 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 [2024-11-09 06:58:15,946 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:15,957 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 06:58:15,958 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-11-09 06:58:16,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:16,028 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 29 treesize of output 13 [2024-11-09 06:58:16,143 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 23 treesize of output 13 [2024-11-09 06:58:16,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:16,213 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 [2024-11-09 06:58:16,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:16,391 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 29 treesize of output 13 [2024-11-09 06:58:16,432 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 29 treesize of output 13 [2024-11-09 06:58:16,472 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 29 treesize of output 13 [2024-11-09 06:58:16,525 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 29 treesize of output 13 [2024-11-09 06:58:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:16,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:17,218 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_899) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1)) 2147483650))) is different from false [2024-11-09 06:58:17,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_899) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1))))) is different from false [2024-11-09 06:58:17,259 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (v_ArrVal_897 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_897) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_899) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1))))) is different from false [2024-11-09 06:58:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 06:58:18,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248937066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:18,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1795502314] [2024-11-09 06:58:18,240 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 06:58:18,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:58:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 36 [2024-11-09 06:58:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097081701] [2024-11-09 06:58:18,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:58:18,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 06:58:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:58:18,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 06:58:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=963, Unknown=9, NotChecked=204, Total=1406 [2024-11-09 06:58:18,245 INFO L87 Difference]: Start difference. First operand 2190 states and 5480 transitions. Second operand has 38 states, 37 states have (on average 4.54054054054054) internal successors, (168), 37 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:22,245 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_899 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int)) (< 0 (+ (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_899) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1) 2147483650))) (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_24| Int) (v_ArrVal_901 Int)) (< 0 (+ 2147483650 (select (let ((.cse2 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_901) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600) (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_24|)) .cse1)))))) is different from false [2024-11-09 06:58:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:24,302 INFO L93 Difference]: Finished difference Result 4170 states and 10406 transitions. [2024-11-09 06:58:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 06:58:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.54054054054054) internal successors, (168), 37 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-09 06:58:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:24,317 INFO L225 Difference]: With dead ends: 4170 [2024-11-09 06:58:24,317 INFO L226 Difference]: Without dead ends: 4154 [2024-11-09 06:58:24,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 91 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=464, Invalid=1885, Unknown=19, NotChecked=388, Total=2756 [2024-11-09 06:58:24,320 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 928 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 91 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 3440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 1718 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:24,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1198 Invalid, 3440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1613 Invalid, 18 Unknown, 1718 Unchecked, 4.0s Time] [2024-11-09 06:58:24,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2024-11-09 06:58:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 3436. [2024-11-09 06:58:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3436 states, 3422 states have (on average 2.5838690824079484) internal successors, (8842), 3435 states have internal predecessors, (8842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 8842 transitions. [2024-11-09 06:58:24,695 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 8842 transitions. Word has length 56 [2024-11-09 06:58:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:24,696 INFO L471 AbstractCegarLoop]: Abstraction has 3436 states and 8842 transitions. [2024-11-09 06:58:24,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.54054054054054) internal successors, (168), 37 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 8842 transitions. [2024-11-09 06:58:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 06:58:24,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:24,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:24,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:58:24,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:24,900 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:58:24,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash -454164134, now seen corresponding path program 1 times [2024-11-09 06:58:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:58:24,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908310766] [2024-11-09 06:58:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:24,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:27,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:58:27,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908310766] [2024-11-09 06:58:27,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908310766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:58:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218687372] [2024-11-09 06:58:27,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:27,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:27,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:58:27,993 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:58:27,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:58:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:28,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 1989 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-09 06:58:28,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:28,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-09 06:58:28,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:58:28,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:58:29,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-09 06:58:29,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:29,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 06:58:29,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:58:29,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:58:29,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 06:58:29,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:29,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 06:58:29,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 06:58:30,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 06:58:30,156 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-09 06:58:30,156 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-09 06:58:30,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:58:30,245 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 15 treesize of output 7 [2024-11-09 06:58:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:30,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:30,743 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1006) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse1)) 2147483647)) is different from false [2024-11-09 06:58:30,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1006 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (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) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1006) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse1)) 2147483647)) is different from false [2024-11-09 06:58:30,808 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| Int) (v_ArrVal_1006 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| 1))) |c_~#stored_elements~0.base| v_ArrVal_1006) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse1)) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69|)))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2024-11-09 06:58:30,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (or (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1003) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| 1))) |c_~#stored_elements~0.base| v_ArrVal_1006) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse2)) 2147483647) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69|)))))) is different from false [2024-11-09 06:58:31,273 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1003 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1001) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse3 (select .cse2 .cse1))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1003) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| 1))) |c_~#stored_elements~0.base| v_ArrVal_1006) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse1) 2147483647) (= 400 .cse3) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69|)))))) is different from false [2024-11-09 06:58:31,611 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1003 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))))) (let ((.cse4 (let ((.cse5 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1001) |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse0 (select .cse4 .cse2))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69|) (= .cse0 400) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1003) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| 1))) |c_~#stored_elements~0.base| v_ArrVal_1006) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse2) 2147483647)))))) (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|)) is different from false [2024-11-09 06:58:31,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse7 .cse8))) (or (= 400 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| Int) (v_ArrVal_1006 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1003 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ .cse0 1))))) (let ((.cse5 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1001) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 400 .cse1) (< (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1003) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| 1))) |c_~#stored_elements~0.base| v_ArrVal_1006) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse3) 2147483647) (< .cse1 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69|))))))))) is different from false [2024-11-09 06:58:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 06:58:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218687372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:34,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [977111986] [2024-11-09 06:58:34,310 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 06:58:34,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:58:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 38 [2024-11-09 06:58:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644942218] [2024-11-09 06:58:34,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:58:34,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 06:58:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:58:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 06:58:34,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=816, Unknown=11, NotChecked=476, Total=1560 [2024-11-09 06:58:34,314 INFO L87 Difference]: Start difference. First operand 3436 states and 8842 transitions. Second operand has 40 states, 39 states have (on average 4.333333333333333) internal successors, (169), 39 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:36,568 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1006 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1006) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse1) 2147483647)) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) 2147483647) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| Int) (v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1003 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_30| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_32| Int)) (let ((.cse4 (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_32|)))) (let ((.cse2 (select .cse4 .cse1))) (or (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69|) (= 400 .cse2) (< (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_1003) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_69| 1))) |c_~#stored_elements~0.base| v_ArrVal_1006) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_30|)) .cse1) 2147483647))))))) is different from false [2024-11-09 06:58:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:38,337 INFO L93 Difference]: Finished difference Result 7470 states and 19170 transitions. [2024-11-09 06:58:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 06:58:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 4.333333333333333) internal successors, (169), 39 states have internal predecessors, (169), 0 states have call successors, (0), 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 57 [2024-11-09 06:58:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:38,360 INFO L225 Difference]: With dead ends: 7470 [2024-11-09 06:58:38,360 INFO L226 Difference]: Without dead ends: 7330 [2024-11-09 06:58:38,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 91 SyntacticMatches, 18 SemanticMatches, 53 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=488, Invalid=1694, Unknown=12, NotChecked=776, Total=2970 [2024-11-09 06:58:38,364 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 670 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 4991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3641 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:38,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1097 Invalid, 4991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1293 Invalid, 0 Unknown, 3641 Unchecked, 2.2s Time] [2024-11-09 06:58:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7330 states. [2024-11-09 06:58:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7330 to 6508. [2024-11-09 06:58:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6508 states, 6494 states have (on average 2.6367416076378194) internal successors, (17123), 6507 states have internal predecessors, (17123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 17123 transitions. [2024-11-09 06:58:38,924 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 17123 transitions. Word has length 57 [2024-11-09 06:58:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:38,925 INFO L471 AbstractCegarLoop]: Abstraction has 6508 states and 17123 transitions. [2024-11-09 06:58:38,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.333333333333333) internal successors, (169), 39 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 17123 transitions. [2024-11-09 06:58:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 06:58:38,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:38,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:38,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 06:58:39,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:39,131 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:58:39,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1076507878, now seen corresponding path program 1 times [2024-11-09 06:58:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:58:39,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254447080] [2024-11-09 06:58:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:41,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:58:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254447080] [2024-11-09 06:58:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254447080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:58:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607059640] [2024-11-09 06:58:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:41,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:41,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:58:41,967 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:58:41,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:58:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:42,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 2041 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-09 06:58:42,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:42,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:58:42,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:42,796 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2024-11-09 06:58:42,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:42,864 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 30 treesize of output 23 [2024-11-09 06:58:42,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:42,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:42,998 INFO L349 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2024-11-09 06:58:42,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2024-11-09 06:58:43,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:43,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 55 [2024-11-09 06:58:43,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:43,388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 34 [2024-11-09 06:58:43,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:43,492 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 40 treesize of output 31 [2024-11-09 06:58:43,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:43,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 34 [2024-11-09 06:58:43,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:43,987 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 32 [2024-11-09 06:58:44,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:44,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:44,303 INFO L349 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2024-11-09 06:58:44,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 60 [2024-11-09 06:58:44,451 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:44,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:44,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 30 [2024-11-09 06:58:44,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:44,552 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2024-11-09 06:58:44,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:44,632 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 29 treesize of output 22 [2024-11-09 06:58:44,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:44,712 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 30 treesize of output 12 [2024-11-09 06:58:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:44,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:58,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1131 Int) (v_ArrVal_1125 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1126 Int)) (let ((.cse7 (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) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse1 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1125) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (+ v_ArrVal_1126 1)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse5 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (or (< .cse0 (select .cse1 .cse2)) (< v_ArrVal_1131 .cse0) (< 400 (select (store (store (store .cse1 .cse2 v_ArrVal_1126) .cse3 .cse4) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_37|) .cse6)) (< 0 (+ (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse1 .cse3 .cse4) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_37|) .cse2 v_ArrVal_1131) .cse6 1)) |c_~#stored_elements~0.base| v_ArrVal_1133) |c_~#queue~0.base|) .cse2) 2147483648))))))) is different from false [2024-11-09 06:58:58,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1131 Int) (v_ArrVal_1125 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1126 Int)) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse0 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1125) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4))) (.cse7 (+ v_ArrVal_1126 1)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< 400 (select (store (store (store .cse0 .cse1 v_ArrVal_1126) .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_37|) .cse5)) (< 0 (+ (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_37|) .cse1 v_ArrVal_1131) .cse5 1)) |c_~#stored_elements~0.base| v_ArrVal_1133) |c_~#queue~0.base|) .cse1) 2147483648)) (< v_ArrVal_1131 .cse7) (< .cse7 (select .cse0 .cse1))))))) is different from false [2024-11-09 06:58:58,767 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t2Thread1of1ForFork1_dequeue_#t~post48#1| Int) (v_ArrVal_1131 Int) (v_ArrVal_1125 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_37| Int) (v_ArrVal_1122 Int) (v_ArrVal_1133 (Array Int Int)) (v_ArrVal_1126 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1122) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1125) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (+ v_ArrVal_1126 1)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |t2Thread1of1ForFork1_dequeue_#t~post48#1| 1)) (.cse4 (+ (* (select .cse1 .cse6) 4) |c_~#queue~0.offset|))) (or (< v_ArrVal_1122 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (< 0 (+ (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_37|) .cse5 v_ArrVal_1131) .cse6 1)) |c_~#stored_elements~0.base| v_ArrVal_1133) |c_~#queue~0.base|) .cse5) 2147483648)) (< v_ArrVal_1131 .cse7) (< .cse7 (select .cse1 .cse5)) (< 400 (select (store (store (store .cse1 .cse5 v_ArrVal_1126) .cse2 .cse3) .cse4 |v_t1Thread1of1ForFork0_enqueue_~x#1_37|) .cse6))))))) is different from false [2024-11-09 06:59:04,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:04,494 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 1154 treesize of output 472 [2024-11-09 06:59:04,578 INFO L349 Elim1Store]: treesize reduction 61, result has 55.8 percent of original size [2024-11-09 06:59:04,578 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 452 treesize of output 446 [2024-11-09 06:59:04,715 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 46 treesize of output 30 [2024-11-09 06:59:04,745 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 32 treesize of output 20 [2024-11-09 06:59:04,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:04,776 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 91 treesize of output 87 [2024-11-09 06:59:04,790 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 [2024-11-09 06:59:04,861 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 18 treesize of output 10 [2024-11-09 06:59:04,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:04,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 65 [2024-11-09 06:59:05,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 06:59:05,049 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:59:05,076 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:59:05,097 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:59:05,123 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 43 treesize of output 27 [2024-11-09 06:59:05,135 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 58 treesize of output 48 [2024-11-09 06:59:05,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:05,175 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 26 treesize of output 32 [2024-11-09 06:59:05,196 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 [2024-11-09 06:59:05,249 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 52 treesize of output 36 [2024-11-09 06:59:05,270 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 229 treesize of output 209 [2024-11-09 06:59:05,290 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 [2024-11-09 06:59:05,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:05,311 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:05,488 INFO L349 Elim1Store]: treesize reduction 273, result has 11.4 percent of original size [2024-11-09 06:59:05,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 219 treesize of output 149 [2024-11-09 06:59:05,529 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 [2024-11-09 06:59:05,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2024-11-09 06:59:05,663 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 [2024-11-09 06:59:05,678 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:59:05,705 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 82 treesize of output 66 [2024-11-09 06:59:05,727 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 545 treesize of output 501 [2024-11-09 06:59:05,747 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 [2024-11-09 06:59:05,772 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:05,776 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:06,866 INFO L349 Elim1Store]: treesize reduction 1013, result has 7.0 percent of original size [2024-11-09 06:59:06,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 592 treesize of output 487 [2024-11-09 06:59:06,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:06,988 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:06,989 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:06,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:06,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:06,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:07,004 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:07,005 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:07,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:07,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:07,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:07,023 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:07,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:07,053 INFO L349 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2024-11-09 06:59:07,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 39248 treesize of output 29985 [2024-11-09 06:59:07,303 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 32 treesize of output 20 [2024-11-09 06:59:08,095 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:08,103 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 222 treesize of output 202 [2024-11-09 06:59:08,120 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 [2024-11-09 06:59:08,139 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:08,143 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:08,189 INFO L349 Elim1Store]: treesize reduction 307, result has 0.3 percent of original size [2024-11-09 06:59:08,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 219 treesize of output 1 [2024-11-09 06:59:08,237 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:59:08,255 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:59:08,276 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 46 treesize of output 30 [2024-11-09 06:59:08,306 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 32 treesize of output 20 [2024-11-09 06:59:08,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:08,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:08,461 INFO L349 Elim1Store]: treesize reduction 146, result has 9.3 percent of original size [2024-11-09 06:59:08,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 36 [2024-11-09 06:59:08,503 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 06:59:08,503 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 57 treesize of output 42 [2024-11-09 06:59:08,520 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 [2024-11-09 06:59:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-09 06:59:17,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607059640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:17,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1371231829] [2024-11-09 06:59:17,096 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 06:59:17,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:59:17,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 20] total 48 [2024-11-09 06:59:17,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127994929] [2024-11-09 06:59:17,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:59:17,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 06:59:17,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:59:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 06:59:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1755, Unknown=71, NotChecked=270, Total=2352 [2024-11-09 06:59:17,100 INFO L87 Difference]: Start difference. First operand 6508 states and 17123 transitions. Second operand has 49 states, 49 states have (on average 4.142857142857143) internal successors, (203), 48 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:59:26,694 INFO L93 Difference]: Finished difference Result 7863 states and 20551 transitions. [2024-11-09 06:59:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 06:59:26,695 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.142857142857143) internal successors, (203), 48 states have internal predecessors, (203), 0 states have call successors, (0), 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 68 [2024-11-09 06:59:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:59:26,713 INFO L225 Difference]: With dead ends: 7863 [2024-11-09 06:59:26,714 INFO L226 Difference]: Without dead ends: 4755 [2024-11-09 06:59:26,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 105 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=1032, Invalid=4459, Unknown=71, NotChecked=444, Total=6006 [2024-11-09 06:59:26,724 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 1655 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1167 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:59:26,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1655 Valid, 1089 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1940 Invalid, 0 Unknown, 1167 Unchecked, 4.5s Time] [2024-11-09 06:59:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2024-11-09 06:59:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4455. [2024-11-09 06:59:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 4443 states have (on average 2.5671843349088452) internal successors, (11406), 4454 states have internal predecessors, (11406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 11406 transitions. [2024-11-09 06:59:27,089 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 11406 transitions. Word has length 68 [2024-11-09 06:59:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:59:27,090 INFO L471 AbstractCegarLoop]: Abstraction has 4455 states and 11406 transitions. [2024-11-09 06:59:27,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.142857142857143) internal successors, (203), 48 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 11406 transitions. [2024-11-09 06:59:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 06:59:27,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:59:27,095 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:27,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 06:59:27,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 06:59:27,295 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:59:27,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1667766259, now seen corresponding path program 1 times [2024-11-09 06:59:27,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:59:27,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950839267] [2024-11-09 06:59:27,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:59:28,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:59:28,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950839267] [2024-11-09 06:59:28,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950839267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:28,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249224299] [2024-11-09 06:59:28,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:28,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:28,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:59:28,919 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:28,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:59:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:29,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 06:59:29,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:29,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:59:29,978 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 29 treesize of output 13 [2024-11-09 06:59:30,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:30,035 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 [2024-11-09 06:59:30,086 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 19 treesize of output 7 [2024-11-09 06:59:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 06:59:30,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:30,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1241 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1241) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483649)) is different from false [2024-11-09 06:59:30,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:30,227 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 29 treesize of output 35 [2024-11-09 06:59:30,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:30,242 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 35 treesize of output 34 [2024-11-09 06:59:30,249 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 7 treesize of output 3 [2024-11-09 06:59:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2024-11-09 06:59:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249224299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:30,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [164055271] [2024-11-09 06:59:30,513 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 06:59:30,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:59:30,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2024-11-09 06:59:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527824297] [2024-11-09 06:59:30,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:59:30,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 06:59:30,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:59:30,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 06:59:30,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=295, Unknown=3, NotChecked=36, Total=420 [2024-11-09 06:59:30,519 INFO L87 Difference]: Start difference. First operand 4455 states and 11406 transitions. Second operand has 21 states, 20 states have (on average 9.75) internal successors, (195), 20 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:59:31,720 INFO L93 Difference]: Finished difference Result 4455 states and 11406 transitions. [2024-11-09 06:59:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:59:31,720 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 9.75) internal successors, (195), 20 states have internal predecessors, (195), 0 states have call successors, (0), 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 71 [2024-11-09 06:59:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:59:31,737 INFO L225 Difference]: With dead ends: 4455 [2024-11-09 06:59:31,737 INFO L226 Difference]: Without dead ends: 4436 [2024-11-09 06:59:31,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=412, Unknown=3, NotChecked=44, Total=600 [2024-11-09 06:59:31,739 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 174 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:59:31,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 227 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 338 Invalid, 0 Unknown, 94 Unchecked, 0.7s Time] [2024-11-09 06:59:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2024-11-09 06:59:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 4436. [2024-11-09 06:59:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4436 states, 4426 states have (on average 2.5560325350203343) internal successors, (11313), 4435 states have internal predecessors, (11313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 11313 transitions. [2024-11-09 06:59:32,071 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 11313 transitions. Word has length 71 [2024-11-09 06:59:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:59:32,071 INFO L471 AbstractCegarLoop]: Abstraction has 4436 states and 11313 transitions. [2024-11-09 06:59:32,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 9.75) internal successors, (195), 20 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 11313 transitions. [2024-11-09 06:59:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 06:59:32,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:59:32,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:32,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 06:59:32,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 06:59:32,277 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:59:32,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash -700495918, now seen corresponding path program 1 times [2024-11-09 06:59:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:59:32,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69951720] [2024-11-09 06:59:32,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:34,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:59:34,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69951720] [2024-11-09 06:59:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69951720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:34,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520066680] [2024-11-09 06:59:34,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:34,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:34,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:59:34,368 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:34,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 06:59:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:34,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 2059 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 06:59:34,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:35,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:59:35,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:35,212 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-11-09 06:59:35,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 71 [2024-11-09 06:59:35,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:35,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:35,391 INFO L349 Elim1Store]: treesize reduction 41, result has 24.1 percent of original size [2024-11-09 06:59:35,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 62 [2024-11-09 06:59:35,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:35,560 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2024-11-09 06:59:35,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 63 [2024-11-09 06:59:35,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:35,600 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 20 treesize of output 15 [2024-11-09 06:59:35,683 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 31 treesize of output 15 [2024-11-09 06:59:35,691 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 21 treesize of output 9 [2024-11-09 06:59:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:59:35,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:35,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1355 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1355) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 2147483650))) is different from false [2024-11-09 06:59:40,281 INFO L349 Elim1Store]: treesize reduction 264, result has 41.1 percent of original size [2024-11-09 06:59:40,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 255 [2024-11-09 06:59:40,323 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-09 06:59:40,324 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 160 [2024-11-09 06:59:40,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:40,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:40,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:40,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 170 treesize of output 226 [2024-11-09 06:59:40,466 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 82 treesize of output 74 [2024-11-09 06:59:41,116 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 10 treesize of output 6 [2024-11-09 06:59:42,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:42,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 638 treesize of output 606 [2024-11-09 06:59:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2024-11-09 06:59:44,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520066680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:44,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2115963235] [2024-11-09 06:59:44,968 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 06:59:44,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:59:44,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 26 [2024-11-09 06:59:44,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263423381] [2024-11-09 06:59:44,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:59:44,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 06:59:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:59:44,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 06:59:44,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=582, Unknown=8, NotChecked=50, Total=756 [2024-11-09 06:59:44,970 INFO L87 Difference]: Start difference. First operand 4436 states and 11313 transitions. Second operand has 28 states, 27 states have (on average 7.851851851851852) internal successors, (212), 27 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:59:46,620 INFO L93 Difference]: Finished difference Result 4533 states and 11536 transitions. [2024-11-09 06:59:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:59:46,621 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 7.851851851851852) internal successors, (212), 27 states have internal predecessors, (212), 0 states have call successors, (0), 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 73 [2024-11-09 06:59:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:59:46,636 INFO L225 Difference]: With dead ends: 4533 [2024-11-09 06:59:46,636 INFO L226 Difference]: Without dead ends: 4514 [2024-11-09 06:59:46,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=203, Invalid=785, Unknown=8, NotChecked=60, Total=1056 [2024-11-09 06:59:46,639 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 387 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:59:46,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 298 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 463 Invalid, 0 Unknown, 104 Unchecked, 1.0s Time] [2024-11-09 06:59:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4514 states. [2024-11-09 06:59:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4514 to 4417. [2024-11-09 06:59:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4417 states, 4409 states have (on average 2.5373100476298482) internal successors, (11187), 4416 states have internal predecessors, (11187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 11187 transitions. [2024-11-09 06:59:47,008 INFO L78 Accepts]: Start accepts. Automaton has 4417 states and 11187 transitions. Word has length 73 [2024-11-09 06:59:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:59:47,008 INFO L471 AbstractCegarLoop]: Abstraction has 4417 states and 11187 transitions. [2024-11-09 06:59:47,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 7.851851851851852) internal successors, (212), 27 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4417 states and 11187 transitions. [2024-11-09 06:59:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 06:59:47,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:59:47,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:47,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 06:59:47,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 06:59:47,213 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 06:59:47,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash -240534546, now seen corresponding path program 1 times [2024-11-09 06:59:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:59:47,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912681297] [2024-11-09 06:59:47,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:47,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:59:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:51,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:59:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912681297] [2024-11-09 06:59:51,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912681297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:59:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144429241] [2024-11-09 06:59:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:51,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:51,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:59:51,955 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:51,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 06:59:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:52,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 2060 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-09 06:59:52,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:52,500 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 29 treesize of output 19 [2024-11-09 06:59:52,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:52,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:52,671 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-09 06:59:52,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-09 06:59:52,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:52,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:52,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-09 06:59:53,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-09 06:59:53,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:53,214 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 27 treesize of output 20 [2024-11-09 06:59:53,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:53,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:53,362 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-09 06:59:53,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-09 06:59:53,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:53,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:53,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-09 06:59:53,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:53,587 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2024-11-09 06:59:53,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:53,672 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 27 treesize of output 20 [2024-11-09 06:59:53,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:53,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:53,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-09 06:59:54,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-09 06:59:54,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:54,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:54,199 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-09 06:59:54,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-09 06:59:54,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:54,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:54,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-09 06:59:54,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:54,352 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-09 06:59:54,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:54,441 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 [2024-11-09 06:59:54,575 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 29 treesize of output 13 [2024-11-09 06:59:54,583 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 19 treesize of output 7 [2024-11-09 06:59:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:54,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:00:10,789 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1472 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int) (v_ArrVal_1473 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_60| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (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_1472)))) (let ((.cse2 (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1473) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_60|))) (.cse5 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1476) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))) |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|)) (.cse1 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1472) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse1) 2147483647)))))) is different from false [2024-11-09 07:00:10,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1472 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int) (v_ArrVal_1473 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_60| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1472)))) (let ((.cse4 (let ((.cse8 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1473) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_60|))) (.cse7 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_1476) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))) |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1472) (< (select .cse2 .cse3) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse2 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse7 v_ArrVal_1484) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse3) 2147483647))))))) is different from false [2024-11-09 07:00:10,996 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1478 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1473 (Array Int Int)) (v_ArrVal_1484 Int) (v_ArrVal_1472 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (v_ArrVal_1476 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_60| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_1472)))) (let ((.cse7 (let ((.cse8 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1473) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* 4 (select .cse8 .cse5))) |v_t1Thread1of1ForFork0_enqueue_~x#1_60|))) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_1476) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))) |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1472) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse6 v_ArrVal_1484) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse4) 2147483647) (< (select .cse3 .cse4) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select .cse7 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))))) is different from false [2024-11-09 07:00:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:00:29,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144429241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:00:29,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [832582218] [2024-11-09 07:00:29,798 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 07:00:29,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:00:29,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 21] total 51 [2024-11-09 07:00:29,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274807097] [2024-11-09 07:00:29,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:00:29,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-09 07:00:29,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:00:29,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-09 07:00:29,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1929, Unknown=95, NotChecked=294, Total=2756 [2024-11-09 07:00:29,803 INFO L87 Difference]: Start difference. First operand 4417 states and 11187 transitions. Second operand has 53 states, 52 states have (on average 4.269230769230769) internal successors, (222), 52 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:00:45,636 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] [2024-11-09 07:00:48,133 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] [2024-11-09 07:00:52,368 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] [2024-11-09 07:00:55,325 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse10 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600)) (.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|)) (.cse11 (select .cse9 .cse10)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1600 |c_~#queue~0.offset|))) (and (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_60| Int)) (let ((.cse4 (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_60|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1476) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))) |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse3 v_ArrVal_1484) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))) (forall ((v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (let ((.cse7 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse9 .cse10 (+ |c_t2Thread1of1ForFork1_dequeue_#t~post48#1| 1))))) (store .cse7 |c_~#queue~0.base| (store (store (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|)) .cse3 v_ArrVal_1484) .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse1) 2147483647)) (< .cse11 2147483647) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1478 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1473 (Array Int Int)) (v_ArrVal_1484 Int) (v_ArrVal_1472 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (v_ArrVal_1476 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_60| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_62| Int)) (let ((.cse14 (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_62|))) (let ((.cse13 (let ((.cse15 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 v_ArrVal_1472)) |c_~#stored_elements~0.base| v_ArrVal_1473) |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_60|)))) (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse3 v_ArrVal_1476) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))) |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse12 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse12 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ |c_~#queue~0.offset| (* 4 (select .cse12 .cse2))) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse3 v_ArrVal_1484) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse13 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (+ (select .cse14 .cse2) 1) v_ArrVal_1472)))))) (= |c_t2Thread1of1ForFork1_dequeue_#t~post48#1| 1) (forall ((v_ArrVal_1480 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (or (< .cse11 |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (let ((.cse16 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store .cse9 (+ 1608 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) v_ArrVal_1480) .cse10 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1))))) (store .cse16 |c_~#queue~0.base| (store (store (let ((.cse17 (select .cse16 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|)) .cse3 v_ArrVal_1484) .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse1) 2147483647))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse19 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse20 .cse21 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse18 (select (store .cse19 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse18 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse19 |c_~#queue~0.base| (store (store (store (store .cse18 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse18 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse3 v_ArrVal_1484) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse1) 2147483647) (< (select .cse20 .cse21) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))))))) is different from false [2024-11-09 07:01:03,753 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1600 |c_~#queue~0.offset|)) (.cse9 (select .cse10 .cse12))) (and (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|)) (.cse1 (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 1600))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store .cse0 .cse1 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1))))) (store .cse2 |c_~#queue~0.base| (store (store (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|)) .cse5 v_ArrVal_1484) .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|)))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse6) 2147483647)))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1476) .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse8 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse8 .cse6 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse6) 2147483647) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (select .cse8 .cse6) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))) (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse6) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_60| Int)) (let ((.cse14 (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_60|)))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse14 .cse5 v_ArrVal_1476) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))) |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse13 .cse6 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse6) 2147483647) (< (select .cse13 .cse6) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select .cse14 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))) (forall ((v_ArrVal_1484 Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_1484) .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse6) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse12 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse16 (select (store .cse17 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse16 .cse6) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse17 |c_~#queue~0.base| (store (store (store (store .cse16 .cse6 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse6) 2147483647) (< .cse9 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|)))))))) is different from false [2024-11-09 07:01:07,833 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] [2024-11-09 07:01:15,523 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] [2024-11-09 07:01:44,549 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] [2024-11-09 07:01:46,756 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] [2024-11-09 07:01:49,436 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] [2024-11-09 07:01:49,628 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (select .cse6 .cse8))) (and (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1476) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))) (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse9 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse9 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)))) (forall ((v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|)) .cse4 v_ArrVal_1484) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1484 Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1484) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse11 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store (store (store .cse11 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|)))))))) is different from false [2024-11-09 07:01:52,334 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] [2024-11-09 07:01:54,578 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] [2024-11-09 07:02:15,106 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] [2024-11-09 07:02:20,528 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] [2024-11-09 07:02:22,595 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] [2024-11-09 07:02:24,604 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] [2024-11-09 07:02:26,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:02:34,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse3 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse3 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store (store .cse3 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse6 v_ArrVal_1484) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse8 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse8 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse8 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse6 v_ArrVal_1484) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse8 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))))) is different from false [2024-11-09 07:02:36,612 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] [2024-11-09 07:03:10,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:03:26,867 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] [2024-11-09 07:03:32,898 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] [2024-11-09 07:03:34,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:03:36,330 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] [2024-11-09 07:04:22,665 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] [2024-11-09 07:04:24,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:04:27,590 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] [2024-11-09 07:04:31,629 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] [2024-11-09 07:04:33,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:04:36,339 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] [2024-11-09 07:04:38,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:04:41,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:05:12,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:05:25,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:05:25,317 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select .cse6 .cse8)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (and (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1476) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))) (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1484 Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1484) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse9 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse9 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|)))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse10 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store (store (store .cse10 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse13 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store (store (store .cse13 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse13 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|)))))))) is different from false [2024-11-09 07:05:27,372 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] [2024-11-09 07:05:29,544 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select .cse6 .cse8)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (and (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1476) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))) (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|)) .cse4 v_ArrVal_1484) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1484 Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1484) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse10 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store (store (store .cse10 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse13 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store (store (store .cse13 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse13 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse13 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|)))))))) is different from false [2024-11-09 07:05:32,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select .cse6 .cse8)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (and (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1476) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))) (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (let ((.cse9 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse9 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse9 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)))) (forall ((v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|)) .cse4 v_ArrVal_1484) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1484 Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1484) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse11 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse12 |c_~#queue~0.base| (store (store (store (store .cse11 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse14 (select (store .cse13 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse13 |c_~#queue~0.base| (store (store (store (store .cse14 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse14 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse14 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|)))))))) is different from false [2024-11-09 07:05:34,430 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] [2024-11-09 07:05:35,451 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse3 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse3 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)))) (forall ((v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|)) .cse5 v_ArrVal_1484) .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse7 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse7 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse7 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse10 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store (store (store .cse10 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse10 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse10 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))))) is different from false [2024-11-09 07:05:43,235 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] [2024-11-09 07:05:43,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (select .cse6 .cse8))) (and (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1476) .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))) (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1484 Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1484) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse9 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse9 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|)))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse10 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse11 |c_~#queue~0.base| (store (store (store (store .cse10 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|)))))))) is different from false [2024-11-09 07:05:46,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:05:49,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:05:53,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:05:55,215 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] [2024-11-09 07:05:56,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:05:57,102 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse3 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse3 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|)))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse6 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse6 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse6 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse6 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|))))) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse9 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store (store (store .cse9 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse9 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse5 v_ArrVal_1484) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse9 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))))) is different from false [2024-11-09 07:05:59,298 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] [2024-11-09 07:06:02,462 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] [2024-11-09 07:06:04,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:06:11,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:06:14,173 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] [2024-11-09 07:06:15,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:06:17,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:06:18,574 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (and (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1476 Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1476) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116| 1))))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse1 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_115| 1))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_116|) (< (select .cse1 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|))))) (forall ((v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((|v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| Int) (v_ArrVal_1484 Int) (v_ArrVal_1478 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1478) |c_~#queue~0.base|))) (or (< (select .cse8 .cse2) |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse8 .cse2 (+ |v_t2Thread1of1ForFork1_dequeue_#t~post48#1_54| 1)) (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|) .cse4 v_ArrVal_1484) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)))) (forall ((v_ArrVal_1484 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_58| Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_58|)) .cse4 v_ArrVal_1484) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1484 Int) (v_ArrVal_1486 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post41#1| Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1484) .cse6 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1486) |c_~#queue~0.base|) .cse2) 2147483647)))) is different from false [2024-11-09 07:06:19,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:06:23,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:06:25,235 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] [2024-11-09 07:06:33,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:06:35,906 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] [2024-11-09 07:06:37,996 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] [2024-11-09 07:06:40,750 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] [2024-11-09 07:06:43,525 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] [2024-11-09 07:06:46,475 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] [2024-11-09 07:06:59,769 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] [2024-11-09 07:07:01,779 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] [2024-11-09 07:07:03,790 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] [2024-11-09 07:07:28,433 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] [2024-11-09 07:07:30,482 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] [2024-11-09 07:07:37,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:07:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:07:39,074 INFO L93 Difference]: Finished difference Result 10064 states and 25215 transitions. [2024-11-09 07:07:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-11-09 07:07:39,075 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 4.269230769230769) internal successors, (222), 52 states have internal predecessors, (222), 0 states have call successors, (0), 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 74 [2024-11-09 07:07:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:07:39,103 INFO L225 Difference]: With dead ends: 10064 [2024-11-09 07:07:39,103 INFO L226 Difference]: Without dead ends: 9511 [2024-11-09 07:07:39,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 118 SyntacticMatches, 10 SemanticMatches, 119 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 291.5s TimeCoverageRelationStatistics Valid=1762, Invalid=9063, Unknown=573, NotChecked=3122, Total=14520 [2024-11-09 07:07:39,110 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1442 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 3179 mSolverCounterSat, 199 mSolverCounterUnsat, 812 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 168.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 12262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 3179 IncrementalHoareTripleChecker+Invalid, 812 IncrementalHoareTripleChecker+Unknown, 8072 IncrementalHoareTripleChecker+Unchecked, 171.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:07:39,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 2388 Invalid, 12262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [199 Valid, 3179 Invalid, 812 Unknown, 8072 Unchecked, 171.1s Time] [2024-11-09 07:07:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9511 states. [2024-11-09 07:07:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9511 to 7601. [2024-11-09 07:07:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7601 states, 7593 states have (on average 2.5610430659818255) internal successors, (19446), 7600 states have internal predecessors, (19446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:07:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7601 states to 7601 states and 19446 transitions. [2024-11-09 07:07:39,884 INFO L78 Accepts]: Start accepts. Automaton has 7601 states and 19446 transitions. Word has length 74 [2024-11-09 07:07:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:07:39,884 INFO L471 AbstractCegarLoop]: Abstraction has 7601 states and 19446 transitions. [2024-11-09 07:07:39,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.269230769230769) internal successors, (222), 52 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:07:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 7601 states and 19446 transitions. [2024-11-09 07:07:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 07:07:39,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:07:39,891 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:07:39,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 07:07:40,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:07:40,092 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2024-11-09 07:07:40,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:07:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1798226069, now seen corresponding path program 1 times [2024-11-09 07:07:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:07:40,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672296021] [2024-11-09 07:07:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:07:40,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:07:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:07:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:07:49,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:07:49,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672296021] [2024-11-09 07:07:49,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672296021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:07:49,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124739092] [2024-11-09 07:07:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:07:49,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:07:49,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:07:49,578 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:07:49,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2be59973-6cf2-47a2-bb61-7d3340e5c84d/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:07:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:07:50,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 2120 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-09 07:07:50,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:07:50,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-09 07:07:50,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:07:51,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:07:51,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 07:07:52,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:07:52,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 07:07:52,661 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-09 07:07:52,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-11-09 07:07:52,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:07:53,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-09 07:07:53,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:07:53,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 07:07:54,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:07:54,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 07:07:55,483 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-11-09 07:07:55,484 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-11-09 07:07:55,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:07:56,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-09 07:07:56,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:07:56,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 07:07:57,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-09 07:07:58,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 07:07:58,722 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 38 treesize of output 28 [2024-11-09 07:07:58,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-11-09 07:07:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:07:58,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:08:07,221 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1635 Int)) (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) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1635 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1635) (+ 1600 |c_~#queue~0.offset|) 1) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 1604)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647)))) is different from false [2024-11-09 07:08:07,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1635 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|) (< (select .cse2 .cse3) (+ v_ArrVal_1635 1)) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1635) (+ 1600 |c_~#queue~0.offset|) 1) (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 1604)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse3) 2147483647))))) is different from false [2024-11-09 07:08:07,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (v_ArrVal_1635 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (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_1630) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_1630) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1635) (+ 1600 |c_~#queue~0.offset|) 1) (+ (* 4 (select .cse2 (+ |c_~#queue~0.offset| 1604))) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse3) 2147483647) (< (select .cse2 .cse3) (+ v_ArrVal_1635 1)))))) is different from false [2024-11-09 07:08:14,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_66| Int) (v_ArrVal_1635 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1625) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_66|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1630) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1630) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1635) (+ 1600 |c_~#queue~0.offset|) 1) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_1635 1)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|)))))) is different from false [2024-11-09 07:08:18,788 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (v_ArrVal_1622 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_66| Int) (v_ArrVal_1635 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1622) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130| 1))))) (let ((.cse5 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_1625) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_66|))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1630) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130|) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1635) (+ 1600 |c_~#queue~0.offset|) 1) (+ (* (select .cse2 .cse4) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse3) 2147483647) (< 2147483647 v_ArrVal_1630) (< (select .cse2 .cse3) (+ v_ArrVal_1635 1)) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|))))))) is different from false [2024-11-09 07:08:28,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_68| Int) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (v_ArrVal_1622 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_66| Int) (v_ArrVal_1635 Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse5 (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_1618)))) (let ((.cse4 (let ((.cse7 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1620) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_68|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse6 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1622) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130| 1))) |c_~#stored_elements~0.base| v_ArrVal_1625) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_66|)))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1630) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1635) (+ 1600 |c_~#queue~0.offset|) 1) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|) (< 2147483647 v_ArrVal_1630) (< (select .cse0 .cse1) (+ v_ArrVal_1635 1)) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130|) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_1618))))))) is different from false [2024-11-09 07:08:28,467 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_68| Int) (v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1620 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (v_ArrVal_1622 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_66| Int) (v_ArrVal_1635 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1618)))) (let ((.cse6 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1620) |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_68|))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1622) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130| 1))) |c_~#stored_elements~0.base| v_ArrVal_1625) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_66|)))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_1630) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 v_ArrVal_1635) (+ 1600 |c_~#queue~0.offset|) 1) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|) (< 2147483647 v_ArrVal_1630) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1618) (< (select .cse0 .cse1) (+ v_ArrVal_1635 1)) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130|)))))))) is different from false [2024-11-09 07:08:28,612 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1618 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_68| Int) (v_ArrVal_1633 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1620 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (v_ArrVal_1622 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_66| Int) (v_ArrVal_1635 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_1618)))) (let ((.cse6 (let ((.cse9 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1620) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_68|))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse4 (let ((.cse8 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_1622) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130| 1))) |c_~#stored_elements~0.base| v_ArrVal_1625) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse5) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_66|)))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1630) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1630) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1618) (< (select .cse2 .cse3) (+ v_ArrVal_1635 1)) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|) (< (select .cse6 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_130|) (< (select (store (store (store .cse2 .cse3 v_ArrVal_1635) (+ 1600 |c_~#queue~0.offset|) 1) (+ (* (select .cse2 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse3) 2147483647)))))))) is different from false [2024-11-09 07:08:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-09 07:08:46,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124739092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:08:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1037299174] [2024-11-09 07:08:46,544 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) 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:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-11-09 07:08:46,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:08:46,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 23] total 57 [2024-11-09 07:08:46,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58765267] [2024-11-09 07:08:46,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:08:46,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-09 07:08:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:08:46,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-09 07:08:46,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=2023, Unknown=58, NotChecked=824, Total=3306 [2024-11-09 07:08:46,548 INFO L87 Difference]: Start difference. First operand 7601 states and 19446 transitions. Second operand has 58 states, 58 states have (on average 4.310344827586207) internal successors, (250), 57 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:09:08,531 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1635 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1635 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1635) .cse2 1) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1635 Int)) (or (< (select .cse4 .cse1) (+ v_ArrVal_1635 1)) (< (select (store (store (store .cse4 .cse1 v_ArrVal_1635) .cse2 1) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647))) (forall ((v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_66| Int) (v_ArrVal_1635 Int)) (let ((.cse6 (store .cse4 .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_66|))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1630) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1630) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|) (< (select (store (store (store .cse7 .cse1 v_ArrVal_1635) .cse2 1) (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647) (< (select .cse7 .cse1) (+ v_ArrVal_1635 1)))))) (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_66| Int) (v_ArrVal_1635 Int)) (let ((.cse9 (let ((.cse10 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1625) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_66|)))) (let ((.cse8 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_1630) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1630) (< (select (store (store (store .cse8 .cse1 v_ArrVal_1635) .cse2 1) (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647) (< (select .cse8 .cse1) (+ v_ArrVal_1635 1)) (< (select .cse9 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|)))))))) is different from false [2024-11-09 07:09:08,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1635 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1635 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1635) .cse2 1) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647)))) (forall ((v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_66| Int) (v_ArrVal_1635 Int)) (let ((.cse5 (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1625) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_66|)))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1630) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1630) (< (select (store (store (store .cse4 .cse1 v_ArrVal_1635) .cse2 1) (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647) (< (select .cse4 .cse1) (+ v_ArrVal_1635 1)) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|))))))) is different from false [2024-11-09 07:09:12,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1635 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_1635 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_1635) .cse2 1) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1635 Int)) (or (< (select .cse4 .cse1) (+ v_ArrVal_1635 1)) (< (select (store (store (store .cse4 .cse1 v_ArrVal_1635) .cse2 1) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647))) (forall ((v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_64| Int) (v_ArrVal_1630 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_66| Int) (v_ArrVal_1635 Int)) (let ((.cse6 (store .cse4 .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_66|))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_1630) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127| 1))) |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_1630) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_127|) (< (select (store (store (store .cse7 .cse1 v_ArrVal_1635) .cse2 1) (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_64|) .cse1) 2147483647) (< (select .cse7 .cse1) (+ v_ArrVal_1635 1))))))))) is different from false [2024-11-09 07:09:31,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:09:33,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:09:35,526 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] [2024-11-09 07:09:41,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:09:43,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:09:46,081 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] [2024-11-09 07:09:48,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 07:09:55,301 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]